About the Execution of 2025-gold for FileSystem-PT-N02I10B10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 534.731 | 108632.00 | 135296.00 | 490.40 | 0 1 1 1 0 0 0 0 0 0 0 1 0 0 0 0 | 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.r351-smll-178021502100053.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-N02I10B10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-smll-178021502100053
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 11K May 27 10:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 27 10:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 27 10:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 27 10:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K 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 19K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 10:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 27 10:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 27 10:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K May 27 10:19 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-N02I10B10-UpperBounds-00
FORMULA_NAME FileSystem-PT-N02I10B10-UpperBounds-01
FORMULA_NAME FileSystem-PT-N02I10B10-UpperBounds-02
FORMULA_NAME FileSystem-PT-N02I10B10-UpperBounds-03
FORMULA_NAME FileSystem-PT-N02I10B10-UpperBounds-04
FORMULA_NAME FileSystem-PT-N02I10B10-UpperBounds-05
FORMULA_NAME FileSystem-PT-N02I10B10-UpperBounds-06
FORMULA_NAME FileSystem-PT-N02I10B10-UpperBounds-07
FORMULA_NAME FileSystem-PT-N02I10B10-UpperBounds-08
FORMULA_NAME FileSystem-PT-N02I10B10-UpperBounds-09
FORMULA_NAME FileSystem-PT-N02I10B10-UpperBounds-10
FORMULA_NAME FileSystem-PT-N02I10B10-UpperBounds-11
FORMULA_NAME FileSystem-PT-N02I10B10-UpperBounds-12
FORMULA_NAME FileSystem-PT-N02I10B10-UpperBounds-13
FORMULA_NAME FileSystem-PT-N02I10B10-UpperBounds-14
FORMULA_NAME FileSystem-PT-N02I10B10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1781614883740
Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N02I10B10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-06-16 13:01:26] [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:01:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 13:01:26] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2026-06-16 13:01:26] [INFO ] Transformed 561 places.
[2026-06-16 13:01:26] [INFO ] Transformed 520 transitions.
[2026-06-16 13:01:26] [INFO ] Parsed PT model containing 561 places and 520 transitions and 1850 arcs in 459 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 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:01:27] [INFO ] Computed 41 invariants in 81 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FileSystem-PT-N02I10B10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (151 resets) in 134 ms. (74 steps per ms)
FORMULA FileSystem-PT-N02I10B10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N02I10B10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N02I10B10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120010 steps (504 resets) in 406 ms. (294 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-06-16 13:01:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:01:28] [INFO ] [Real]Absence check using 31 positive place invariants in 191 ms returned sat
[2026-06-16 13:01:28] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 14 ms returned sat
[2026-06-16 13:01:29] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2026-06-16 13:01:29] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-16 13:01:29] [INFO ] [Real]Added 100 Read/Feed constraints in 106 ms returned sat
[2026-06-16 13:01:29] [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:01:29] [INFO ] [Nat]Absence check using 31 positive place invariants in 55 ms returned sat
[2026-06-16 13:01:29] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 13 ms returned sat
[2026-06-16 13:01:30] [INFO ] [Nat]Absence check using state equation in 518 ms returned sat
[2026-06-16 13:01:30] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 13:01:30] [INFO ] [Nat]Added 100 Read/Feed constraints in 554 ms returned sat
[2026-06-16 13:01:30] [INFO ] Computed and/alt/rep : 410/420/410 causal constraints (skipped 100 transitions) in 62 ms.
[2026-06-16 13:01:31] [INFO ] Added : 68 causal constraints over 14 iterations in 1207 ms. Result :sat
Minimization took 580 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:01:32] [INFO ] [Real]Absence check using 31 positive place invariants in 45 ms returned sat
[2026-06-16 13:01:32] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 8 ms returned sat
[2026-06-16 13:01:33] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2026-06-16 13:01:33] [INFO ] [Real]Added 100 Read/Feed constraints in 112 ms returned sat
[2026-06-16 13:01:33] [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:01:33] [INFO ] [Nat]Absence check using 31 positive place invariants in 49 ms returned sat
[2026-06-16 13:01:33] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 13 ms returned sat
[2026-06-16 13:01:34] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2026-06-16 13:01:34] [INFO ] [Nat]Added 100 Read/Feed constraints in 345 ms returned sat
[2026-06-16 13:01:34] [INFO ] Computed and/alt/rep : 410/420/410 causal constraints (skipped 100 transitions) in 72 ms.
[2026-06-16 13:01:36] [INFO ] Added : 69 causal constraints over 14 iterations in 1439 ms. Result :sat
Minimization took 575 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:01:36] [INFO ] [Real]Absence check using 31 positive place invariants in 45 ms returned sat
[2026-06-16 13:01:36] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 10 ms returned sat
[2026-06-16 13:01:37] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2026-06-16 13:01:37] [INFO ] [Real]Added 100 Read/Feed constraints in 42 ms returned sat
[2026-06-16 13:01:37] [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:01:37] [INFO ] [Nat]Absence check using 31 positive place invariants in 37 ms returned sat
[2026-06-16 13:01:37] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 10 ms returned sat
[2026-06-16 13:01:38] [INFO ] [Nat]Absence check using state equation in 471 ms returned sat
[2026-06-16 13:01:38] [INFO ] [Nat]Added 100 Read/Feed constraints in 153 ms returned sat
[2026-06-16 13:01:38] [INFO ] Computed and/alt/rep : 410/420/410 causal constraints (skipped 100 transitions) in 67 ms.
[2026-06-16 13:01:39] [INFO ] Added : 68 causal constraints over 14 iterations in 1084 ms. Result :sat
Minimization took 581 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:01:40] [INFO ] [Real]Absence check using 31 positive place invariants in 47 ms returned sat
[2026-06-16 13:01:40] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 13 ms returned sat
[2026-06-16 13:01:40] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2026-06-16 13:01:40] [INFO ] [Real]Added 100 Read/Feed constraints in 85 ms returned sat
[2026-06-16 13:01:40] [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:01:40] [INFO ] [Nat]Absence check using 31 positive place invariants in 44 ms returned sat
[2026-06-16 13:01:40] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 10 ms returned sat
[2026-06-16 13:01:41] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2026-06-16 13:01:41] [INFO ] [Nat]Added 100 Read/Feed constraints in 342 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:01:41] [INFO ] [Real]Absence check using 31 positive place invariants in 28 ms returned sat
[2026-06-16 13:01:41] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 7 ms returned sat
[2026-06-16 13:01:42] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2026-06-16 13:01:42] [INFO ] [Real]Added 100 Read/Feed constraints in 78 ms returned sat
[2026-06-16 13:01:42] [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:01:42] [INFO ] [Nat]Absence check using 31 positive place invariants in 45 ms returned sat
[2026-06-16 13:01:42] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 11 ms returned sat
[2026-06-16 13:01:43] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2026-06-16 13:01:43] [INFO ] [Nat]Added 100 Read/Feed constraints in 259 ms returned sat
[2026-06-16 13:01:43] [INFO ] Computed and/alt/rep : 410/420/410 causal constraints (skipped 100 transitions) in 57 ms.
[2026-06-16 13:01:44] [INFO ] Added : 68 causal constraints over 14 iterations in 1243 ms. Result :sat
Minimization took 570 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:01:45] [INFO ] [Real]Absence check using 31 positive place invariants in 38 ms returned sat
[2026-06-16 13:01:45] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 8 ms returned sat
[2026-06-16 13:01:45] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2026-06-16 13:01:46] [INFO ] [Real]Added 100 Read/Feed constraints in 102 ms returned sat
[2026-06-16 13:01:46] [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:01:46] [INFO ] [Nat]Absence check using 31 positive place invariants in 34 ms returned sat
[2026-06-16 13:01:46] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 9 ms returned sat
[2026-06-16 13:01:46] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2026-06-16 13:01:46] [INFO ] [Nat]Added 100 Read/Feed constraints in 369 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:01:47] [INFO ] [Real]Absence check using 31 positive place invariants in 30 ms returned sat
[2026-06-16 13:01:47] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 8 ms returned sat
[2026-06-16 13:01:47] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2026-06-16 13:01:47] [INFO ] [Real]Added 100 Read/Feed constraints in 68 ms returned sat
[2026-06-16 13:01: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:01:47] [INFO ] [Nat]Absence check using 31 positive place invariants in 48 ms returned sat
[2026-06-16 13:01:47] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 12 ms returned sat
[2026-06-16 13:01:48] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2026-06-16 13:01:48] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 13:01:48] [INFO ] [Nat]Added 100 Read/Feed constraints in 683 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:01:49] [INFO ] [Real]Absence check using 31 positive place invariants in 32 ms returned sat
[2026-06-16 13:01:49] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 11 ms returned sat
[2026-06-16 13:01:49] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2026-06-16 13:01:49] [INFO ] [Real]Added 100 Read/Feed constraints in 35 ms returned sat
[2026-06-16 13:01:49] [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:01:49] [INFO ] [Nat]Absence check using 31 positive place invariants in 47 ms returned sat
[2026-06-16 13:01:49] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 12 ms returned sat
[2026-06-16 13:01:50] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2026-06-16 13:01:50] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 13:01:50] [INFO ] [Nat]Added 100 Read/Feed constraints in 664 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:01:51] [INFO ] [Real]Absence check using 31 positive place invariants in 26 ms returned sat
[2026-06-16 13:01:51] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 7 ms returned sat
[2026-06-16 13:01:51] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2026-06-16 13:01:51] [INFO ] [Real]Added 100 Read/Feed constraints in 42 ms returned sat
[2026-06-16 13:01:51] [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:01:51] [INFO ] [Nat]Absence check using 31 positive place invariants in 32 ms returned sat
[2026-06-16 13:01:51] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 8 ms returned sat
[2026-06-16 13:01:52] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2026-06-16 13:01:52] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 13:01:52] [INFO ] [Nat]Added 100 Read/Feed constraints in 572 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:01:52] [INFO ] [Real]Absence check using 31 positive place invariants in 30 ms returned sat
[2026-06-16 13:01:52] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 6 ms returned sat
[2026-06-16 13:01:53] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2026-06-16 13:01:53] [INFO ] [Real]Added 100 Read/Feed constraints in 41 ms returned sat
[2026-06-16 13:01:53] [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:01:53] [INFO ] [Nat]Absence check using 31 positive place invariants in 35 ms returned sat
[2026-06-16 13:01:53] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 9 ms returned sat
[2026-06-16 13:01:53] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2026-06-16 13:01:54] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 13:01:54] [INFO ] [Nat]Added 100 Read/Feed constraints in 564 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:01:54] [INFO ] [Real]Absence check using 31 positive place invariants in 37 ms returned sat
[2026-06-16 13:01:54] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 10 ms returned sat
[2026-06-16 13:01:54] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2026-06-16 13:01:54] [INFO ] [Real]Added 100 Read/Feed constraints in 80 ms returned sat
[2026-06-16 13:01:54] [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:01:55] [INFO ] [Nat]Absence check using 31 positive place invariants in 46 ms returned sat
[2026-06-16 13:01:55] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 16 ms returned sat
[2026-06-16 13:01:55] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2026-06-16 13:01:56] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 13:01:56] [INFO ] [Nat]Added 100 Read/Feed constraints in 769 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:01:56] [INFO ] [Real]Absence check using 31 positive place invariants in 26 ms returned sat
[2026-06-16 13:01:56] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 7 ms returned sat
[2026-06-16 13:01:56] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2026-06-16 13:01:57] [INFO ] [Real]Added 100 Read/Feed constraints in 133 ms returned sat
[2026-06-16 13:01: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:01:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 45 ms returned sat
[2026-06-16 13:01:57] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 11 ms returned sat
[2026-06-16 13:01:57] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2026-06-16 13:01:58] [INFO ] [Nat]Added 100 Read/Feed constraints in 250 ms returned sat
[2026-06-16 13:01:58] [INFO ] Computed and/alt/rep : 410/420/410 causal constraints (skipped 100 transitions) in 61 ms.
[2026-06-16 13:01:59] [INFO ] Added : 70 causal constraints over 14 iterations in 1226 ms. Result :sat
Minimization took 585 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1]
FORMULA FileSystem-PT-N02I10B10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I10B10-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I10B10-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I10B10-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I10B10-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I10B10-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I10B10-UpperBounds-06 0 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 453 are kept as prefixes of interest. Removing 98 places using SCC suffix rule.7 ms
Discarding 98 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 453 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 443 transition count 510
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 106 place count 358 transition count 425
Iterating global reduction 2 with 85 rules applied. Total rules applied 191 place count 358 transition count 425
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 3 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 411 place count 248 transition count 315
Free-agglomeration rule (complex) applied 100 times.
Iterating global reduction 2 with 100 rules applied. Total rules applied 511 place count 248 transition count 215
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 2 with 105 rules applied. Total rules applied 616 place count 143 transition count 215
Applied a total of 616 rules in 288 ms. Remains 143 /551 variables (removed 408) and now considering 215/520 (removed 305) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 143/551 places, 215/520 transitions.
// Phase 1: matrix 215 rows 143 cols
[2026-06-16 13:02:00] [INFO ] Computed 17 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 2501 ms. (399 steps per ms)
BEST_FIRST walk for 5000004 steps (41568 resets) in 3439 ms. (1453 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:02:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:02:06] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2026-06-16 13:02:06] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2026-06-16 13:02:06] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-16 13:02:06] [INFO ] [Real]Added 100 Read/Feed constraints in 27 ms returned sat
[2026-06-16 13:02:06] [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:02:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2026-06-16 13:02:06] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2026-06-16 13:02:06] [INFO ] [Nat]Added 100 Read/Feed constraints in 38 ms returned sat
[2026-06-16 13:02:06] [INFO ] Computed and/alt/rep : 105/115/105 causal constraints (skipped 100 transitions) in 27 ms.
[2026-06-16 13:02:06] [INFO ] Added : 10 causal constraints over 2 iterations in 115 ms. Result :sat
Minimization took 176 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:02:07] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2026-06-16 13:02:07] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2026-06-16 13:02:07] [INFO ] [Real]Added 100 Read/Feed constraints in 36 ms returned sat
[2026-06-16 13:02:07] [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:02:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2026-06-16 13:02:07] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2026-06-16 13:02:07] [INFO ] [Nat]Added 100 Read/Feed constraints in 35 ms returned sat
[2026-06-16 13:02:07] [INFO ] Computed and/alt/rep : 105/115/105 causal constraints (skipped 100 transitions) in 28 ms.
[2026-06-16 13:02:07] [INFO ] Added : 10 causal constraints over 2 iterations in 115 ms. Result :sat
Minimization took 189 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:02:07] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2026-06-16 13:02:07] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2026-06-16 13:02:07] [INFO ] [Real]Added 100 Read/Feed constraints in 21 ms returned sat
[2026-06-16 13:02:07] [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:02:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2026-06-16 13:02:08] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2026-06-16 13:02:08] [INFO ] [Nat]Added 100 Read/Feed constraints in 85 ms returned sat
[2026-06-16 13:02:08] [INFO ] Computed and/alt/rep : 105/115/105 causal constraints (skipped 100 transitions) in 27 ms.
[2026-06-16 13:02:08] [INFO ] Added : 11 causal constraints over 3 iterations in 143 ms. Result :sat
Minimization took 191 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:02:08] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2026-06-16 13:02:08] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2026-06-16 13:02:08] [INFO ] [Real]Added 100 Read/Feed constraints in 31 ms returned sat
[2026-06-16 13:02:08] [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:02:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2026-06-16 13:02:09] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2026-06-16 13:02:09] [INFO ] [Nat]Added 100 Read/Feed constraints in 64 ms returned sat
[2026-06-16 13:02:09] [INFO ] Computed and/alt/rep : 105/115/105 causal constraints (skipped 100 transitions) in 27 ms.
[2026-06-16 13:02:09] [INFO ] Added : 10 causal constraints over 2 iterations in 116 ms. Result :sat
Minimization took 174 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:02:09] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2026-06-16 13:02:09] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2026-06-16 13:02:09] [INFO ] [Real]Added 100 Read/Feed constraints in 29 ms returned sat
[2026-06-16 13:02:09] [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:02:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2026-06-16 13:02:09] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2026-06-16 13:02:09] [INFO ] [Nat]Added 100 Read/Feed constraints in 49 ms returned sat
[2026-06-16 13:02:09] [INFO ] Computed and/alt/rep : 105/115/105 causal constraints (skipped 100 transitions) in 26 ms.
[2026-06-16 13:02:10] [INFO ] Added : 11 causal constraints over 3 iterations in 130 ms. Result :sat
Minimization took 176 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 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 215/215 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 143/143 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 215/215 transitions.
Applied a total of 0 rules in 22 ms. Remains 143 /143 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2026-06-16 13:02:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-16 13:02:10] [INFO ] Implicit Places using invariants in 396 ms returned []
[2026-06-16 13:02:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-16 13:02:11] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-16 13:02:12] [INFO ] Implicit Places using invariants and state equation in 1253 ms returned []
Implicit Place search using SMT with State Equation took 1652 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-06-16 13:02:12] [INFO ] Redundant transitions in 15 ms returned []
Running 205 sub problems to find dead transitions.
[2026-06-16 13:02:12] [INFO ] Invariant cache hit.
[2026-06-16 13:02:12] [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/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 11/141 variables, 2/17 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:02:16] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:16] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:16] [INFO ] Deduced a trap composed of 48 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:02:16] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:16] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:16] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:16] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:17] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:17] [INFO ] Deduced a trap composed of 2 places in 154 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:17] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:17] [INFO ] Deduced a trap composed of 2 places in 137 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:17] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:17] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:17] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:17] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:18] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:18] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:18] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:18] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:18] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 20/37 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:02:20] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:20] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:20] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:20] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:20] [INFO ] Deduced a trap composed of 66 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:20] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:20] [INFO ] Deduced a trap composed of 41 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:02:21] [INFO ] Deduced a trap composed of 41 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:02:21] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:21] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:21] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:21] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:21] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:22] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:22] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:22] [INFO ] Deduced a trap composed of 63 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:22] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:23] [INFO ] Deduced a trap composed of 64 places in 178 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 18/55 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:02:24] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:24] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:24] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:25] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:25] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:25] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 6/61 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:02:26] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:27] [INFO ] Deduced a trap composed of 36 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:02:27] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 3/64 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:02:30] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:30] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 2/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:02:32] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:32] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 2/68 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:02:33] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 11 (OVERLAPS) 215/356 variables, 141/210 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
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 (/ 1.0 12.0))
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 (/ 1.0 12.0))
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 100/310 constraints. Problems are: Problem set: 20 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 356/358 variables, and 310 constraints, problems are : Problem set: 20 solved, 185 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 141/143 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 52/52 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/130 variables, 15/15 constraints. Problems are: Problem set: 20 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 2/17 constraints. Problems are: Problem set: 20 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/17 constraints. Problems are: Problem set: 20 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 11/141 variables, 2/19 constraints. Problems are: Problem set: 20 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 50/69 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:02:44] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:02:44] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 2/71 constraints. Problems are: Problem set: 20 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/71 constraints. Problems are: Problem set: 20 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 215/356 variables, 141/212 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/356 variables, 100/312 constraints. Problems are: Problem set: 170 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 27/339 constraints. Problems are: Problem set: 170 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/339 constraints. Problems are: Problem set: 170 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 2/358 variables, 2/341 constraints. Problems are: Problem set: 170 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 8/349 constraints. Problems are: Problem set: 170 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 0/349 constraints. Problems are: Problem set: 170 solved, 35 unsolved
At refinement iteration 14 (OVERLAPS) 0/358 variables, 0/349 constraints. Problems are: Problem set: 170 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 349 constraints, problems are : Problem set: 170 solved, 35 unsolved in 29845 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 143/143 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 35/205 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 170 solved, 35 unsolved
Search for dead transitions found 170 dead transitions in 60074ms
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 : 143/143 places, 45/215 transitions.
Graph (complete) has 126 edges and 143 vertex of which 7 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.0 ms
Discarding 136 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Reduce places removed 2 places and 5 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 5 transition count 0
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 3 rules in 2 ms. Remains 5 /143 variables (removed 138) and now considering 0/45 (removed 45) transitions.
[2026-06-16 13:03:12] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-16 13:03:12] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-06-16 13:03:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-16 13:03:12] [INFO ] Implicit Places using invariants and state equation in 19 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/143 places, 0/215 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61835 ms. Remains : 5/143 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-N02I10B10-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B10-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B10-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B10-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 106051 ms.
BK_STOP 1781614992372
--------------------
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-N02I10B10"
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-N02I10B10, 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-178021502100053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FileSystem-PT-N02I10B10.tgz
mv FileSystem-PT-N02I10B10 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 ;
