Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r139-smll-174876533200077.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is Murphy-PT-D4N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-174876533200077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 19K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-00
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-01
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-02
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-03
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-04
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-05
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-06
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-07
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-08
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-09
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-10
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-11
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-12
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-13
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-14
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748939954275

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D4N050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-03 08:39:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 08:39:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 08:39:17] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2025-06-03 08:39:17] [INFO ] Transformed 30 places.
[2025-06-03 08:39:17] [INFO ] Transformed 35 transitions.
[2025-06-03 08:39:17] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 443 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 1, 1, 0, 0, 3, 50, 0, 1, 3, 3, 1, 0, 3, 50] 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:[1, 0, 1, 1, 0, 0, 3, 50, 0, 1, 3, 3, 1, 0, 3, 50] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 35 rows 30 cols
[2025-06-03 08:39:17] [INFO ] Computed 6 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 1, 1, 0, 0, 3, 50, 0, 1, 3, 3, 1, 0, 3, 50] Max Struct:[255, +inf, 255, 255, +inf, +inf, +inf, 255, +inf, 255, +inf, +inf, 255, +inf, +inf, 255]
RANDOM walk for 10038 steps (2 resets) in 60 ms. (164 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 294 ms. (542 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[93, 1, 93, 87, 2, 2, 3, 93, 1, 87, 3, 3, 85, 2, 3, 99] Max Struct:[255, +inf, 255, 255, +inf, +inf, +inf, 255, +inf, 255, +inf, +inf, 255, +inf, +inf, 255]
[2025-06-03 08:39:17] [INFO ] Invariant cache hit.
[2025-06-03 08:39:18] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-06-03 08:39:18] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-03 08:39:18] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-06-03 08:39:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-03 08:39:18] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-03 08:39:18] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2025-06-03 08:39:18] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:39:18] [INFO ] [Nat]Added 10 Read/Feed constraints in 6 ms returned sat
[2025-06-03 08:39:18] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-03 08:39:18] [INFO ] Added : 0 causal constraints over 0 iterations in 44 ms. Result :sat
Minimization took 198 ms.
[2025-06-03 08:39:18] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-03 08:39:18] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:18] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2025-06-03 08:39:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:18] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:18] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2025-06-03 08:39:18] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-03 08:39:18] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-03 08:39:18] [INFO ] Added : 1 causal constraints over 1 iterations in 29 ms. Result :sat
Minimization took 14 ms.
[2025-06-03 08:39:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:18] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:18] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-03 08:39:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-03 08:39:19] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:19] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-06-03 08:39:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-03 08:39:19] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-03 08:39:19] [INFO ] Added : 0 causal constraints over 0 iterations in 24 ms. Result :sat
Minimization took 188 ms.
[2025-06-03 08:39:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:19] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:19] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-06-03 08:39:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:19] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:19] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2025-06-03 08:39:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 7 ms returned sat
[2025-06-03 08:39:19] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-03 08:39:19] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Minimization took 134 ms.
[2025-06-03 08:39:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:19] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:19] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-03 08:39:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:19] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:19] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-03 08:39:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:39:19] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-03 08:39:19] [INFO ] Added : 2 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 12 ms.
[2025-06-03 08:39:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:19] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:19] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-03 08:39:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:19] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:19] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-03 08:39:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-03 08:39:20] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 19 ms.
[2025-06-03 08:39:20] [INFO ] Added : 2 causal constraints over 1 iterations in 37 ms. Result :sat
Minimization took 14 ms.
[2025-06-03 08:39:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:20] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:20] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-03 08:39:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:20] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:20] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-03 08:39:20] [INFO ] [Nat]Added 10 Read/Feed constraints in 7 ms returned sat
[2025-06-03 08:39:20] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:39:20] [INFO ] Added : 3 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 15 ms.
[2025-06-03 08:39:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:20] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:20] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-03 08:39:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-03 08:39:20] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:20] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-03 08:39:20] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-03 08:39:20] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:39:20] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Minimization took 214 ms.
[2025-06-03 08:39:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:20] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:20] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-03 08:39:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:20] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:20] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-03 08:39:20] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-03 08:39:20] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-03 08:39:20] [INFO ] Added : 1 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 14 ms.
[2025-06-03 08:39:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:20] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:20] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-03 08:39:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:20] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:20] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-03 08:39:20] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:39:20] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-03 08:39:20] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 120 ms.
[2025-06-03 08:39:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-03 08:39:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-03 08:39:21] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:39:21] [INFO ] Added : 3 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 12 ms.
[2025-06-03 08:39:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-03 08:39:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-03 08:39:21] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-03 08:39:21] [INFO ] Added : 3 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 15 ms.
[2025-06-03 08:39:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-03 08:39:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-03 08:39:21] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:39:21] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Minimization took 177 ms.
[2025-06-03 08:39:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-03 08:39:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:39:21] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:39:21] [INFO ] Added : 2 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 12 ms.
[2025-06-03 08:39:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-03 08:39:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:21] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:22] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-03 08:39:22] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:39:22] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:39:22] [INFO ] Added : 3 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 12 ms.
[2025-06-03 08:39:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:22] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:22] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-03 08:39:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-03 08:39:22] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:22] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-03 08:39:22] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:39:22] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:39:22] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 132 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[93, 1, 93, 87, 2, 2, 3, 93, 1, 87, 3, 3, 85, 2, 3, 99] Max Struct:[255, +inf, 255, 255, +inf, +inf, +inf, 255, +inf, 255, +inf, +inf, 255, +inf, +inf, 255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249, 1, 249, 251, 2, 2, 3, 150, 1, 251, 3, 3, 251, 2, 3, 152] Max Struct:[255, +inf, 255, 255, +inf, +inf, +inf, 255, +inf, 255, +inf, +inf, 255, +inf, +inf, 255]
Support contains 16 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 16 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2025-06-03 08:39:23] [INFO ] Invariant cache hit.
[2025-06-03 08:39:23] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 35/60 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 5/65 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 46 constraints, problems are : Problem set: 0 solved, 20 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 35/60 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 5/65 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 66 constraints, problems are : Problem set: 0 solved, 20 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 971ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 982ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1015 ms. Remains : 30/30 places, 35/35 transitions.
Found an invariant !
This invariant on transitions {19=1, 24=1, 34=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {17=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 16) seen :[74, 1, 74, 67, 2, 2, 3, 54, 1, 67, 3, 3, 86, 2, 3, 58]
Current structural bounds on expressions (after cover walk) : Max Seen:[249, 1, 249, 251, 2, 2, 3, 150, 1, 251, 3, 3, 251, 2, 3, 152] Max Struct:[255, +inf, 255, 255, +inf, +inf, +inf, 255, +inf, 255, +inf, +inf, 255, +inf, +inf, 255]
[2025-06-03 08:39:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[249, 1, 249, 251, 2, 2, 3, 150, 1, 251, 3, 3, 251, 2, 3, 152] Max Struct:[255, +inf, 255, 255, +inf, +inf, +inf, 255, +inf, 255, +inf, +inf, 255, +inf, +inf, 255]
RANDOM walk for 1000002 steps (2 resets) in 677 ms. (1474 steps per ms)
BEST_FIRST walk for 16000015 steps (32 resets) in 8891 ms. (1799 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[251, 1, 251, 251, 2, 2, 3, 150, 1, 251, 3, 3, 251, 2, 3, 159] Max Struct:[255, +inf, 255, 255, +inf, +inf, +inf, 255, +inf, 255, +inf, +inf, 255, +inf, +inf, 255]
[2025-06-03 08:39:33] [INFO ] Invariant cache hit.
[2025-06-03 08:39:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:33] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:39:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:33] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using state equation in 21 ms returned unsat
[2025-06-03 08:39:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:39:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-03 08:39:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:39:34] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:39:34] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:39:34] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 08:39:34] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:39:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using state equation in 16 ms returned unsat
[2025-06-03 08:39:34] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-03 08:39:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using state equation in 85 ms returned unsat
[2025-06-03 08:39:34] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-03 08:39:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:39:34] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:39:34] [INFO ] Added : 2 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 12 ms.
[2025-06-03 08:39:34] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-03 08:39:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Nat]Added 10 Read/Feed constraints in 6 ms returned sat
[2025-06-03 08:39:34] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:39:34] [INFO ] Added : 2 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 14 ms.
[2025-06-03 08:39:34] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-03 08:39:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-03 08:39:34] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:39:34] [INFO ] Added : 3 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 16 ms.
[2025-06-03 08:39:34] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-03 08:39:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:34] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-03 08:39:35] [INFO ] [Nat]Added 10 Read/Feed constraints in 15 ms returned sat
[2025-06-03 08:39:35] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:39:35] [INFO ] Added : 9 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 423 ms.
[2025-06-03 08:39:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:35] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:35] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-03 08:39:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:35] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:35] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-03 08:39:35] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:39:35] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:39:35] [INFO ] Added : 1 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 14 ms.
[2025-06-03 08:39:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:35] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:35] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-03 08:39:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:35] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:36] [INFO ] [Nat]Absence check using state equation in 698 ms returned unsat
[2025-06-03 08:39:36] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:36] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:36] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-03 08:39:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:36] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:36] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-03 08:39:36] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:39:36] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:39:36] [INFO ] Added : 3 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 12 ms.
[2025-06-03 08:39:36] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:36] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:36] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:39:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:36] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:36] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-03 08:39:36] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:39:36] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:39:36] [INFO ] Added : 3 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 15 ms.
[2025-06-03 08:39:36] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:36] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:36] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-03 08:39:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:36] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:36] [INFO ] [Nat]Absence check using state equation in 19 ms returned unsat
[2025-06-03 08:39:36] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:36] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-03 08:39:36] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-03 08:39:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:36] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:36] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-03 08:39:36] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-03 08:39:36] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:39:36] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 12 ms.
[2025-06-03 08:39:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:37] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:37] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:39:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:37] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-03 08:39:37] [INFO ] [Nat]Added 10 Read/Feed constraints in 6 ms returned sat
[2025-06-03 08:39:37] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:39:37] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 12 ms.
[2025-06-03 08:39:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:37] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:37] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-03 08:39:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:37] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-03 08:39:37] [INFO ] [Nat]Added 10 Read/Feed constraints in 6 ms returned sat
[2025-06-03 08:39:37] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:39:37] [INFO ] Added : 2 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 173 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[251, 1, 251, 251, 2, 2, 3, 150, 1, 251, 3, 3, 251, 2, 3, 159] Max Struct:[251, +inf, 251, 251, +inf, +inf, +inf, 255, +inf, 251, +inf, +inf, 251, +inf, +inf, 255]
FORMULA Murphy-PT-D4N050-UpperBounds-12 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D4N050-UpperBounds-09 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D4N050-UpperBounds-03 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D4N050-UpperBounds-02 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D4N050-UpperBounds-00 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 2, 2, 3, 249, 1, 3, 3, 2, 3, 247] Max Struct:[+inf, +inf, +inf, +inf, 255, +inf, +inf, +inf, +inf, +inf, 255]
Support contains 11 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 30/30 places, 35/35 transitions.
Found an invariant !
This invariant on transitions {19=1, 24=1, 34=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {17=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :[1, 2, 2, 3, 56, 1, 3, 3, 2, 3, 62]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 2, 2, 3, 249, 1, 3, 3, 2, 3, 247] Max Struct:[+inf, +inf, +inf, +inf, 255, +inf, +inf, +inf, +inf, +inf, 255]
[2025-06-03 08:39:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 2, 2, 3, 249, 1, 3, 3, 2, 3, 247] Max Struct:[+inf, +inf, +inf, +inf, 255, +inf, +inf, +inf, +inf, +inf, 255]
RANDOM walk for 1000003 steps (2 resets) in 1009 ms. (990 steps per ms)
BEST_FIRST walk for 11000011 steps (22 resets) in 6591 ms. (1668 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2, 2, 3, 249, 1, 3, 3, 2, 3, 247] Max Struct:[+inf, +inf, +inf, +inf, 255, +inf, +inf, +inf, +inf, +inf, 255]
[2025-06-03 08:39:45] [INFO ] Invariant cache hit.
[2025-06-03 08:39:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:45] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:39:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:45] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:45] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:39:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:39:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:39:45] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:39:45] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 08:39:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:45] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:39:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:45] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:45] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:39:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:39:45] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:39:45] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:39:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:45] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-03 08:39:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:45] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:45] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-03 08:39:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:39:45] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:39:45] [INFO ] Added : 2 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 14 ms.
[2025-06-03 08:39:45] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-03 08:39:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:45] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-03 08:39:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:45] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:45] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-03 08:39:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:39:45] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:39:45] [INFO ] Added : 3 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 15 ms.
[2025-06-03 08:39:45] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:45] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-03 08:39:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-03 08:39:46] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:39:46] [INFO ] Added : 3 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 59 ms.
[2025-06-03 08:39:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-03 08:39:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:39:46] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:39:46] [INFO ] Added : 1 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 14 ms.
[2025-06-03 08:39:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-03 08:39:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Nat]Added 10 Read/Feed constraints in 6 ms returned sat
[2025-06-03 08:39:46] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:39:46] [INFO ] Added : 3 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 12 ms.
[2025-06-03 08:39:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-03 08:39:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:39:46] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:39:46] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 14 ms.
[2025-06-03 08:39:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:39:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:39:46] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:39:46] [INFO ] Added : 2 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 12 ms.
[2025-06-03 08:39:46] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:39:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:39:46] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:39:46] [INFO ] Added : 3 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 12 ms.
[2025-06-03 08:39:46] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-03 08:39:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:39:47] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-03 08:39:47] [INFO ] [Nat]Added 10 Read/Feed constraints in 13 ms returned sat
[2025-06-03 08:39:47] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:39:47] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 133 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2, 2, 3, 249, 1, 3, 3, 2, 3, 247] Max Struct:[+inf, +inf, +inf, +inf, 255, +inf, +inf, +inf, +inf, +inf, 255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 2, 2, 3, 249, 1, 3, 3, 2, 3, 247] Max Struct:[+inf, +inf, +inf, +inf, 255, +inf, +inf, +inf, +inf, +inf, 255]
Support contains 11 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 7 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2025-06-03 08:39:47] [INFO ] Invariant cache hit.
[2025-06-03 08:39:47] [INFO ] Implicit Places using invariants in 78 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 89 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 5 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 103 ms. Remains : 25/30 places, 35/35 transitions.
Found an invariant !
This invariant on transitions {19=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :[1, 2, 2, 3, 54, 1, 3, 3, 2, 3, 51]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 2, 2, 3, 249, 1, 3, 3, 2, 3, 247] Max Struct:[+inf, +inf, +inf, +inf, 255, +inf, +inf, +inf, +inf, +inf, 255]
// Phase 1: matrix 35 rows 25 cols
[2025-06-03 08:39:47] [INFO ] Computed 1 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 2, 2, 3, 249, 1, 3, 3, 2, 3, 247] Max Struct:[+inf, +inf, +inf, +inf, 255, +inf, +inf, +inf, +inf, +inf, 255]
RANDOM walk for 1000060 steps (2 resets) in 747 ms. (1336 steps per ms)
BEST_FIRST walk for 11000011 steps (22 resets) in 5459 ms. (2014 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2, 2, 3, 249, 1, 3, 3, 2, 3, 247] Max Struct:[+inf, +inf, +inf, +inf, 255, +inf, +inf, +inf, +inf, +inf, 255]
[2025-06-03 08:39:53] [INFO ] Invariant cache hit.
[2025-06-03 08:39:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:53] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:39:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:39:53] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:39:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:53] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:39:53] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:39:53] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:39:53] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 9 ms.
[2025-06-03 08:39:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:39:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:39:54] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:39:54] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:39:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:39:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:39:54] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:39:54] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 11 ms.
[2025-06-03 08:39:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:39:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:39:54] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-03 08:39:54] [INFO ] Added : 3 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 15 ms.
[2025-06-03 08:39:54] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:39:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Nat]Added 10 Read/Feed constraints in 8 ms returned sat
[2025-06-03 08:39:54] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 13 ms to minimize.
[2025-06-03 08:39:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2025-06-03 08:39:54] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:39:54] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 40 ms.
[2025-06-03 08:39:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Real]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-03 08:39:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-03 08:39:54] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:39:54] [INFO ] Added : 1 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 14 ms.
[2025-06-03 08:39:54] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:39:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:39:54] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:39:54] [INFO ] Added : 3 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 12 ms.
[2025-06-03 08:39:54] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:39:54] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:39:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:55] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-03 08:39:55] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:39:55] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:39:55] [INFO ] Added : 3 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 12 ms.
[2025-06-03 08:39:55] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:55] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-03 08:39:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:55] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:39:55] [INFO ] [Nat]Added 10 Read/Feed constraints in 8 ms returned sat
[2025-06-03 08:39:55] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:39:55] [INFO ] Added : 2 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 14 ms.
[2025-06-03 08:39:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:55] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-03 08:39:55] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:39:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:55] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:39:55] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:39:55] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:39:55] [INFO ] Added : 3 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 14 ms.
[2025-06-03 08:39:55] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:39:55] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-03 08:39:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:39:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:39:55] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-03 08:39:55] [INFO ] [Nat]Added 10 Read/Feed constraints in 9 ms returned sat
[2025-06-03 08:39:55] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:39:55] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2, 2, 3, 249, 1, 3, 3, 2, 3, 247] Max Struct:[+inf, +inf, +inf, +inf, 255, +inf, +inf, +inf, +inf, +inf, 255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 2, 2, 3, 249, 1, 3, 3, 2, 3, 247] Max Struct:[+inf, +inf, +inf, +inf, 255, +inf, +inf, +inf, +inf, +inf, 255]
Support contains 11 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2025-06-03 08:39:55] [INFO ] Invariant cache hit.
[2025-06-03 08:39:55] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-03 08:39:55] [INFO ] Invariant cache hit.
[2025-06-03 08:39:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:39:55] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2025-06-03 08:39:55] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2025-06-03 08:39:55] [INFO ] Invariant cache hit.
[2025-06-03 08:39:55] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 472 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 491 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 981ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 982ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1113 ms. Remains : 25/25 places, 35/35 transitions.
Found an invariant !
This invariant on transitions {19=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :[1, 2, 2, 3, 57, 1, 3, 3, 2, 3, 52]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 2, 2, 3, 249, 1, 3, 3, 2, 3, 247] Max Struct:[+inf, +inf, +inf, +inf, 255, +inf, +inf, +inf, +inf, +inf, 255]
RANDOM walk for 40063 steps (8 resets) in 811 ms. (49 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 366 ms. (109 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 359 ms. (111 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 13/13 properties
[2025-06-03 08:39:57] [INFO ] Flatten gal took : 111 ms
[2025-06-03 08:39:57] [INFO ] Flatten gal took : 24 ms
[2025-06-03 08:39:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4404619307069761155.gal : 22 ms
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 13/13 properties
[2025-06-03 08:39:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15461967311391576202.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4404619307069761155.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15461967311391576202.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality15461967311391576202.prop.
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :6 after 36
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :36 after 90
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :90 after 192
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :192 after 30630
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :30630 after 243534
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 61 ms. (645 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :243534 after 1.78854e+09
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :1.78854e+09 after 1.89814e+13
Interrupted probabilistic random walk after 168337 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 13
Probabilistic random walk after 168337 steps, saw 116336 distinct states, run finished after 3008 ms. (steps per millisecond=55 ) properties seen :0
[2025-06-03 08:40:01] [INFO ] Invariant cache hit.
[2025-06-03 08:40:01] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 8/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-06-03 08:40:01] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 2 ms to minimize.
Problem MAX4 is UNSAT
Problem MAX10 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 31/50 variables, 19/21 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 8/29 constraints. Problems are: Problem set: 2 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 3/53 variables, 3/32 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 2/55 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 1/34 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/55 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 5/60 variables, 3/37 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 0/60 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 37 constraints, problems are : Problem set: 2 solved, 11 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 8/19 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 31/50 variables, 19/21 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 8/29 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 5/34 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 3/53 variables, 3/37 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 6/43 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/43 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 2/55 variables, 1/44 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/55 variables, 1/45 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 5/60 variables, 3/48 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/60 variables, 0/48 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/60 variables, 0/48 constraints. Problems are: Problem set: 2 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 48 constraints, problems are : Problem set: 2 solved, 11 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 11/13 constraints, Known Traps: 1/1 constraints]
After SMT, in 668ms problems are : Problem set: 2 solved, 11 unsolved
Fused 11 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 5340 ms.
Support contains 11 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2025-06-03 08:40:07] [INFO ] Invariant cache hit.
[2025-06-03 08:40:07] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 599ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 600ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 602 ms. Remains : 25/25 places, 35/35 transitions.
RANDOM walk for 40072 steps (8 resets) in 55 ms. (715 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 38 ms. (1025 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 39 ms. (1000 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 36 ms. (1081 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 49 ms. (800 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 239023 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 11
Probabilistic random walk after 239023 steps, saw 163746 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2025-06-03 08:40:11] [INFO ] Invariant cache hit.
[2025-06-03 08:40:11] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 8/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2025-06-03 08:40:11] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 31/50 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 3/53 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 2/55 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/55 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 5/60 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 0/60 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 37 constraints, problems are : Problem set: 0 solved, 11 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 8/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 31/50 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 3/53 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 2/55 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/55 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 5/60 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/60 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/60 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 48 constraints, problems are : Problem set: 0 solved, 11 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 667ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 5615 ms.
Support contains 11 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 9 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2025-06-03 08:40:17] [INFO ] Invariant cache hit.
[2025-06-03 08:40:17] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-03 08:40:17] [INFO ] Invariant cache hit.
[2025-06-03 08:40:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:40:17] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2025-06-03 08:40:17] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2025-06-03 08:40:17] [INFO ] Invariant cache hit.
[2025-06-03 08:40:17] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 594ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 594ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 687 ms. Remains : 25/25 places, 35/35 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 60 edges and 25 vertex of which 22 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Applied a total of 1 rules in 7 ms. Remains 22 /25 variables (removed 3) and now considering 31/35 (removed 4) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 31 rows 22 cols
[2025-06-03 08:40:18] [INFO ] Computed 1 invariants in 1 ms
[2025-06-03 08:40:18] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-03 08:40:18] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2025-06-03 08:40:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-03 08:40:18] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2025-06-03 08:40:18] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-03 08:40:18] [INFO ] After 48ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2025-06-03 08:40:18] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2025-06-03 08:40:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2025-06-03 08:40:18] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2025-06-03 08:40:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
TRAPS : Iteration 1
[2025-06-03 08:40:18] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2025-06-03 08:40:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2025-06-03 08:40:18] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2025-06-03 08:40:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
TRAPS : Iteration 2
[2025-06-03 08:40:18] [INFO ] After 279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
[2025-06-03 08:40:18] [INFO ] After 425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2025-06-03 08:40:18] [INFO ] Flatten gal took : 18 ms
[2025-06-03 08:40:18] [INFO ] Flatten gal took : 17 ms
[2025-06-03 08:40:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15474933255883389357.gal : 2 ms
[2025-06-03 08:40:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10575344896098917239.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15474933255883389357.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10575344896098917239.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10575344896098917239.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :12 after 42
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :42 after 96
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :96 after 198
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :198 after 44760
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :44760 after 275526
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :275526 after 2.30837e+09
Detected timeout of ITS tools.
[2025-06-03 08:40:33] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:40:33] [INFO ] Applying decomposition
[2025-06-03 08:40:33] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14767575710341705732.txt' '-o' '/tmp/graph14767575710341705732.bin' '-w' '/tmp/graph14767575710341705732.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14767575710341705732.bin' '-l' '-1' '-v' '-w' '/tmp/graph14767575710341705732.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:40:33] [INFO ] Decomposing Gal with order
[2025-06-03 08:40:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:40:33] [INFO ] Flatten gal took : 56 ms
[2025-06-03 08:40:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 08:40:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13360058060938246820.gal : 7 ms
[2025-06-03 08:40:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality532502233071060566.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13360058060938246820.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality532502233071060566.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality532502233071060566.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :36 after 969
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :969 after 421209
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :421209 after 3.38504e+11
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :3.38504e+11 after 9.60859e+12
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :9.60859e+12 after 9.61314e+12
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :9.61314e+12 after 9.89088e+12
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :9.89088e+12 after 9.90104e+12
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :9.90104e+12 after 1.00507e+13
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :1.00507e+13 after 2.83169e+13
Detected timeout of ITS tools.
[2025-06-03 08:40:47] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:40:47] [INFO ] Applying decomposition
[2025-06-03 08:40:47] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16373435787037806147.txt' '-o' '/tmp/graph16373435787037806147.bin' '-w' '/tmp/graph16373435787037806147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16373435787037806147.bin' '-l' '-1' '-v' '-w' '/tmp/graph16373435787037806147.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:40:47] [INFO ] Decomposing Gal with order
[2025-06-03 08:40:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:40:47] [INFO ] Flatten gal took : 6 ms
[2025-06-03 08:40:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 08:40:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14454379637673554299.gal : 2 ms
[2025-06-03 08:40:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11354917840810429904.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14454379637673554299.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11354917840810429904.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality11354917840810429904.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :12 after 144
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :144 after 468
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :468 after 1080
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :1080 after 23868
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :23868 after 2.99527e+06
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :2.99527e+06 after 5.86504e+10
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30962 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 2, 2, 3, 249, 1, 3, 3, 2, 3, 247] Max Struct:[+inf, +inf, +inf, +inf, 255, +inf, +inf, +inf, +inf, +inf, 255]
Starting property specific reduction for Murphy-PT-D4N050-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 35 rows 25 cols
[2025-06-03 08:40:48] [INFO ] Computed 1 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10012 steps (2 resets) in 6 ms. (1430 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:40:49] [INFO ] Invariant cache hit.
[2025-06-03 08:40:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:40:49] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:40:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:40:49] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:40:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:40:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:40:49] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:40:49] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:40:49] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:40:49] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 7 ms. Remains 3 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:40:49] [INFO ] Computed 0 invariants in 0 ms
[2025-06-03 08:40:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 43 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 39 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 87ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 3/25 places, 4/35 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:40:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 273 ms. (3649 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 304 ms. (3278 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:40:49] [INFO ] Invariant cache hit.
[2025-06-03 08:40:49] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-03 08:40:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:40:49] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:40:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:40:49] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-03 08:40:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:40:49] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:40:49] [INFO ] Added : 3 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2025-06-03 08:40:49] [INFO ] Invariant cache hit.
[2025-06-03 08:40:49] [INFO ] Implicit Places using invariants in 14 ms returned []
[2025-06-03 08:40:49] [INFO ] Invariant cache hit.
[2025-06-03 08:40:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:40:49] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2025-06-03 08:40:49] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:40:49] [INFO ] Invariant cache hit.
[2025-06-03 08:40:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 42 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 84ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:40:50] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:40:50] [INFO ] Flatten gal took : 0 ms
[2025-06-03 08:40:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10127604377789202469.gal : 1 ms
[2025-06-03 08:40:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14285818856369468135.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10127604377789202469.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14285818856369468135.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14285818856369468135.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.002312,3808,2,8,5,44,7,0,24,26,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.002552,3808,1,0,5,44,7,0,25,26,0
RANDOM walk for 40000 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 7 ms. (steps per millisecond=2 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D4N050-UpperBounds-01 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D4N050-UpperBounds-01 in 1130 ms.
Starting property specific reduction for Murphy-PT-D4N050-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 35 rows 25 cols
[2025-06-03 08:40:50] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10021 steps (2 resets) in 6 ms. (1431 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:40:50] [INFO ] Invariant cache hit.
[2025-06-03 08:40:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:40:50] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:40:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:40:50] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:40:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:40:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:40:50] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:40:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:40:50] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:40:50] [INFO ] Added : 2 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:40:50] [INFO ] Computed 0 invariants in 0 ms
[2025-06-03 08:40:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 68 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 53 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 124ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 3/25 places, 4/35 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:40:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 470 ms. (2123 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 314 ms. (3174 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:40:51] [INFO ] Invariant cache hit.
[2025-06-03 08:40:51] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-03 08:40:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:40:51] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:40:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:40:51] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-03 08:40:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:40:51] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:40:51] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2025-06-03 08:40:51] [INFO ] Invariant cache hit.
[2025-06-03 08:40:51] [INFO ] Implicit Places using invariants in 14 ms returned []
[2025-06-03 08:40:51] [INFO ] Invariant cache hit.
[2025-06-03 08:40:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:40:51] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2025-06-03 08:40:51] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:40:51] [INFO ] Invariant cache hit.
[2025-06-03 08:40:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 43 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 39 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 86ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 86ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:40:51] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:40:51] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:40:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17894441956962308417.gal : 1 ms
[2025-06-03 08:40:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6671387496463510956.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17894441956962308417.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6671387496463510956.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6671387496463510956.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.002285,3808,2,8,5,44,7,0,24,26,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.002506,3808,1,0,5,44,7,0,25,26,0
RANDOM walk for 40000 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 5 ms. (steps per millisecond=2 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D4N050-UpperBounds-04 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D4N050-UpperBounds-04 in 1346 ms.
Starting property specific reduction for Murphy-PT-D4N050-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 35 rows 25 cols
[2025-06-03 08:40:51] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 6 ms. (1428 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:40:51] [INFO ] Invariant cache hit.
[2025-06-03 08:40:51] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:40:51] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:40:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:40:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:40:51] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:40:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:40:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:40:51] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:40:51] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:40:51] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 08:40:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 40 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 80ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 80ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 3/25 places, 4/35 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:40:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 456 ms. (2188 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 332 ms. (3003 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:40:52] [INFO ] Invariant cache hit.
[2025-06-03 08:40:52] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-03 08:40:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:40:52] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:40:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:40:52] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-03 08:40:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:40:52] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:40:52] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2025-06-03 08:40:52] [INFO ] Invariant cache hit.
[2025-06-03 08:40:52] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-03 08:40:52] [INFO ] Invariant cache hit.
[2025-06-03 08:40:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:40:52] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2025-06-03 08:40:52] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:40:52] [INFO ] Invariant cache hit.
[2025-06-03 08:40:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 51 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 60 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 113ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:40:52] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 40000 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
[2025-06-03 08:40:52] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:40:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10227543718780582796.gal : 1 ms
[2025-06-03 08:40:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4884964915336298600.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10227543718780582796.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4884964915336298600.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4884964915336298600.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.003075,3808,2,8,5,44,7,0,24,26,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.003414,3808,1,0,5,44,7,0,25,26,0
BEST_FIRST walk for 40002 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 5 ms. (steps per millisecond=2 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D4N050-UpperBounds-05 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D4N050-UpperBounds-05 in 1315 ms.
Starting property specific reduction for Murphy-PT-D4N050-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[3] Max Struct:[+inf]
// Phase 1: matrix 35 rows 25 cols
[2025-06-03 08:40:52] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:40:52] [INFO ] Invariant cache hit.
[2025-06-03 08:40:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:40:52] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:40:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:40:52] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:40:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:40:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:40:52] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-03 08:40:52] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:40:52] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:40:52] [INFO ] Added : 3 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 2 ms. Remains 3 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:40:52] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 08:40:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 63 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 63 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 131ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 3/25 places, 4/35 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:40:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 465 ms. (2145 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 237 ms. (4201 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:40:53] [INFO ] Invariant cache hit.
[2025-06-03 08:40:53] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-03 08:40:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:40:53] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:40:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:40:53] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-03 08:40:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:40:53] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:40:53] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2025-06-03 08:40:53] [INFO ] Invariant cache hit.
[2025-06-03 08:40:53] [INFO ] Implicit Places using invariants in 12 ms returned []
[2025-06-03 08:40:53] [INFO ] Invariant cache hit.
[2025-06-03 08:40:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:40:53] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2025-06-03 08:40:53] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:40:53] [INFO ] Invariant cache hit.
[2025-06-03 08:40:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 39 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 40 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 81ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:40:54] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:40:54] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:40:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14419234052521151153.gal : 1 ms
[2025-06-03 08:40:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14378760979665759222.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14419234052521151153.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14378760979665759222.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14378760979665759222.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.002218,3808,2,8,5,44,7,0,24,26,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.002427,3808,1,0,5,44,7,0,25,26,0
BEST_FIRST walk for 40001 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 4 ms. (steps per millisecond=3 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 2 ms. (steps per millisecond=7 ) properties seen :0
FORMULA Murphy-PT-D4N050-UpperBounds-06 3 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D4N050-UpperBounds-06 in 1281 ms.
Starting property specific reduction for Murphy-PT-D4N050-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[255]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[255]
// Phase 1: matrix 35 rows 25 cols
[2025-06-03 08:40:54] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[255]
RANDOM walk for 10042 steps (2 resets) in 5 ms. (1673 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[90] Max Struct:[255]
[2025-06-03 08:40:54] [INFO ] Invariant cache hit.
[2025-06-03 08:40:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:40:54] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:40:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:40:54] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:40:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:40:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:40:54] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:40:54] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:40:54] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:40:54] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 133 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[90] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[152] Max Struct:[255]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2025-06-03 08:40:54] [INFO ] Invariant cache hit.
[2025-06-03 08:40:54] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 678ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 679ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 682 ms. Remains : 25/25 places, 35/35 transitions.
[2025-06-03 08:40:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[152] Max Struct:[255]
RANDOM walk for 1000000 steps (2 resets) in 484 ms. (2061 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 448 ms. (2227 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[155] Max Struct:[255]
[2025-06-03 08:40:55] [INFO ] Invariant cache hit.
[2025-06-03 08:40:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:40:56] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:40:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:40:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:40:56] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:40:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:40:56] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:40:56] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:40:56] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[155] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[155] Max Struct:[255]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2025-06-03 08:40:56] [INFO ] Invariant cache hit.
[2025-06-03 08:40:56] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-03 08:40:56] [INFO ] Invariant cache hit.
[2025-06-03 08:40:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:40:56] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2025-06-03 08:40:56] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2025-06-03 08:40:56] [INFO ] Invariant cache hit.
[2025-06-03 08:40:56] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 1020ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 1021ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1150 ms. Remains : 25/25 places, 35/35 transitions.
[2025-06-03 08:40:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[155] Max Struct:[255]
RANDOM walk for 1000046 steps (2 resets) in 817 ms. (1222 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 448 ms. (2227 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[155] Max Struct:[255]
[2025-06-03 08:40:58] [INFO ] Invariant cache hit.
[2025-06-03 08:40:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:40:58] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:40:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:40:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:40:58] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:40:58] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:40:58] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-03 08:40:58] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:40:58] [INFO ] Added : 1 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[155] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[155] Max Struct:[255]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2025-06-03 08:40:58] [INFO ] Invariant cache hit.
[2025-06-03 08:40:59] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-03 08:40:59] [INFO ] Invariant cache hit.
[2025-06-03 08:40:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:40:59] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2025-06-03 08:40:59] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2025-06-03 08:40:59] [INFO ] Invariant cache hit.
[2025-06-03 08:40:59] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 494 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 947ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 948ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1067 ms. Remains : 25/25 places, 35/35 transitions.
RANDOM walk for 40069 steps (8 resets) in 41 ms. (954 steps per ms) remains 2/2 properties
[2025-06-03 08:41:00] [INFO ] Flatten gal took : 12 ms
BEST_FIRST walk for 40003 steps (8 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
[2025-06-03 08:41:00] [INFO ] Flatten gal took : 6 ms
[2025-06-03 08:41:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6522619501135179919.gal : 4 ms
[2025-06-03 08:41:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality791232226226100122.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6522619501135179919.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality791232226226100122.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality791232226226100122.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 36
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :36 after 90
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :90 after 192
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :192 after 30630
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30630 after 243534
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :243534 after 1.78854e+09
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.78854e+09 after 1.89814e+13
Interrupted probabilistic random walk after 577431 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 2
Probabilistic random walk after 577431 steps, saw 399168 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
[2025-06-03 08:41:03] [INFO ] Invariant cache hit.
[2025-06-03 08:41:03] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-03 08:41:03] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/60 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 37 constraints, problems are : Problem set: 1 solved, 1 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 1/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 38 constraints, problems are : Problem set: 1 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 138ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2025-06-03 08:41:03] [INFO ] Invariant cache hit.
[2025-06-03 08:41:03] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 619ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 619ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 621 ms. Remains : 25/25 places, 35/35 transitions.
RANDOM walk for 40097 steps (8 resets) in 25 ms. (1542 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2066460 steps, run timeout after 3001 ms. (steps per millisecond=688 ) properties seen :0 out of 1
Probabilistic random walk after 2066460 steps, saw 1439097 distinct states, run finished after 3001 ms. (steps per millisecond=688 ) properties seen :0
[2025-06-03 08:41:06] [INFO ] Invariant cache hit.
[2025-06-03 08:41:06] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-03 08:41:06] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/60 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 37 constraints, problems are : Problem set: 0 solved, 1 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 38 constraints, problems are : Problem set: 0 solved, 1 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 152ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2025-06-03 08:41:07] [INFO ] Invariant cache hit.
[2025-06-03 08:41:07] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-03 08:41:07] [INFO ] Invariant cache hit.
[2025-06-03 08:41:07] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:41:07] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2025-06-03 08:41:07] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2025-06-03 08:41:07] [INFO ] Invariant cache hit.
[2025-06-03 08:41:07] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 567ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 568ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 650 ms. Remains : 25/25 places, 35/35 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 60 edges and 25 vertex of which 10 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Applied a total of 1 rules in 1 ms. Remains 10 /25 variables (removed 15) and now considering 15/35 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2025-06-03 08:41:07] [INFO ] Computed 1 invariants in 2 ms
[2025-06-03 08:41:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:41:07] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-03 08:41:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-03 08:41:07] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-03 08:41:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-03 08:41:07] [INFO ] After 4ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-03 08:41:07] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-03 08:41:07] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-03 08:41:07] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:41:07] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:41:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12774862215850801003.gal : 1 ms
[2025-06-03 08:41:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9709973303202263426.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12774862215850801003.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9709973303202263426.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality9709973303202263426.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 9957
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :9957 after 46231
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :46231 after 6.44381e+07
Detected timeout of ITS tools.
[2025-06-03 08:41:22] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:41:22] [INFO ] Applying decomposition
[2025-06-03 08:41:22] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4998255080908868639.txt' '-o' '/tmp/graph4998255080908868639.bin' '-w' '/tmp/graph4998255080908868639.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4998255080908868639.bin' '-l' '-1' '-v' '-w' '/tmp/graph4998255080908868639.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:41:22] [INFO ] Decomposing Gal with order
[2025-06-03 08:41:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:41:22] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:41:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 08:41:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15044342617500801900.gal : 1 ms
[2025-06-03 08:41:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16671576885589036057.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15044342617500801900.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16671576885589036057.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality16671576885589036057.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 969
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :969 after 421209
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :421209 after 9.48679e+12
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9.48679e+12 after 9.48692e+12
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :9.48692e+12 after 9.81432e+12
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :9.81432e+12 after 9.81432e+12
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :9.81432e+12 after 9.81432e+12
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :9.81432e+12 after 9.81438e+12
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.82467e+13 after 2.87125e+13
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30147 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-03 08:41:37] [INFO ] Flatten gal took : 4 ms
[2025-06-03 08:41:37] [INFO ] Applying decomposition
[2025-06-03 08:41:37] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3255019936429690172.txt' '-o' '/tmp/graph3255019936429690172.bin' '-w' '/tmp/graph3255019936429690172.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3255019936429690172.bin' '-l' '-1' '-v' '-w' '/tmp/graph3255019936429690172.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:41:37] [INFO ] Decomposing Gal with order
[2025-06-03 08:41:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:41:37] [INFO ] Flatten gal took : 4 ms
[2025-06-03 08:41:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 08:41:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16196627075905162463.gal : 1 ms
[2025-06-03 08:41:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6448417316654769371.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16196627075905162463.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6448417316654769371.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality6448417316654769371.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 72
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :72 after 252
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :252 after 576
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :576 after 1188
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1188 after 29376
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :29376 after 7.48818e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7.48818e+06 after 2.43879e+14
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.43879e+14 after 4.61657e+14
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.61657e+14 after 7.14152e+14
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.14152e+14 after 1.00776e+15
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.00776e+15 after 1.3433e+15
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.3433e+15 after 1.72417e+15
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.72417e+15 after 3.68075e+15
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[155] Max Struct:[255]
Ending property specific reduction for Murphy-PT-D4N050-UpperBounds-07 in 93960 ms.
Starting property specific reduction for Murphy-PT-D4N050-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 35 rows 25 cols
[2025-06-03 08:42:28] [INFO ] Computed 1 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10011 steps (2 resets) in 6 ms. (1430 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:42:28] [INFO ] Invariant cache hit.
[2025-06-03 08:42:28] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:42:28] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:42:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:42:28] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:42:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:42:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:42:28] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:42:28] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:42:28] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:42:28] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 2 ms. Remains 3 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:42:28] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 08:42:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 52 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 3/25 places, 4/35 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:42:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 431 ms. (2314 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 294 ms. (3389 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:42:29] [INFO ] Invariant cache hit.
[2025-06-03 08:42:29] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-03 08:42:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:42:29] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:42:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:42:29] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-03 08:42:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:42:29] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:42:29] [INFO ] Added : 3 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2025-06-03 08:42:29] [INFO ] Invariant cache hit.
[2025-06-03 08:42:29] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-03 08:42:29] [INFO ] Invariant cache hit.
[2025-06-03 08:42:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:42:29] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2025-06-03 08:42:29] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:42:29] [INFO ] Invariant cache hit.
[2025-06-03 08:42:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 43 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 60 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:42:29] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:42:29] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:42:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14699500187488584781.gal : 2 ms
[2025-06-03 08:42:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2168642546728093930.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14699500187488584781.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2168642546728093930.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2168642546728093930.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.003521,3812,2,8,5,44,7,0,24,26,0
Total reachable state count : 6
RANDOM walk for 40002 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties

Verifying 1 reachability properties.
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.00387,3812,1,0,5,44,7,0,25,26,0
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 5 ms. (steps per millisecond=2 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D4N050-UpperBounds-08 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D4N050-UpperBounds-08 in 1283 ms.
Starting property specific reduction for Murphy-PT-D4N050-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[3] Max Struct:[+inf]
// Phase 1: matrix 35 rows 25 cols
[2025-06-03 08:42:29] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10016 steps (2 resets) in 8 ms. (1112 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:42:29] [INFO ] Invariant cache hit.
[2025-06-03 08:42:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:42:29] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-03 08:42:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:42:29] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:42:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:42:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:42:29] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-03 08:42:29] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:42:29] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:42:29] [INFO ] Added : 3 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 2 ms. Remains 3 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:42:29] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 08:42:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 56 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 50 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 112ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 112ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 3/25 places, 4/35 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:42:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 402 ms. (2481 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 265 ms. (3759 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:42:30] [INFO ] Invariant cache hit.
[2025-06-03 08:42:30] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-03 08:42:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:42:30] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-03 08:42:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:42:30] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-03 08:42:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:42:30] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:42:30] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2025-06-03 08:42:30] [INFO ] Invariant cache hit.
[2025-06-03 08:42:30] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-03 08:42:30] [INFO ] Invariant cache hit.
[2025-06-03 08:42:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:42:30] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2025-06-03 08:42:30] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:42:30] [INFO ] Invariant cache hit.
[2025-06-03 08:42:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 42 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 43 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:42:30] [INFO ] Flatten gal took : 0 ms
[2025-06-03 08:42:30] [INFO ] Flatten gal took : 0 ms
[2025-06-03 08:42:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6847942606511786080.gal : 0 ms
[2025-06-03 08:42:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality755405733080975208.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6847942606511786080.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality755405733080975208.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality755405733080975208.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.002663,3812,2,8,5,44,7,0,24,26,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RANDOM walk for 40002 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
MIN0,0,0.002889,3812,1,0,5,44,7,0,25,26,0
BEST_FIRST walk for 40001 steps (8 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 5 ms. (steps per millisecond=2 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D4N050-UpperBounds-10 3 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D4N050-UpperBounds-10 in 1210 ms.
Starting property specific reduction for Murphy-PT-D4N050-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[3] Max Struct:[+inf]
// Phase 1: matrix 35 rows 25 cols
[2025-06-03 08:42:30] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:42:30] [INFO ] Invariant cache hit.
[2025-06-03 08:42:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:42:30] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:42:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:42:30] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:42:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:42:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-03 08:42:30] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:42:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:42:30] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:42:30] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:42:30] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 08:42:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 40 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 37 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 82ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 3/25 places, 4/35 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:42:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 265 ms. (3759 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 235 ms. (4237 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:42:31] [INFO ] Invariant cache hit.
[2025-06-03 08:42:31] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-03 08:42:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:42:31] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:42:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:42:31] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-03 08:42:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:42:31] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:42:31] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2025-06-03 08:42:31] [INFO ] Invariant cache hit.
[2025-06-03 08:42:31] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-03 08:42:31] [INFO ] Invariant cache hit.
[2025-06-03 08:42:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:42:31] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2025-06-03 08:42:31] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:42:31] [INFO ] Invariant cache hit.
[2025-06-03 08:42:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 58 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 59 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 121ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 121ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:42:31] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:42:31] [INFO ] Flatten gal took : 0 ms
[2025-06-03 08:42:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6967884286043180353.gal : 1 ms
[2025-06-03 08:42:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9148528324216489803.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6967884286043180353.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9148528324216489803.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9148528324216489803.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.003121,3812,2,8,5,44,7,0,24,26,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.003439,3812,1,0,5,44,7,0,25,26,0
RANDOM walk for 40000 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 5 ms. (steps per millisecond=2 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D4N050-UpperBounds-11 3 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D4N050-UpperBounds-11 in 1044 ms.
Starting property specific reduction for Murphy-PT-D4N050-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 35 rows 25 cols
[2025-06-03 08:42:31] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10028 steps (2 resets) in 10 ms. (911 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:42:31] [INFO ] Invariant cache hit.
[2025-06-03 08:42:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:42:31] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-03 08:42:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:42:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:42:31] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:42:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:42:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-03 08:42:31] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:42:31] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 3 ms. Remains 3 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:42:31] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 08:42:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 60 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 62 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 127ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 3/25 places, 4/35 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:42:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 457 ms. (2183 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 338 ms. (2949 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:42:32] [INFO ] Invariant cache hit.
[2025-06-03 08:42:32] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-03 08:42:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:42:32] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:42:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:42:32] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-03 08:42:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-03 08:42:32] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-03 08:42:32] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2025-06-03 08:42:32] [INFO ] Invariant cache hit.
[2025-06-03 08:42:32] [INFO ] Implicit Places using invariants in 13 ms returned []
[2025-06-03 08:42:32] [INFO ] Invariant cache hit.
[2025-06-03 08:42:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:42:32] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2025-06-03 08:42:32] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:42:32] [INFO ] Invariant cache hit.
[2025-06-03 08:42:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 39 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 82ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:42:32] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:42:32] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:42:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4988524731759331949.gal : 2 ms
[2025-06-03 08:42:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6167896064257529376.prop : 1 ms
RANDOM walk for 40001 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4988524731759331949.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6167896064257529376.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40001 steps (8 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6167896064257529376.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.002203,3808,2,8,5,44,7,0,24,26,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.002414,3808,1,0,5,44,7,0,25,26,0
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 5 ms. (steps per millisecond=2 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D4N050-UpperBounds-13 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D4N050-UpperBounds-13 in 1345 ms.
Starting property specific reduction for Murphy-PT-D4N050-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[3] Max Struct:[+inf]
// Phase 1: matrix 35 rows 25 cols
[2025-06-03 08:42:32] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 6 ms. (1428 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:42:32] [INFO ] Invariant cache hit.
[2025-06-03 08:42:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:42:32] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:42:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:42:32] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:42:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:42:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:42:32] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:42:32] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:42:32] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:42:32] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 0 ms. Remains 3 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:42:33] [INFO ] Computed 0 invariants in 0 ms
[2025-06-03 08:42:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 41 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 80ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 80ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 3/25 places, 4/35 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:42:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 426 ms. (2341 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 258 ms. (3861 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:42:33] [INFO ] Invariant cache hit.
[2025-06-03 08:42:33] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-03 08:42:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:42:33] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:42:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:42:33] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-03 08:42:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-03 08:42:33] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:42:33] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2025-06-03 08:42:33] [INFO ] Invariant cache hit.
[2025-06-03 08:42:33] [INFO ] Implicit Places using invariants in 13 ms returned []
[2025-06-03 08:42:33] [INFO ] Invariant cache hit.
[2025-06-03 08:42:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:42:33] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2025-06-03 08:42:33] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:42:33] [INFO ] Invariant cache hit.
[2025-06-03 08:42:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 42 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 40 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 86ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:42:34] [INFO ] Flatten gal took : 0 ms
[2025-06-03 08:42:34] [INFO ] Flatten gal took : 0 ms
[2025-06-03 08:42:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15777073405804222536.gal : 0 ms
[2025-06-03 08:42:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12306708823420971708.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15777073405804222536.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12306708823420971708.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (8 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12306708823420971708.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.002452,3808,2,8,5,44,7,0,24,26,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.002669,3808,1,0,5,44,7,0,25,26,0
BEST_FIRST walk for 40003 steps (8 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 4 ms. (steps per millisecond=3 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D4N050-UpperBounds-14 3 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D4N050-UpperBounds-14 in 1127 ms.
Starting property specific reduction for Murphy-PT-D4N050-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[255]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[255]
// Phase 1: matrix 35 rows 25 cols
[2025-06-03 08:42:34] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[255]
RANDOM walk for 10000 steps (2 resets) in 6 ms. (1428 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[78] Max Struct:[255]
[2025-06-03 08:42:34] [INFO ] Invariant cache hit.
[2025-06-03 08:42:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:42:34] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:42:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:42:34] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:42:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:42:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:42:34] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:42:34] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:42:34] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:42:34] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[78] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[151] Max Struct:[255]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2025-06-03 08:42:34] [INFO ] Invariant cache hit.
[2025-06-03 08:42:34] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 993ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 994ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 997 ms. Remains : 25/25 places, 35/35 transitions.
[2025-06-03 08:42:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[151] Max Struct:[255]
RANDOM walk for 1000047 steps (2 resets) in 844 ms. (1183 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 465 ms. (2145 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[151] Max Struct:[255]
[2025-06-03 08:42:36] [INFO ] Invariant cache hit.
[2025-06-03 08:42:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:42:36] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:42:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:42:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:42:36] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:42:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:42:36] [INFO ] [Nat]Added 10 Read/Feed constraints in 6 ms returned sat
[2025-06-03 08:42:36] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:42:36] [INFO ] Added : 3 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 428 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[151] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[255]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2025-06-03 08:42:37] [INFO ] Invariant cache hit.
[2025-06-03 08:42:37] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-03 08:42:37] [INFO ] Invariant cache hit.
[2025-06-03 08:42:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:42:37] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2025-06-03 08:42:37] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2025-06-03 08:42:37] [INFO ] Invariant cache hit.
[2025-06-03 08:42:37] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 493 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 488 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 989ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 990ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1110 ms. Remains : 25/25 places, 35/35 transitions.
[2025-06-03 08:42:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[201] Max Struct:[255]
RANDOM walk for 1000025 steps (2 resets) in 837 ms. (1193 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 477 ms. (2092 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201] Max Struct:[255]
[2025-06-03 08:42:39] [INFO ] Invariant cache hit.
[2025-06-03 08:42:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:42:39] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:42:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:42:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:42:39] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:42:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:42:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-03 08:42:39] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:42:39] [INFO ] Added : 1 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 154 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249] Max Struct:[255]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2025-06-03 08:42:39] [INFO ] Invariant cache hit.
[2025-06-03 08:42:39] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-03 08:42:39] [INFO ] Invariant cache hit.
[2025-06-03 08:42:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:42:40] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2025-06-03 08:42:40] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2025-06-03 08:42:40] [INFO ] Invariant cache hit.
[2025-06-03 08:42:40] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 443 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 898ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 898ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1018 ms. Remains : 25/25 places, 35/35 transitions.
[2025-06-03 08:42:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[249] Max Struct:[255]
RANDOM walk for 1000001 steps (2 resets) in 794 ms. (1257 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 447 ms. (2232 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[249] Max Struct:[255]
[2025-06-03 08:42:42] [INFO ] Invariant cache hit.
[2025-06-03 08:42:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:42:42] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:42:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:42:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:42:42] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:42:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:42:42] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-03 08:42:42] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:42:42] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[249] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249] Max Struct:[255]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2025-06-03 08:42:42] [INFO ] Invariant cache hit.
[2025-06-03 08:42:42] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-03 08:42:42] [INFO ] Invariant cache hit.
[2025-06-03 08:42:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:42:42] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2025-06-03 08:42:42] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2025-06-03 08:42:42] [INFO ] Invariant cache hit.
[2025-06-03 08:42:42] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 409 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 747ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 748ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 825 ms. Remains : 25/25 places, 35/35 transitions.
[2025-06-03 08:42:43] [INFO ] Flatten gal took : 4 ms
[2025-06-03 08:42:43] [INFO ] Flatten gal took : 7 ms
[2025-06-03 08:42:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6649485678265405924.gal : 1 ms
[2025-06-03 08:42:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11767780992826228083.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6649485678265405924.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11767780992826228083.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality11767780992826228083.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 36
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :36 after 90
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :90 after 192
RANDOM walk for 40030 steps (8 resets) in 82 ms. (482 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :192 after 30630
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30630 after 243534
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :243534 after 1.78854e+09
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.78854e+09 after 1.89814e+13
Interrupted probabilistic random walk after 483150 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 2
Probabilistic random walk after 483150 steps, saw 334724 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
[2025-06-03 08:42:46] [INFO ] Invariant cache hit.
[2025-06-03 08:42:46] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-03 08:42:46] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/60 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 37 constraints, problems are : Problem set: 1 solved, 1 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 1/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 38 constraints, problems are : Problem set: 1 solved, 1 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 172ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2025-06-03 08:42:46] [INFO ] Invariant cache hit.
[2025-06-03 08:42:46] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 580ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 581ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 582 ms. Remains : 25/25 places, 35/35 transitions.
RANDOM walk for 40021 steps (8 resets) in 25 ms. (1539 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2292052 steps, run timeout after 3001 ms. (steps per millisecond=763 ) properties seen :0 out of 1
Probabilistic random walk after 2292052 steps, saw 1595430 distinct states, run finished after 3001 ms. (steps per millisecond=763 ) properties seen :0
[2025-06-03 08:42:50] [INFO ] Invariant cache hit.
[2025-06-03 08:42:50] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-03 08:42:50] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/60 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 37 constraints, problems are : Problem set: 0 solved, 1 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 38 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 156ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2025-06-03 08:42:50] [INFO ] Invariant cache hit.
[2025-06-03 08:42:50] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-03 08:42:50] [INFO ] Invariant cache hit.
[2025-06-03 08:42:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:42:50] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2025-06-03 08:42:50] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2025-06-03 08:42:50] [INFO ] Invariant cache hit.
[2025-06-03 08:42:50] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 413 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 736ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 737ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 811 ms. Remains : 25/25 places, 35/35 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 60 edges and 25 vertex of which 10 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Applied a total of 1 rules in 1 ms. Remains 10 /25 variables (removed 15) and now considering 15/35 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2025-06-03 08:42:51] [INFO ] Computed 1 invariants in 1 ms
[2025-06-03 08:42:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:42:51] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-03 08:42:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:42:51] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-03 08:42:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-03 08:42:51] [INFO ] After 20ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-03 08:42:51] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-03 08:42:51] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-03 08:42:51] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:42:51] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:42:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9799238321525206628.gal : 1 ms
[2025-06-03 08:42:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4961064196349710714.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9799238321525206628.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4961064196349710714.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality4961064196349710714.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 9957
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :9957 after 46231
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :46231 after 6.44381e+07
Detected timeout of ITS tools.
[2025-06-03 08:43:06] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:43:06] [INFO ] Applying decomposition
[2025-06-03 08:43:06] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16581649883893579224.txt' '-o' '/tmp/graph16581649883893579224.bin' '-w' '/tmp/graph16581649883893579224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16581649883893579224.bin' '-l' '-1' '-v' '-w' '/tmp/graph16581649883893579224.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:43:06] [INFO ] Decomposing Gal with order
[2025-06-03 08:43:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:43:06] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:43:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 08:43:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1278568574293392940.gal : 1 ms
[2025-06-03 08:43:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13245187382185686236.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1278568574293392940.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13245187382185686236.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality13245187382185686236.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 969
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :969 after 421209
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :421209 after 1.80997e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.66122e+13 after 1.66124e+13
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.66124e+13 after 1.72281e+13
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.72281e+13 after 1.72281e+13
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.72281e+13 after 1.72281e+13
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.72281e+13 after 1.72281e+13
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30162 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-03 08:43:21] [INFO ] Flatten gal took : 3 ms
[2025-06-03 08:43:21] [INFO ] Applying decomposition
[2025-06-03 08:43:21] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7718841953942039415.txt' '-o' '/tmp/graph7718841953942039415.bin' '-w' '/tmp/graph7718841953942039415.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7718841953942039415.bin' '-l' '-1' '-v' '-w' '/tmp/graph7718841953942039415.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:43:21] [INFO ] Decomposing Gal with order
[2025-06-03 08:43:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:43:21] [INFO ] Flatten gal took : 4 ms
[2025-06-03 08:43:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 08:43:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13692016656549024319.gal : 1 ms
[2025-06-03 08:43:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1516431060372501144.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13692016656549024319.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1516431060372501144.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality1516431060372501144.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 144
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :144 after 468
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :468 after 1080
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1080 after 23868
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :23868 after 2.99527e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.99527e+06 after 5.86504e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.86504e+10 after 2.50924e+14
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[249] Max Struct:[255]
Ending property specific reduction for Murphy-PT-D4N050-UpperBounds-15 in 97329 ms.
[2025-06-03 08:44:11] [INFO ] Flatten gal took : 3 ms
[2025-06-03 08:44:11] [INFO ] Applying decomposition
[2025-06-03 08:44:11] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph498595969666171190.txt' '-o' '/tmp/graph498595969666171190.bin' '-w' '/tmp/graph498595969666171190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph498595969666171190.bin' '-l' '-1' '-v' '-w' '/tmp/graph498595969666171190.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:44:11] [INFO ] Decomposing Gal with order
[2025-06-03 08:44:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:44:11] [INFO ] Flatten gal took : 4 ms
[2025-06-03 08:44:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 08:44:11] [INFO ] Time to serialize gal into /tmp/UpperBounds1324104587964852734.gal : 1 ms
[2025-06-03 08:44:11] [INFO ] Time to serialize properties into /tmp/UpperBounds11760591200432633373.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1324104587964852734.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11760591200432633373.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds11760591200432633373.prop.
Detected timeout of ITS tools.
[2025-06-03 09:05:49] [INFO ] Flatten gal took : 4 ms
[2025-06-03 09:05:49] [INFO ] Time to serialize gal into /tmp/UpperBounds8865191475482630308.gal : 2 ms
[2025-06-03 09:05:49] [INFO ] Time to serialize properties into /tmp/UpperBounds10482076648583296166.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8865191475482630308.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10482076648583296166.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds10482076648583296166.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,7.25875e+18,351.585,2973284,2,10568,5,1.02079e+07,6,0,173,1.09767e+07,0
Total reachable state count : 7258754799509878656

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 249
Bounds property Murphy-PT-D4N050-UpperBounds-07 :0 <= p1_5 <= 249
FORMULA Murphy-PT-D4N050-UpperBounds-07 249 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D4N050-UpperBounds-07,0,351.591,2973284,1,0,7,1.02079e+07,9,1,465,1.09767e+07,4
Min sum of variable value : 0
Maximum sum along a path : 249
Bounds property Murphy-PT-D4N050-UpperBounds-15 :0 <= p1_4 <= 249
FORMULA Murphy-PT-D4N050-UpperBounds-15 249 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D4N050-UpperBounds-15,0,351.75,2973284,1,0,8,1.02079e+07,10,1,734,1.09767e+07,5
Total runtime 1944983 ms.

BK_STOP 1748941901956

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="Murphy-PT-D4N050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is Murphy-PT-D4N050, 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 r139-smll-174876533200077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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