MCC'2026- Execution of r338-smll-178021499300429

About the Execution of ITS-Tools for FileSystem-PT-N02I15B15

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
618.728	152530.00	182813.00	622.10	0 0 0 0 0 1 0 0 0 0 0 0 0 1 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.r338-smll-178021499300429.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 itstools
Input is FileSystem-PT-N02I15B15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499300429
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 6.5K May 27 10:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 27 10:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 27 10:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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 26K Jun 16 12:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 4.5K May 27 10:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 27 10:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K 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 524K 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-N02I15B15-UpperBounds-00
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-01
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-02
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-03
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-04
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-05
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-06
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-07
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-08
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-09
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-10
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-11
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-12
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-13
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-14
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1781620373000

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N02I15B15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-06-16 14:32:54] [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 14:32:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 14:32:55] [INFO ] Load time of PNML (sax parser for PT used): 238 ms
[2026-06-16 14:32:55] [INFO ] Transformed 1216 places.
[2026-06-16 14:32:55] [INFO ] Transformed 1155 transitions.
[2026-06-16 14:32:55] [INFO ] Parsed PT model containing 1216 places and 1155 transitions and 4125 arcs in 391 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Reduce places removed 15 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 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, 0, 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]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1278114143552786216.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11129237904119172161.kers'
[2026-06-16 14:32:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1278114143552786216.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11129237904119172161.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 2 ms.
// Phase 1: matrix 1155 rows 1186 cols 3450 entries
Finished phase 1 with 930 SingleSign rule and 210 generalized
[2026-06-16 14:32:55] [INFO ] Computed 61 invariants in 34 ms
Computed 61 P flows in 35 ms.
Exported basis to /tmp/petrispot-output-11129237904119172161.kers
Total runtime 38 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 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, 1, 1, 1, 1]
RANDOM walk for 10000 steps (131 resets) in 129 ms. (76 steps per ms)
FORMULA FileSystem-PT-N02I15B15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N02I15B15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 140009 steps (413 resets) in 578 ms. (241 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 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, 1, 1]
[2026-06-16 14:32:56] [INFO ] Invariant cache hit.
[2026-06-16 14:32:57] [INFO ] [Real]Absence check using 46 positive place invariants in 79 ms returned sat
[2026-06-16 14:32:57] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 25 ms returned sat
[2026-06-16 14:32:58] [INFO ] [Real]Absence check using state equation in 1223 ms returned sat
[2026-06-16 14:32:58] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-16 14:32:59] [INFO ] [Real]Added 225 Read/Feed constraints in 583 ms returned sat
[2026-06-16 14:32:59] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:32:59] [INFO ] [Nat]Absence check using 46 positive place invariants in 79 ms returned sat
[2026-06-16 14:32:59] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 27 ms returned sat
[2026-06-16 14:33:00] [INFO ] [Nat]Absence check using state equation in 1040 ms returned sat
[2026-06-16 14:33:01] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 14:33:01] [INFO ] [Nat]Added 225 Read/Feed constraints in 1034 ms returned unknown
[2026-06-16 14:33:02] [INFO ] [Real]Absence check using 46 positive place invariants in 58 ms returned sat
[2026-06-16 14:33:02] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 21 ms returned sat
[2026-06-16 14:33:03] [INFO ] [Real]Absence check using state equation in 890 ms returned sat
[2026-06-16 14:33:03] [INFO ] [Real]Added 225 Read/Feed constraints in 169 ms returned sat
[2026-06-16 14:33:03] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:33:03] [INFO ] [Nat]Absence check using 46 positive place invariants in 74 ms returned sat
[2026-06-16 14:33:03] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 29 ms returned sat
[2026-06-16 14:33:04] [INFO ] [Nat]Absence check using state equation in 885 ms returned sat
[2026-06-16 14:33:05] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 14:33:05] [INFO ] [Nat]Added 225 Read/Feed constraints in 889 ms returned sat
[2026-06-16 14:33:05] [INFO ] Computed and/alt/rep : 915/930/915 causal constraints (skipped 225 transitions) in 101 ms.
[2026-06-16 14:33:08] [INFO ] Added : 85 causal constraints over 17 iterations in 2694 ms. Result :unknown
[2026-06-16 14:33:08] [INFO ] [Real]Absence check using 46 positive place invariants in 73 ms returned sat
[2026-06-16 14:33:08] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 33 ms returned sat
[2026-06-16 14:33:10] [INFO ] [Real]Absence check using state equation in 1341 ms returned sat
[2026-06-16 14:33:10] [INFO ] [Real]Added 225 Read/Feed constraints in 180 ms returned sat
[2026-06-16 14:33:10] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:33:10] [INFO ] [Nat]Absence check using 46 positive place invariants in 50 ms returned sat
[2026-06-16 14:33:10] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 22 ms returned sat
[2026-06-16 14:33:11] [INFO ] [Nat]Absence check using state equation in 1118 ms returned sat
[2026-06-16 14:33:12] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 14:33:12] [INFO ] [Nat]Added 225 Read/Feed constraints in 1038 ms returned unknown
[2026-06-16 14:33:13] [INFO ] [Real]Absence check using 46 positive place invariants in 66 ms returned sat
[2026-06-16 14:33:13] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 45 ms returned sat
[2026-06-16 14:33:14] [INFO ] [Real]Absence check using state equation in 889 ms returned sat
[2026-06-16 14:33:14] [INFO ] [Real]Added 225 Read/Feed constraints in 182 ms returned sat
[2026-06-16 14:33:14] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:33:14] [INFO ] [Nat]Absence check using 46 positive place invariants in 44 ms returned sat
[2026-06-16 14:33:14] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 28 ms returned sat
[2026-06-16 14:33:15] [INFO ] [Nat]Absence check using state equation in 1102 ms returned sat
[2026-06-16 14:33:16] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 14:33:17] [INFO ] [Nat]Added 225 Read/Feed constraints in 1049 ms returned unknown
[2026-06-16 14:33:17] [INFO ] [Real]Absence check using 46 positive place invariants in 46 ms returned sat
[2026-06-16 14:33:17] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 25 ms returned sat
[2026-06-16 14:33:18] [INFO ] [Real]Absence check using state equation in 871 ms returned sat
[2026-06-16 14:33:18] [INFO ] [Real]Added 225 Read/Feed constraints in 353 ms returned sat
[2026-06-16 14:33:18] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:33:19] [INFO ] [Nat]Absence check using 46 positive place invariants in 72 ms returned sat
[2026-06-16 14:33:19] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 37 ms returned sat
[2026-06-16 14:33:20] [INFO ] [Nat]Absence check using state equation in 1161 ms returned sat
[2026-06-16 14:33:20] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 14:33:21] [INFO ] [Nat]Added 225 Read/Feed constraints in 1038 ms returned unknown
[2026-06-16 14:33:21] [INFO ] [Real]Absence check using 46 positive place invariants in 67 ms returned sat
[2026-06-16 14:33:21] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 30 ms returned sat
[2026-06-16 14:33:22] [INFO ] [Real]Absence check using state equation in 971 ms returned sat
[2026-06-16 14:33:22] [INFO ] [Real]Added 225 Read/Feed constraints in 173 ms returned sat
[2026-06-16 14:33:22] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:33:23] [INFO ] [Nat]Absence check using 46 positive place invariants in 45 ms returned sat
[2026-06-16 14:33:23] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 18 ms returned sat
[2026-06-16 14:33:24] [INFO ] [Nat]Absence check using state equation in 872 ms returned sat
[2026-06-16 14:33:24] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 14:33:25] [INFO ] [Nat]Added 225 Read/Feed constraints in 1042 ms returned unknown
[2026-06-16 14:33:25] [INFO ] [Real]Absence check using 46 positive place invariants in 55 ms returned sat
[2026-06-16 14:33:25] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 29 ms returned sat
[2026-06-16 14:33:26] [INFO ] [Real]Absence check using state equation in 926 ms returned sat
[2026-06-16 14:33:26] [INFO ] [Real]Added 225 Read/Feed constraints in 303 ms returned sat
[2026-06-16 14:33:26] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:33:27] [INFO ] [Nat]Absence check using 46 positive place invariants in 68 ms returned sat
[2026-06-16 14:33:27] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 39 ms returned sat
[2026-06-16 14:33:28] [INFO ] [Nat]Absence check using state equation in 1034 ms returned sat
[2026-06-16 14:33:28] [INFO ] [Nat]Added 225 Read/Feed constraints in 285 ms returned sat
[2026-06-16 14:33:28] [INFO ] Computed and/alt/rep : 915/930/915 causal constraints (skipped 225 transitions) in 101 ms.
[2026-06-16 14:33:31] [INFO ] Added : 95 causal constraints over 19 iterations in 3028 ms. Result :sat
Minimization took 194 ms.
[2026-06-16 14:33:32] [INFO ] [Real]Absence check using 46 positive place invariants in 74 ms returned sat
[2026-06-16 14:33:32] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 32 ms returned sat
[2026-06-16 14:33:33] [INFO ] [Real]Absence check using state equation in 1233 ms returned sat
[2026-06-16 14:33:33] [INFO ] [Real]Added 225 Read/Feed constraints in 329 ms returned unsat
[2026-06-16 14:33:34] [INFO ] [Real]Absence check using 46 positive place invariants in 57 ms returned sat
[2026-06-16 14:33:34] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 30 ms returned sat
[2026-06-16 14:33:35] [INFO ] [Real]Absence check using state equation in 1134 ms returned sat
[2026-06-16 14:33:35] [INFO ] [Real]Added 225 Read/Feed constraints in 203 ms returned sat
[2026-06-16 14:33:35] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:33:36] [INFO ] [Nat]Absence check using 46 positive place invariants in 62 ms returned sat
[2026-06-16 14:33:36] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 24 ms returned sat
[2026-06-16 14:33:37] [INFO ] [Nat]Absence check using state equation in 993 ms returned sat
[2026-06-16 14:33:37] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 14:33:38] [INFO ] [Nat]Added 225 Read/Feed constraints in 1032 ms returned unknown
[2026-06-16 14:33:38] [INFO ] [Real]Absence check using 46 positive place invariants in 57 ms returned sat
[2026-06-16 14:33:38] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 33 ms returned sat
[2026-06-16 14:33:39] [INFO ] [Real]Absence check using state equation in 1055 ms returned sat
[2026-06-16 14:33:39] [INFO ] [Real]Added 225 Read/Feed constraints in 319 ms returned sat
[2026-06-16 14:33:39] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:33:40] [INFO ] [Nat]Absence check using 46 positive place invariants in 68 ms returned sat
[2026-06-16 14:33:40] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 30 ms returned sat
[2026-06-16 14:33:41] [INFO ] [Nat]Absence check using state equation in 984 ms returned sat
[2026-06-16 14:33:41] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 14:33:42] [INFO ] [Nat]Added 225 Read/Feed constraints in 1038 ms returned unknown
[2026-06-16 14:33:42] [INFO ] [Real]Absence check using 46 positive place invariants in 66 ms returned sat
[2026-06-16 14:33:42] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 28 ms returned sat
[2026-06-16 14:33:43] [INFO ] [Real]Absence check using state equation in 1115 ms returned sat
[2026-06-16 14:33:44] [INFO ] [Real]Added 225 Read/Feed constraints in 62 ms returned sat
[2026-06-16 14:33:44] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:33:44] [INFO ] [Nat]Absence check using 46 positive place invariants in 44 ms returned sat
[2026-06-16 14:33:44] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 17 ms returned sat
[2026-06-16 14:33:45] [INFO ] [Nat]Absence check using state equation in 885 ms returned sat
[2026-06-16 14:33:45] [INFO ] [Nat]Added 225 Read/Feed constraints in 341 ms returned sat
[2026-06-16 14:33:45] [INFO ] Computed and/alt/rep : 915/930/915 causal constraints (skipped 225 transitions) in 94 ms.
[2026-06-16 14:33:47] [INFO ] Added : 88 causal constraints over 18 iterations in 2059 ms. Result :sat
Minimization took 825 ms.
[2026-06-16 14:33:48] [INFO ] [Real]Absence check using 46 positive place invariants in 66 ms returned sat
[2026-06-16 14:33:48] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 32 ms returned sat
[2026-06-16 14:33:49] [INFO ] [Real]Absence check using state equation in 1020 ms returned sat
[2026-06-16 14:33:50] [INFO ] [Real]Added 225 Read/Feed constraints in 139 ms returned sat
[2026-06-16 14:33:50] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:33:50] [INFO ] [Nat]Absence check using 46 positive place invariants in 68 ms returned sat
[2026-06-16 14:33:50] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 31 ms returned sat
[2026-06-16 14:33:51] [INFO ] [Nat]Absence check using state equation in 940 ms returned sat
[2026-06-16 14:33:51] [INFO ] [Nat]Added 225 Read/Feed constraints in 473 ms returned sat
[2026-06-16 14:33:52] [INFO ] Computed and/alt/rep : 915/930/915 causal constraints (skipped 225 transitions) in 136 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2026-06-16 14:33:55] [INFO ] [Real]Absence check using 46 positive place invariants in 76 ms returned sat
[2026-06-16 14:33:55] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 34 ms returned sat
[2026-06-16 14:33:56] [INFO ] [Real]Absence check using state equation in 1093 ms returned sat
[2026-06-16 14:33:57] [INFO ] [Real]Added 225 Read/Feed constraints in 292 ms returned sat
[2026-06-16 14:33:57] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:33:57] [INFO ] [Nat]Absence check using 46 positive place invariants in 69 ms returned sat
[2026-06-16 14:33:57] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 30 ms returned sat
[2026-06-16 14:33:58] [INFO ] [Nat]Absence check using state equation in 902 ms returned sat
[2026-06-16 14:33:59] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 14:33:59] [INFO ] [Nat]Added 225 Read/Feed constraints in 972 ms returned unsat
[2026-06-16 14:33:59] [INFO ] [Real]Absence check using 46 positive place invariants in 67 ms returned sat
[2026-06-16 14:33:59] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 34 ms returned sat
[2026-06-16 14:34:00] [INFO ] [Real]Absence check using state equation in 1144 ms returned sat
[2026-06-16 14:34:01] [INFO ] [Real]Added 225 Read/Feed constraints in 198 ms returned sat
[2026-06-16 14:34:01] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:34:01] [INFO ] [Nat]Absence check using 46 positive place invariants in 71 ms returned sat
[2026-06-16 14:34:01] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 32 ms returned sat
[2026-06-16 14:34:02] [INFO ] [Nat]Absence check using state equation in 1056 ms returned sat
[2026-06-16 14:34:03] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 14:34:03] [INFO ] [Nat]Added 225 Read/Feed constraints in 1027 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1]
FORMULA FileSystem-PT-N02I15B15-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I15B15-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided 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]
Support contains 12 out of 1201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1201/1201 places, 1155/1155 transitions.
Graph (complete) has 2760 edges and 1201 vertex of which 980 are kept as prefixes of interest. Removing 221 places using SCC suffix rule.9 ms
Discarding 221 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 980 transition count 1140
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 965 transition count 1140
Discarding 206 places :
Symmetric choice reduction at 2 with 206 rule applications. Total rules 237 place count 759 transition count 934
Iterating global reduction 2 with 206 rules applied. Total rules applied 443 place count 759 transition count 934
Performed 234 Post agglomeration using F-continuation condition.Transition count delta: 234
Deduced a syphon composed of 234 places in 4 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 911 place count 525 transition count 700
Free-agglomeration rule (complex) applied 220 times.
Iterating global reduction 2 with 220 rules applied. Total rules applied 1131 place count 525 transition count 480
Reduce places removed 227 places and 0 transitions.
Iterating post reduction 2 with 227 rules applied. Total rules applied 1358 place count 298 transition count 480
Applied a total of 1358 rules in 555 ms. Remains 298 /1201 variables (removed 903) and now considering 480/1155 (removed 675) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 569 ms. Remains : 298/1201 places, 480/1155 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5503619790629536000.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17085596472902013572.kers'
[2026-06-16 14:34:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5503619790629536000.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17085596472902013572.kers]
Culling duplicate invariants (modulo rational): removing 18 columns.
Culled 18 columns in 1 ms.
// Phase 1: matrix 480 rows 280 cols 1232 entries
Finished phase 1 with 271 SingleSign rule and 2 generalized
[2026-06-16 14:34:04] [INFO ] Computed 25 invariants in 6 ms
Computed 25 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17085596472902013572.kers
Total runtime 8 ms.
Current structural bounds on expressions (after invariants) : 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]
RANDOM walk for 1000000 steps (32258 resets) in 2951 ms. (338 steps per ms)
BEST_FIRST walk for 12000010 steps (60143 resets) in 10625 ms. (1129 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 14:34:18] [INFO ] Invariant cache hit.
[2026-06-16 14:34:18] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned sat
[2026-06-16 14:34:18] [INFO ] [Real]Absence check using 23 positive and 2 generalized place invariants in 2 ms returned sat
[2026-06-16 14:34:18] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2026-06-16 14:34:18] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-16 14:34:18] [INFO ] [Real]Added 225 Read/Feed constraints in 100 ms returned sat
[2026-06-16 14:34:18] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:34:18] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2026-06-16 14:34:18] [INFO ] [Nat]Absence check using 23 positive and 2 generalized place invariants in 3 ms returned sat
[2026-06-16 14:34:18] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2026-06-16 14:34:19] [INFO ] [Nat]Added 225 Read/Feed constraints in 523 ms returned unsat
[2026-06-16 14:34:19] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2026-06-16 14:34:19] [INFO ] [Real]Absence check using 23 positive and 2 generalized place invariants in 4 ms returned sat
[2026-06-16 14:34:19] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2026-06-16 14:34:19] [INFO ] [Real]Added 225 Read/Feed constraints in 142 ms returned sat
[2026-06-16 14:34:19] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:34:20] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2026-06-16 14:34:20] [INFO ] [Nat]Absence check using 23 positive and 2 generalized place invariants in 3 ms returned sat
[2026-06-16 14:34:20] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2026-06-16 14:34:20] [INFO ] [Nat]Added 225 Read/Feed constraints in 156 ms returned sat
[2026-06-16 14:34:20] [INFO ] Computed and/alt/rep : 240/255/240 causal constraints (skipped 225 transitions) in 65 ms.
[2026-06-16 14:34:20] [INFO ] Added : 17 causal constraints over 4 iterations in 283 ms. Result :sat
Minimization took 532 ms.
[2026-06-16 14:34:21] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2026-06-16 14:34:21] [INFO ] [Real]Absence check using 23 positive and 2 generalized place invariants in 4 ms returned sat
[2026-06-16 14:34:21] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2026-06-16 14:34:21] [INFO ] [Real]Added 225 Read/Feed constraints in 82 ms returned sat
[2026-06-16 14:34:21] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:34:22] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2026-06-16 14:34:22] [INFO ] [Nat]Absence check using 23 positive and 2 generalized place invariants in 5 ms returned sat
[2026-06-16 14:34:22] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2026-06-16 14:34:22] [INFO ] [Nat]Added 225 Read/Feed constraints in 617 ms returned unsat
[2026-06-16 14:34:23] [INFO ] [Real]Absence check using 23 positive place invariants in 10 ms returned sat
[2026-06-16 14:34:23] [INFO ] [Real]Absence check using 23 positive and 2 generalized place invariants in 3 ms returned sat
[2026-06-16 14:34:23] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2026-06-16 14:34:23] [INFO ] [Real]Added 225 Read/Feed constraints in 110 ms returned sat
[2026-06-16 14:34:23] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:34:23] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2026-06-16 14:34:23] [INFO ] [Nat]Absence check using 23 positive and 2 generalized place invariants in 3 ms returned sat
[2026-06-16 14:34:23] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2026-06-16 14:34:23] [INFO ] [Nat]Added 225 Read/Feed constraints in 146 ms returned unsat
[2026-06-16 14:34:24] [INFO ] [Real]Absence check using 23 positive place invariants in 10 ms returned sat
[2026-06-16 14:34:24] [INFO ] [Real]Absence check using 23 positive and 2 generalized place invariants in 5 ms returned sat
[2026-06-16 14:34:24] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2026-06-16 14:34:24] [INFO ] [Real]Added 225 Read/Feed constraints in 83 ms returned sat
[2026-06-16 14:34:24] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:34:24] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2026-06-16 14:34:24] [INFO ] [Nat]Absence check using 23 positive and 2 generalized place invariants in 3 ms returned sat
[2026-06-16 14:34:24] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2026-06-16 14:34:25] [INFO ] [Nat]Added 225 Read/Feed constraints in 566 ms returned unsat
[2026-06-16 14:34:25] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned sat
[2026-06-16 14:34:25] [INFO ] [Real]Absence check using 23 positive and 2 generalized place invariants in 2 ms returned sat
[2026-06-16 14:34:25] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2026-06-16 14:34:25] [INFO ] [Real]Added 225 Read/Feed constraints in 58 ms returned sat
[2026-06-16 14:34:25] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:34:25] [INFO ] [Nat]Absence check using 23 positive place invariants in 9 ms returned sat
[2026-06-16 14:34:25] [INFO ] [Nat]Absence check using 23 positive and 2 generalized place invariants in 3 ms returned sat
[2026-06-16 14:34:26] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2026-06-16 14:34:27] [INFO ] [Nat]Added 225 Read/Feed constraints in 998 ms returned unsat
[2026-06-16 14:34:27] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2026-06-16 14:34:27] [INFO ] [Real]Absence check using 23 positive and 2 generalized place invariants in 3 ms returned sat
[2026-06-16 14:34:27] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2026-06-16 14:34:27] [INFO ] [Real]Added 225 Read/Feed constraints in 46 ms returned sat
[2026-06-16 14:34:27] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:34:27] [INFO ] [Nat]Absence check using 23 positive place invariants in 9 ms returned sat
[2026-06-16 14:34:27] [INFO ] [Nat]Absence check using 23 positive and 2 generalized place invariants in 2 ms returned sat
[2026-06-16 14:34:27] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2026-06-16 14:34:27] [INFO ] [Nat]Added 225 Read/Feed constraints in 72 ms returned sat
[2026-06-16 14:34:27] [INFO ] Computed and/alt/rep : 240/255/240 causal constraints (skipped 225 transitions) in 42 ms.
[2026-06-16 14:34:27] [INFO ] Added : 16 causal constraints over 4 iterations in 231 ms. Result :sat
Minimization took 499 ms.
[2026-06-16 14:34:28] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2026-06-16 14:34:28] [INFO ] [Real]Absence check using 23 positive and 2 generalized place invariants in 2 ms returned sat
[2026-06-16 14:34:28] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2026-06-16 14:34:28] [INFO ] [Real]Added 225 Read/Feed constraints in 42 ms returned sat
[2026-06-16 14:34:28] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:34:28] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2026-06-16 14:34:28] [INFO ] [Nat]Absence check using 23 positive and 2 generalized place invariants in 4 ms returned sat
[2026-06-16 14:34:29] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2026-06-16 14:34:29] [INFO ] [Nat]Added 225 Read/Feed constraints in 478 ms returned unsat
[2026-06-16 14:34:29] [INFO ] [Real]Absence check using 23 positive place invariants in 10 ms returned sat
[2026-06-16 14:34:29] [INFO ] [Real]Absence check using 23 positive and 2 generalized place invariants in 3 ms returned sat
[2026-06-16 14:34:30] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2026-06-16 14:34:30] [INFO ] [Real]Added 225 Read/Feed constraints in 96 ms returned sat
[2026-06-16 14:34:30] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:34:30] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2026-06-16 14:34:30] [INFO ] [Nat]Absence check using 23 positive and 2 generalized place invariants in 5 ms returned sat
[2026-06-16 14:34:30] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2026-06-16 14:34:30] [INFO ] [Nat]Added 225 Read/Feed constraints in 207 ms returned unsat
[2026-06-16 14:34:30] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned sat
[2026-06-16 14:34:30] [INFO ] [Real]Absence check using 23 positive and 2 generalized place invariants in 2 ms returned sat
[2026-06-16 14:34:31] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2026-06-16 14:34:31] [INFO ] [Real]Added 225 Read/Feed constraints in 41 ms returned sat
[2026-06-16 14:34:31] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:34:31] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2026-06-16 14:34:31] [INFO ] [Nat]Absence check using 23 positive and 2 generalized place invariants in 3 ms returned sat
[2026-06-16 14:34:31] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2026-06-16 14:34:31] [INFO ] [Nat]Added 225 Read/Feed constraints in 104 ms returned sat
[2026-06-16 14:34:31] [INFO ] Computed and/alt/rep : 240/255/240 causal constraints (skipped 225 transitions) in 57 ms.
[2026-06-16 14:34:31] [INFO ] Added : 17 causal constraints over 4 iterations in 296 ms. Result :sat
Minimization took 468 ms.
[2026-06-16 14:34:32] [INFO ] [Real]Absence check using 23 positive place invariants in 10 ms returned sat
[2026-06-16 14:34:32] [INFO ] [Real]Absence check using 23 positive and 2 generalized place invariants in 2 ms returned sat
[2026-06-16 14:34:32] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2026-06-16 14:34:32] [INFO ] [Real]Added 225 Read/Feed constraints in 47 ms returned sat
[2026-06-16 14:34:32] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:34:32] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2026-06-16 14:34:32] [INFO ] [Nat]Absence check using 23 positive and 2 generalized place invariants in 2 ms returned sat
[2026-06-16 14:34:33] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2026-06-16 14:34:33] [INFO ] [Nat]Added 225 Read/Feed constraints in 117 ms returned sat
[2026-06-16 14:34:33] [INFO ] Computed and/alt/rep : 240/255/240 causal constraints (skipped 225 transitions) in 65 ms.
[2026-06-16 14:34:33] [INFO ] Added : 17 causal constraints over 4 iterations in 346 ms. Result :sat
Minimization took 733 ms.
[2026-06-16 14:34:34] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2026-06-16 14:34:34] [INFO ] [Real]Absence check using 23 positive and 2 generalized place invariants in 2 ms returned sat
[2026-06-16 14:34:34] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2026-06-16 14:34:34] [INFO ] [Real]Added 225 Read/Feed constraints in 46 ms returned sat
[2026-06-16 14:34:34] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:34:34] [INFO ] [Nat]Absence check using 23 positive place invariants in 10 ms returned sat
[2026-06-16 14:34:34] [INFO ] [Nat]Absence check using 23 positive and 2 generalized place invariants in 2 ms returned sat
[2026-06-16 14:34:35] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2026-06-16 14:34:35] [INFO ] [Nat]Added 225 Read/Feed constraints in 409 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0]
FORMULA FileSystem-PT-N02I15B15-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I15B15-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I15B15-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I15B15-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I15B15-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I15B15-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I15B15-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I15B15-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 480/480 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 291 transition count 474
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 18 place count 291 transition count 469
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 283 transition count 469
Applied a total of 26 rules in 103 ms. Remains 283 /298 variables (removed 15) and now considering 469/480 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 283/298 places, 469/480 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9426009592264212606.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1975512595879250159.kers'
[2026-06-16 14:34:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9426009592264212606.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1975512595879250159.kers]
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 469 rows 264 cols 1182 entries
Finished phase 1 with 262 SingleSign rule and 0 generalized
[2026-06-16 14:34:36] [INFO ] Computed 21 invariants in 5 ms
Computed 21 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1975512595879250159.kers
Total runtime 6 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (32258 resets) in 2350 ms. (425 steps per ms)
BEST_FIRST walk for 4000004 steps (20050 resets) in 4055 ms. (986 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-06-16 14:34:42] [INFO ] Invariant cache hit.
[2026-06-16 14:34:42] [INFO ] [Real]Absence check using 21 positive place invariants in 20 ms returned sat
[2026-06-16 14:34:42] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2026-06-16 14:34:42] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-16 14:34:42] [INFO ] [Real]Added 225 Read/Feed constraints in 83 ms returned sat
[2026-06-16 14:34:43] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:34:43] [INFO ] [Nat]Absence check using 21 positive place invariants in 19 ms returned sat
[2026-06-16 14:34:43] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2026-06-16 14:34:43] [INFO ] [Nat]Added 225 Read/Feed constraints in 132 ms returned sat
[2026-06-16 14:34:43] [INFO ] Computed and/alt/rep : 229/244/229 causal constraints (skipped 225 transitions) in 62 ms.
[2026-06-16 14:34:43] [INFO ] Added : 16 causal constraints over 4 iterations in 334 ms. Result :sat
Minimization took 836 ms.
[2026-06-16 14:34:44] [INFO ] [Real]Absence check using 21 positive place invariants in 19 ms returned sat
[2026-06-16 14:34:45] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2026-06-16 14:34:45] [INFO ] [Real]Added 225 Read/Feed constraints in 69 ms returned sat
[2026-06-16 14:34:45] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:34:45] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2026-06-16 14:34:45] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2026-06-16 14:34:45] [INFO ] [Nat]Added 225 Read/Feed constraints in 89 ms returned sat
[2026-06-16 14:34:45] [INFO ] Computed and/alt/rep : 229/244/229 causal constraints (skipped 225 transitions) in 58 ms.
[2026-06-16 14:34:46] [INFO ] Added : 16 causal constraints over 4 iterations in 337 ms. Result :sat
Minimization took 758 ms.
[2026-06-16 14:34:46] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2026-06-16 14:34:47] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2026-06-16 14:34:47] [INFO ] [Real]Added 225 Read/Feed constraints in 55 ms returned sat
[2026-06-16 14:34:47] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:34:47] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2026-06-16 14:34:47] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2026-06-16 14:34:47] [INFO ] [Nat]Added 225 Read/Feed constraints in 151 ms returned sat
[2026-06-16 14:34:47] [INFO ] Computed and/alt/rep : 229/244/229 causal constraints (skipped 225 transitions) in 58 ms.
[2026-06-16 14:34:48] [INFO ] Added : 16 causal constraints over 4 iterations in 358 ms. Result :sat
Minimization took 879 ms.
[2026-06-16 14:34:49] [INFO ] [Real]Absence check using 21 positive place invariants in 20 ms returned sat
[2026-06-16 14:34:49] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2026-06-16 14:34:49] [INFO ] [Real]Added 225 Read/Feed constraints in 66 ms returned sat
[2026-06-16 14:34:49] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:34:49] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2026-06-16 14:34:49] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2026-06-16 14:34:49] [INFO ] [Nat]Added 225 Read/Feed constraints in 161 ms returned sat
[2026-06-16 14:34:50] [INFO ] Computed and/alt/rep : 229/244/229 causal constraints (skipped 225 transitions) in 65 ms.
[2026-06-16 14:34:50] [INFO ] Added : 16 causal constraints over 4 iterations in 377 ms. Result :sat
Minimization took 678 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 469/469 transitions.
Applied a total of 0 rules in 16 ms. Remains 283 /283 variables (removed 0) and now considering 469/469 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 283/283 places, 469/469 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 469/469 transitions.
Applied a total of 0 rules in 15 ms. Remains 283 /283 variables (removed 0) and now considering 469/469 (removed 0) transitions.
[2026-06-16 14:34:51] [INFO ] Invariant cache hit.
[2026-06-16 14:34:52] [INFO ] Implicit Places using invariants in 612 ms returned []
[2026-06-16 14:34:52] [INFO ] Invariant cache hit.
[2026-06-16 14:34:52] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-16 14:34:54] [INFO ] Implicit Places using invariants and state equation in 2709 ms returned []
Implicit Place search using SMT with State Equation took 3324 ms to find 0 implicit places.
[2026-06-16 14:34:54] [INFO ] Redundant transitions in 46 ms returned []
Running 454 sub problems to find dead transitions.
[2026-06-16 14:34:54] [INFO ] Invariant cache hit.
[2026-06-16 14:34:54] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/263 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (OVERLAPS) 16/279 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 454 unsolved
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 TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 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 TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 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 TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 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 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 TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 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 TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 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 TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 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 TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 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 TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 7/48 constraints. Problems are: Problem set: 435 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 9/57 constraints. Problems are: Problem set: 435 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 1/58 constraints. Problems are: Problem set: 435 solved, 19 unsolved
SMT process timed out in 30475ms, After SMT, problems are : Problem set: 435 solved, 19 unsolved
Search for dead transitions found 435 dead transitions in 30504ms
Found 435 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 435 transitions
Dead transitions reduction (with SMT) removed 435 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 283/283 places, 34/469 transitions.
Graph (complete) has 110 edges and 283 vertex of which 8 are kept as prefixes of interest. Removing 275 places using SCC suffix rule.1 ms
Discarding 275 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Reduce places removed 4 places and 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 4 transition count 0
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 5 rules in 4 ms. Remains 4 /283 variables (removed 279) and now considering 0/34 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16100418301079064467.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4722393399172914453.kers'
[2026-06-16 14:35:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16100418301079064467.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4722393399172914453.kers]
[2026-06-16 14:35:25] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4722393399172914453.kers
Total runtime 0 ms.
[2026-06-16 14:35:25] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-06-16 14:35:25] [INFO ] Invariant cache hit.
[2026-06-16 14:35:25] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 4/283 places, 0/469 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 34010 ms. Remains : 4/283 places, 0/469 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
FORMULA FileSystem-PT-N02I15B15-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (after structural reductions) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 150582 ms.

BK_STOP 1781620525530

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-N02I15B15"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is FileSystem-PT-N02I15B15, 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 r338-smll-178021499300429"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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