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-174876533200075.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-D3N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-174876533200075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K 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 15K 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-D3N050-UpperBounds-00
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-01
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-02
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-03
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-04
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-05
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-06
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-07
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-08
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-09
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-10
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-11
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-12
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-13
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-14
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748938278431

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-D3N050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-03 08:11:20] [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:11:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 08:11:20] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2025-06-03 08:11:20] [INFO ] Transformed 24 places.
[2025-06-03 08:11:20] [INFO ] Transformed 28 transitions.
[2025-06-03 08:11:20] [INFO ] Parsed PT model containing 24 places and 28 transitions and 108 arcs in 327 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Current structural bounds on expressions (Initially) : Max Seen:[1, 1, 0, 3, 1, 50, 50, 0, 0, 1, 3, 0, 1, 3, 50, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 1, 0, 3, 1, 50, 50, 0, 0, 1, 3, 0, 1, 3, 50, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 28 rows 24 cols
[2025-06-03 08:11:20] [INFO ] Computed 5 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 0, 3, 1, 50, 50, 0, 0, 1, 3, 0, 1, 3, 50, 0] Max Struct:[204, 204, +inf, +inf, 204, 204, 204, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
RANDOM walk for 10045 steps (2 resets) in 30 ms. (324 steps per ms)
BEST_FIRST walk for 160013 steps (32 resets) in 164 ms. (969 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[93, 101, 1, 3, 71, 107, 99, 2, 2, 77, 3, 2, 71, 3, 87, 2] Max Struct:[204, 204, +inf, +inf, 204, 204, 204, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
[2025-06-03 08:11:20] [INFO ] Invariant cache hit.
[2025-06-03 08:11:20] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-03 08:11:20] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:21] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2025-06-03 08:11:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:21] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-06-03 08:11:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:11:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2025-06-03 08:11:21] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 23 ms.
[2025-06-03 08:11:21] [INFO ] Added : 0 causal constraints over 0 iterations in 41 ms. Result :sat
Minimization took 39 ms.
[2025-06-03 08:11:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 10 ms returned sat
[2025-06-03 08:11:21] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-03 08:11:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:21] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-03 08:11:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2025-06-03 08:11:21] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:11:21] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 42 ms.
[2025-06-03 08:11:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:21] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-03 08:11:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-03 08:11:21] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:11:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:11:21] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:11:21] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:11:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:21] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:11:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:21] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-03 08:11:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:11:21] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-03 08:11:21] [INFO ] Added : 3 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 08:11:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 26 ms returned sat
[2025-06-03 08:11:21] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-03 08:11:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:11:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-03 08:11:22] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 38 ms.
[2025-06-03 08:11:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-03 08:11:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2025-06-03 08:11:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:11:22] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 64 ms.
[2025-06-03 08:11:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:11:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:11:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:11:22] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 31 ms.
[2025-06-03 08:11:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-03 08:11:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-03 08:11:22] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 08:11:22] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 15 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2025-06-03 08:11:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:11:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:11:22] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 9 ms.
[2025-06-03 08:11:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:11:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:11:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:22] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 42 ms.
[2025-06-03 08:11:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:11:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:11:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:11:23] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:23] [INFO ] Added : 3 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 6 ms.
[2025-06-03 08:11:23] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:23] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:11:23] [INFO ] Added : 2 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 08:11:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:11:23] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:11:23] [INFO ] Added : 0 causal constraints over 0 iterations in 22 ms. Result :sat
Minimization took 37 ms.
[2025-06-03 08:11:23] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 6 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:11:23] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:23] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 9 ms.
[2025-06-03 08:11:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:11:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:23] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:11:23] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 68 ms.
[2025-06-03 08:11:23] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-03 08:11:23] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:23] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 12 ms to minimize.
[2025-06-03 08:11:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2025-06-03 08:11:23] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:11:23] [INFO ] Added : 3 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[93, 101, 1, 3, 71, 107, 99, 2, 2, 77, 3, 2, 71, 3, 87, 2] Max Struct:[204, 204, +inf, +inf, 204, 204, 204, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201, 197, 1, 3, 199, 125, 173, 2, 2, 201, 3, 2, 199, 3, 197, 2] Max Struct:[204, 204, +inf, +inf, 204, 204, 204, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Support contains 16 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 13 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2025-06-03 08:11:24] [INFO ] Invariant cache hit.
[2025-06-03 08:11:24] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/20 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 28/48 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 4/52 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 37 constraints, problems are : Problem set: 0 solved, 16 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 24/24 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/20 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 28/48 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 4/52 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 53 constraints, problems are : Problem set: 0 solved, 16 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 24/24 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 666ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 682ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 711 ms. Remains : 24/24 places, 28/28 transitions.
Found an invariant !
This invariant on transitions {13=1, 17=1, 25=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {13=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 16) seen :[58, 114, 1, 3, 56, 53, 59, 2, 2, 79, 3, 2, 56, 3, 54, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[201, 197, 1, 3, 199, 125, 173, 2, 2, 201, 3, 2, 199, 3, 197, 2] Max Struct:[204, 204, +inf, +inf, 204, 204, 204, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
[2025-06-03 08:11:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[201, 197, 1, 3, 199, 125, 173, 2, 2, 201, 3, 2, 199, 3, 197, 2] Max Struct:[204, 204, +inf, +inf, 204, 204, 204, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
RANDOM walk for 1000000 steps (2 resets) in 593 ms. (1683 steps per ms)
BEST_FIRST walk for 16000016 steps (32 resets) in 8034 ms. (1991 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201, 201, 1, 3, 201, 125, 173, 2, 2, 201, 3, 2, 201, 3, 197, 2] Max Struct:[204, 204, +inf, +inf, 204, 204, 204, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
[2025-06-03 08:11:33] [INFO ] Invariant cache hit.
[2025-06-03 08:11:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:33] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:33] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:11:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:33] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:33] [INFO ] [Nat]Absence check using state equation in 9 ms returned unsat
[2025-06-03 08:11:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:33] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:33] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:33] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:33] [INFO ] [Nat]Absence check using state equation in 10 ms returned unsat
[2025-06-03 08:11:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:33] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:33] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:11:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:11:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:34] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:34] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:11:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:34] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:11:34] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using state equation in 20 ms returned unsat
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:11:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 22 ms returned sat
[2025-06-03 08:11:34] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:11:34] [INFO ] Added : 6 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 60 ms.
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:11:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:11:34] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:34] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 42 ms.
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:11:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:34] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:34] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:11:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:34] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:34] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 9 ms.
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using state equation in 9 ms returned unsat
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:11:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:34] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:11:34] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:11:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:11:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:34] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:11:35] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 08:11:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:35] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:35] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:11:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:35] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:35] [INFO ] [Nat]Absence check using state equation in 26 ms returned unsat
[2025-06-03 08:11:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:35] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:35] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:35] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:35] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:35] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:35] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:35] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 08:11:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:35] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:35] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:11:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:35] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:35] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:11:35] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2025-06-03 08:11:35] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2025-06-03 08:11:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2025-06-03 08:11:35] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:35] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 25 ms.
[2025-06-03 08:11:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:35] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:35] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:11:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:35] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:35] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:35] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:35] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2025-06-03 08:11:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2025-06-03 08:11:35] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:35] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201, 201, 1, 3, 201, 125, 173, 2, 2, 201, 3, 2, 201, 3, 197, 2] Max Struct:[201, 201, +inf, +inf, 201, 204, 204, +inf, +inf, 201, +inf, +inf, 201, +inf, 204, +inf]
FORMULA Murphy-PT-D3N050-UpperBounds-12 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-09 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-04 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-01 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-00 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 3, 181, 199, 2, 2, 3, 2, 3, 197, 2] Max Struct:[+inf, +inf, 204, 204, +inf, +inf, +inf, +inf, +inf, 204, +inf]
Support contains 11 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 24/24 places, 28/28 transitions.
Found an invariant !
This invariant on transitions {13=1, 17=1, 25=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {13=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :[1, 3, 61, 52, 2, 2, 3, 2, 3, 59, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 3, 181, 199, 2, 2, 3, 2, 3, 197, 2] Max Struct:[+inf, +inf, 204, 204, +inf, +inf, +inf, +inf, +inf, 204, +inf]
[2025-06-03 08:11:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 3, 181, 199, 2, 2, 3, 2, 3, 197, 2] Max Struct:[+inf, +inf, 204, 204, +inf, +inf, +inf, +inf, +inf, 204, +inf]
RANDOM walk for 1000000 steps (2 resets) in 522 ms. (1912 steps per ms)
BEST_FIRST walk for 11000011 steps (22 resets) in 5537 ms. (1986 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 3, 181, 199, 2, 2, 3, 2, 3, 197, 2] Max Struct:[+inf, +inf, 204, 204, +inf, +inf, +inf, +inf, +inf, 204, +inf]
[2025-06-03 08:11:41] [INFO ] Invariant cache hit.
[2025-06-03 08:11:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:41] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:41] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:41] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:41] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:11:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:11:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:11:41] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:41] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2025-06-03 08:11:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:41] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:41] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:41] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:41] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:11:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:41] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:41] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2025-06-03 08:11:42] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:11:42] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 31 ms.
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:11:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:11:42] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:42] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 15 ms.
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:11:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:42] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:11:42] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:42] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:42] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:42] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:11:42] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:11:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:42] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:42] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:42] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:11:42] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:11:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2025-06-03 08:11:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2025-06-03 08:11:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2025-06-03 08:11:42] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:42] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 25 ms.
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:11:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:11:42] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2025-06-03 08:11:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2025-06-03 08:11:42] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:42] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 3, 181, 199, 2, 2, 3, 2, 3, 197, 2] Max Struct:[+inf, +inf, 204, 204, +inf, +inf, +inf, +inf, +inf, 204, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 3, 181, 199, 2, 2, 3, 2, 3, 197, 2] Max Struct:[+inf, +inf, 204, 204, +inf, +inf, +inf, +inf, +inf, 204, +inf]
Support contains 11 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2025-06-03 08:11:43] [INFO ] Invariant cache hit.
[2025-06-03 08:11:43] [INFO ] Implicit Places using invariants in 42 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 46 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 50 ms. Remains : 20/24 places, 28/28 transitions.
Found an invariant !
This invariant on transitions {14=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {13=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :[1, 3, 61, 60, 2, 2, 3, 2, 3, 62, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 3, 181, 199, 2, 2, 3, 2, 3, 197, 2] Max Struct:[+inf, +inf, 204, 204, +inf, +inf, +inf, +inf, +inf, 204, +inf]
// Phase 1: matrix 28 rows 20 cols
[2025-06-03 08:11:43] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 3, 181, 199, 2, 2, 3, 2, 3, 197, 2] Max Struct:[+inf, +inf, 204, 204, +inf, +inf, +inf, +inf, +inf, 204, +inf]
RANDOM walk for 1000055 steps (2 resets) in 480 ms. (2079 steps per ms)
BEST_FIRST walk for 11000011 steps (22 resets) in 4752 ms. (2314 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 3, 181, 199, 2, 2, 3, 2, 3, 197, 2] Max Struct:[+inf, +inf, 204, 204, +inf, +inf, +inf, +inf, +inf, 204, +inf]
[2025-06-03 08:11:48] [INFO ] Invariant cache hit.
[2025-06-03 08:11:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:48] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:11:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:48] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:11:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:11:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:48] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:11:48] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2025-06-03 08:11:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:48] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:11:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-03 08:11:48] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:11:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:11:48] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:48] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:11:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:48] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:11:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:48] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:11:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2025-06-03 08:11:48] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:48] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 41 ms.
[2025-06-03 08:11:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:48] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:11:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:48] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:11:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2025-06-03 08:11:48] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:48] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 15 ms.
[2025-06-03 08:11:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:48] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:11:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:48] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:11:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:48] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:11:48] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:11:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:49] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:49] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:11:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:49] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:49] [INFO ] Added : 2 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:11:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:49] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-03 08:11:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-03 08:11:49] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-03 08:11:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:49] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:11:49] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 08:11:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:49] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:49] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-03 08:11:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:49] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:11:49] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:11:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:49] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:49] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:11:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:49] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:49] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 08:11:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:49] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:11:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:49] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:11:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:49] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:11:49] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 22 ms.
[2025-06-03 08:11:49] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-03 08:11:49] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-03 08:11:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-03 08:11:49] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:11:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:11:49] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:11:49] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 3, 181, 199, 2, 2, 3, 2, 3, 197, 2] Max Struct:[+inf, +inf, 204, 204, +inf, +inf, +inf, +inf, +inf, 204, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 3, 181, 199, 2, 2, 3, 2, 3, 197, 2] Max Struct:[+inf, +inf, 204, 204, +inf, +inf, +inf, +inf, +inf, 204, +inf]
Support contains 11 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2025-06-03 08:11:49] [INFO ] Invariant cache hit.
[2025-06-03 08:11:49] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-03 08:11:49] [INFO ] Invariant cache hit.
[2025-06-03 08:11:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:11:49] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2025-06-03 08:11:49] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-03 08:11:49] [INFO ] Invariant cache hit.
[2025-06-03 08:11:49] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 469ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 470ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 538 ms. Remains : 20/20 places, 28/28 transitions.
Found an invariant !
This invariant on transitions {14=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {13=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :[1, 3, 59, 53, 2, 2, 3, 2, 3, 51, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 3, 181, 199, 2, 2, 3, 2, 3, 197, 2] Max Struct:[+inf, +inf, 204, 204, +inf, +inf, +inf, +inf, +inf, 204, +inf]
RANDOM walk for 40122 steps (8 resets) in 828 ms. (48 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 14/14 properties
[2025-06-03 08:11:50] [INFO ] Flatten gal took : 57 ms
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 14/14 properties
[2025-06-03 08:11:50] [INFO ] Flatten gal took : 20 ms
BEST_FIRST walk for 40003 steps (8 resets) in 77 ms. (512 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 14/14 properties
[2025-06-03 08:11:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4432197805608418611.gal : 20 ms
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 14/14 properties
[2025-06-03 08:11:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality489104095649068989.prop : 2 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/ReachabilityCardinality4432197805608418611.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality489104095649068989.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 14/14 properties

BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 14/14 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 ...327
Loading property file /tmp/ReachabilityCardinality489104095649068989.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :6 after 36
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :36 after 90
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :90 after 192
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :192 after 30630
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 196 ms. (203 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 74 ms. (533 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :30630 after 243534
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :243534 after 1.78854e+09
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :1.78854e+09 after 5.66311e+10
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :5.66311e+10 after 1.14813e+11
Interrupted probabilistic random walk after 159113 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 14
Probabilistic random walk after 159113 steps, saw 107558 distinct states, run finished after 3021 ms. (steps per millisecond=52 ) properties seen :0
[2025-06-03 08:11:54] [INFO ] Invariant cache hit.
[2025-06-03 08:11:54] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2025-06-03 08:11:54] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX9 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 28/44 variables, 16/18 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 8/26 constraints. Problems are: Problem set: 3 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/26 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 4/48 variables, 4/30 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 3 solved, 11 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 28/44 variables, 16/18 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 8/26 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 3/29 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/29 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 4/48 variables, 4/33 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 8/41 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 41 constraints, problems are : Problem set: 3 solved, 11 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 11/14 constraints, Known Traps: 1/1 constraints]
After SMT, in 519ms problems are : Problem set: 3 solved, 11 unsolved
Fused 11 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5049 ms.
Support contains 11 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2025-06-03 08:11:59] [INFO ] Invariant cache hit.
[2025-06-03 08:11:59] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 457ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 458ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 460 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40041 steps (8 resets) in 68 ms. (580 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 41 ms. (952 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 47 ms. (833 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 47 ms. (833 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 37 ms. (1052 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 37 ms. (1052 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 43 ms. (909 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 53 ms. (740 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 65 ms. (606 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 351203 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 11
Probabilistic random walk after 351203 steps, saw 238656 distinct states, run finished after 3002 ms. (steps per millisecond=116 ) properties seen :0
[2025-06-03 08:12:03] [INFO ] Invariant cache hit.
[2025-06-03 08:12:03] [INFO ] State equation strengthened by 8 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) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2025-06-03 08:12:03] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 28/44 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 4/48 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 0 solved, 11 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 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) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 28/44 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 4/48 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 41 constraints, problems are : Problem set: 0 solved, 11 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 511ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 3 different solutions.
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :1.14813e+11 after 4.52978e+11
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :4.52978e+11 after 8.06626e+11
Parikh walk visited 0 properties in 5779 ms.
Support contains 11 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 4 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2025-06-03 08:12:09] [INFO ] Invariant cache hit.
[2025-06-03 08:12:09] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-03 08:12:09] [INFO ] Invariant cache hit.
[2025-06-03 08:12:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:12:09] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2025-06-03 08:12:09] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-03 08:12:09] [INFO ] Invariant cache hit.
[2025-06-03 08:12:09] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 713ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 715ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 819 ms. Remains : 20/20 places, 28/28 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running SMT prover for 11 properties.
[2025-06-03 08:12:10] [INFO ] Invariant cache hit.
[2025-06-03 08:12:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:12:10] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2025-06-03 08:12:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:12:10] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2025-06-03 08:12:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:12:11] [INFO ] After 65ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2025-06-03 08:12:11] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
[2025-06-03 08:12:11] [INFO ] After 325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2025-06-03 08:12:11] [INFO ] Flatten gal took : 20 ms
[2025-06-03 08:12:11] [INFO ] Flatten gal took : 9 ms
[2025-06-03 08:12:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15594427257093972429.gal : 3 ms
[2025-06-03 08:12:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2849962179603750634.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/ReachabilityCardinality15594427257093972429.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2849962179603750634.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/ReachabilityCardinality2849962179603750634.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 39954
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :39954 after 274734
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :274734 after 2.30621e+09
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :2.30621e+09 after 5.65601e+10
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :5.65601e+10 after 1.1507e+11
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :1.1507e+11 after 5.38802e+11
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :5.38802e+11 after 9.9129e+11
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :9.9129e+11 after 1.58341e+12
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :1.58341e+12 after 8.41644e+12
Detected timeout of ITS tools.
[2025-06-03 08:12:26] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:12:26] [INFO ] Applying decomposition
[2025-06-03 08:12:26] [INFO ] Flatten gal took : 15 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/graph18275702855423250437.txt' '-o' '/tmp/graph18275702855423250437.bin' '-w' '/tmp/graph18275702855423250437.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18275702855423250437.bin' '-l' '-1' '-v' '-w' '/tmp/graph18275702855423250437.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:12:26] [INFO ] Decomposing Gal with order
[2025-06-03 08:12:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:12:26] [INFO ] Flatten gal took : 70 ms
[2025-06-03 08:12:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-03 08:12:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15589866222145448665.gal : 7 ms
[2025-06-03 08:12:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1883020177565296564.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/ReachabilityCardinality15589866222145448665.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1883020177565296564.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/ReachabilityCardinality1883020177565296564.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 6.98717e+09
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :6.98717e+09 after 6.99064e+09
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :6.99064e+09 after 1.28285e+10
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :1.28285e+10 after 1.28286e+10
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :1.28286e+10 after 1.3072e+10
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :1.3072e+10 after 2.72457e+10
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :8.06626e+11 after 1.85793e+12
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :1.85793e+12 after 5.55063e+12
Detected timeout of ITS tools.
[2025-06-03 08:12:41] [INFO ] Flatten gal took : 6 ms
[2025-06-03 08:12:41] [INFO ] Applying decomposition
[2025-06-03 08:12:41] [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/graph13147785904911764804.txt' '-o' '/tmp/graph13147785904911764804.bin' '-w' '/tmp/graph13147785904911764804.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13147785904911764804.bin' '-l' '-1' '-v' '-w' '/tmp/graph13147785904911764804.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:12:41] [INFO ] Decomposing Gal with order
[2025-06-03 08:12:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:12:41] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:12:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 08:12:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14457326006752336859.gal : 2 ms
[2025-06-03 08:12:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9477064429952392947.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/ReachabilityCardinality14457326006752336859.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9477064429952392947.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/ReachabilityCardinality9477064429952392947.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 3.56207e+11
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30936 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, 3, 181, 199, 2, 2, 3, 2, 3, 197, 2] Max Struct:[+inf, +inf, 204, 204, +inf, +inf, +inf, +inf, +inf, 204, +inf]
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-02
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]
[2025-06-03 08:12:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:12:41] [INFO ] Invariant cache hit.
[2025-06-03 08:12:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:12:41] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:12:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:12:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:12:41] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:12:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:12:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-03 08:12:41] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:12:41] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 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 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 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 10 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:12:41] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 08:12:41] [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 48 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 47 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 3/20 places, 4/28 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 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:12:41] [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 476 ms. (2096 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 751 ms. (1329 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:12:43] [INFO ] Invariant cache hit.
[2025-06-03 08:12:43] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-03 08:12:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:12:43] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:12:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:12:43] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-03 08:12:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-03 08:12:43] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:12:43] [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 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2025-06-03 08:12:43] [INFO ] Invariant cache hit.
[2025-06-03 08:12:43] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-03 08:12:43] [INFO ] Invariant cache hit.
[2025-06-03 08:12:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:12:43] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2025-06-03 08:12:43] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:12:43] [INFO ] Invariant cache hit.
[2025-06-03 08:12:43] [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 50 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 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 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:12:43] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:12:43] [INFO ] Flatten gal took : 0 ms
RANDOM walk for 40000 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
[2025-06-03 08:12:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9273047158229328320.gal : 2 ms
[2025-06-03 08:12:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5281963740053649298.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/ReachabilityCardinality9273047158229328320.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5281963740053649298.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 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/ReachabilityCardinality5281963740053649298.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.002304,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.002535,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 13 ms. (steps per millisecond=1 ) 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-D3N050-UpperBounds-02 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-D3N050-UpperBounds-02 in 1835 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-03
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 28 rows 20 cols
[2025-06-03 08:12:43] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10045 steps (2 resets) in 8 ms. (1116 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:12:43] [INFO ] Invariant cache hit.
[2025-06-03 08:12:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:12:43] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-03 08:12:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:12:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:12:43] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-03 08:12:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:12:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:12:43] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:12:43] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 10 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 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 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 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:12:43] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 08:12:43] [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 67 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 64 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 137ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 3/20 places, 4/28 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 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:12:43] [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 478 ms. (2087 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 358 ms. (2785 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:12:44] [INFO ] Invariant cache hit.
[2025-06-03 08:12:44] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-03 08:12:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:12:44] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:12:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:12:44] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-03 08:12:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:12:44] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:12:44] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 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:12:44] [INFO ] Invariant cache hit.
[2025-06-03 08:12:44] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-03 08:12:44] [INFO ] Invariant cache hit.
[2025-06-03 08:12:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:12:44] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2025-06-03 08:12:44] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:12:44] [INFO ] Invariant cache hit.
[2025-06-03 08:12:44] [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 55 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 57 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 118ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 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 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
[2025-06-03 08:12:44] [INFO ] Flatten gal took : 1 ms
BEST_FIRST walk for 40003 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
[2025-06-03 08:12:44] [INFO ] Flatten gal took : 1 ms
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
[2025-06-03 08:12:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8974175013837060653.gal : 1 ms
[2025-06-03 08:12:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16569501011517636777.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/ReachabilityCardinality8974175013837060653.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16569501011517636777.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
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality16569501011517636777.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.004153,3492,2,8,5,44,6,0,23,26,0
Total reachable state count : 6

ITS tools runner thread asked to quit. Dying gracefully.
FORMULA Murphy-PT-D3N050-UpperBounds-03 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-D3N050-UpperBounds-03 in 1499 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-05
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:[204]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[204]
// Phase 1: matrix 28 rows 20 cols
[2025-06-03 08:12:44] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[204]
RANDOM walk for 10018 steps (2 resets) in 8 ms. (1113 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:[85] Max Struct:[204]
[2025-06-03 08:12:45] [INFO ] Invariant cache hit.
[2025-06-03 08:12:45] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2025-06-03 08:12:45] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-03 08:12:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:12:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:12:45] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-03 08:12:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:12:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2025-06-03 08:12:45] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:12:45] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[85] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[125] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2025-06-03 08:12:45] [INFO ] Invariant cache hit.
[2025-06-03 08:12:45] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 660ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 661ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 665 ms. Remains : 20/20 places, 28/28 transitions.
[2025-06-03 08:12:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[125] Max Struct:[204]
RANDOM walk for 1000012 steps (2 resets) in 648 ms. (1540 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 404 ms. (2469 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[125] Max Struct:[204]
[2025-06-03 08:12:46] [INFO ] Invariant cache hit.
[2025-06-03 08:12:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:12:46] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:12:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:12:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:12:47] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:12:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:12:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 21 ms returned sat
[2025-06-03 08:12:47] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:12:47] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2025-06-03 08:12:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2025-06-03 08:12:47] [INFO ] Added : 11 causal constraints over 3 iterations in 45 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[125] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2025-06-03 08:12:47] [INFO ] Invariant cache hit.
[2025-06-03 08:12:47] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-03 08:12:47] [INFO ] Invariant cache hit.
[2025-06-03 08:12:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:12:47] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2025-06-03 08:12:47] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-03 08:12:47] [INFO ] Invariant cache hit.
[2025-06-03 08:12:47] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 511ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 511ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 586 ms. Remains : 20/20 places, 28/28 transitions.
[2025-06-03 08:12:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[199] Max Struct:[204]
RANDOM walk for 1000021 steps (2 resets) in 718 ms. (1390 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 410 ms. (2433 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[199] Max Struct:[204]
[2025-06-03 08:12:48] [INFO ] Invariant cache hit.
[2025-06-03 08:12:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:12:48] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:12:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:12:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-03 08:12:48] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:12:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:12:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2025-06-03 08:12:48] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:12:48] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[199] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2025-06-03 08:12:49] [INFO ] Invariant cache hit.
[2025-06-03 08:12:49] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-03 08:12:49] [INFO ] Invariant cache hit.
[2025-06-03 08:12:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:12:49] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2025-06-03 08:12:49] [INFO ] Redundant transitions in 1 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-03 08:12:49] [INFO ] Invariant cache hit.
[2025-06-03 08:12:49] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 623ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 624ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 709 ms. Remains : 20/20 places, 28/28 transitions.
[2025-06-03 08:12:49] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:12:49] [INFO ] Flatten gal took : 4 ms
RANDOM walk for 40076 steps (8 resets) in 50 ms. (785 steps per ms) remains 2/2 properties
[2025-06-03 08:12:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17398866143746651287.gal : 7 ms
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
[2025-06-03 08:12:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3792031833297829444.prop : 6 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/ReachabilityCardinality17398866143746651287.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3792031833297829444.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/ReachabilityCardinality3792031833297829444.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
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
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 5.66311e+10
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5.66311e+10 after 1.14813e+11
Interrupted probabilistic random walk after 454542 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 2
Probabilistic random walk after 454542 steps, saw 308741 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
[2025-06-03 08:12:52] [INFO ] Invariant cache hit.
[2025-06-03 08:12:52] [INFO ] State equation strengthened by 8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-03 08:12:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 1 solved, 1 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 1 solved, 1 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 131ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2025-06-03 08:12:52] [INFO ] Invariant cache hit.
[2025-06-03 08:12:52] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 413ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 413ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 415 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40079 steps (8 resets) in 23 ms. (1669 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1690499 steps, run timeout after 3001 ms. (steps per millisecond=563 ) properties seen :0 out of 1
Probabilistic random walk after 1690499 steps, saw 1151216 distinct states, run finished after 3001 ms. (steps per millisecond=563 ) properties seen :0
[2025-06-03 08:12:56] [INFO ] Invariant cache hit.
[2025-06-03 08:12:56] [INFO ] State equation strengthened by 8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-03 08:12:56] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 0 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 0 solved, 1 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 194ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2025-06-03 08:12:56] [INFO ] Invariant cache hit.
[2025-06-03 08:12:56] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-03 08:12:56] [INFO ] Invariant cache hit.
[2025-06-03 08:12:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:12:56] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2025-06-03 08:12:56] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-03 08:12:56] [INFO ] Invariant cache hit.
[2025-06-03 08:12:56] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 657ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 657ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 742 ms. Remains : 20/20 places, 28/28 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 48 edges and 20 vertex of which 8 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 1 ms. Remains 8 /20 variables (removed 12) and now considering 12/28 (removed 16) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 12 rows 8 cols
[2025-06-03 08:12:57] [INFO ] Computed 1 invariants in 1 ms
[2025-06-03 08:12:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:12:57] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-03 08:12:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:12:57] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-03 08:12:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-03 08:12:57] [INFO ] After 11ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-03 08:12:57] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-03 08:12:57] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-03 08:12:57] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:12:57] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:12:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3697251556361364307.gal : 1 ms
[2025-06-03 08:12:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4824237749312261770.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/ReachabilityCardinality3697251556361364307.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4824237749312261770.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/ReachabilityCardinality4824237749312261770.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
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.00836e+09 after 1.01532e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.47892e+09 after 2.49454e+09
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.57255e+09 after 4.58937e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.48506e+10 after 1.4871e+10
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.14813e+11 after 4.52978e+11
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4.52978e+11 after 8.06626e+11
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.58847e+10 after 5.59122e+10
Detected timeout of ITS tools.
[2025-06-03 08:13:12] [INFO ] Flatten gal took : 4 ms
[2025-06-03 08:13:12] [INFO ] Applying decomposition
[2025-06-03 08:13:12] [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/graph676840335191052421.txt' '-o' '/tmp/graph676840335191052421.bin' '-w' '/tmp/graph676840335191052421.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph676840335191052421.bin' '-l' '-1' '-v' '-w' '/tmp/graph676840335191052421.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:13:12] [INFO ] Decomposing Gal with order
[2025-06-03 08:13:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:13:12] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:13:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 08:13:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4920625583699882760.gal : 1 ms
[2025-06-03 08:13:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3387133835664943154.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/ReachabilityCardinality4920625583699882760.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3387133835664943154.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/ReachabilityCardinality3387133835664943154.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 374408
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :374408 after 6.41708e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.01288e+10 after 1.02927e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.02927e+10 after 1.02927e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.02927e+10 after 1.02927e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.02927e+10 after 1.0306e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.0306e+10 after 1.0463e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.70011e+10 after 2.72802e+10
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30189 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-03 08:13:27] [INFO ] Flatten gal took : 3 ms
[2025-06-03 08:13:27] [INFO ] Applying decomposition
[2025-06-03 08:13:27] [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/graph17835932115582457917.txt' '-o' '/tmp/graph17835932115582457917.bin' '-w' '/tmp/graph17835932115582457917.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17835932115582457917.bin' '-l' '-1' '-v' '-w' '/tmp/graph17835932115582457917.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:13:27] [INFO ] Decomposing Gal with order
[2025-06-03 08:13:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:13:27] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:13:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 08:13:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17673603488380456811.gal : 1 ms
[2025-06-03 08:13:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7670398279842000227.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/ReachabilityCardinality17673603488380456811.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7670398279842000227.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/ReachabilityCardinality7670398279842000227.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 3.58931e+11
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.58931e+11 after 1.2637e+12
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.2637e+12 after 1.27099e+12
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.27099e+12 after 1.55135e+12
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.55135e+12 after 7.86735e+12
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[199] Max Struct:[204]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-05 in 92698 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-06
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:[204]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[204]
// Phase 1: matrix 28 rows 20 cols
[2025-06-03 08:14:17] [INFO ] Computed 1 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[204]
RANDOM walk for 10000 steps (2 resets) in 5 ms. (1666 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[109] Max Struct:[204]
[2025-06-03 08:14:17] [INFO ] Invariant cache hit.
[2025-06-03 08:14:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:14:17] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:14:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:14:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:14:17] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-03 08:14:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:14:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2025-06-03 08:14:17] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:14:17] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[109] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[185] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2025-06-03 08:14:17] [INFO ] Invariant cache hit.
[2025-06-03 08:14:17] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 580ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 580ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 584 ms. Remains : 20/20 places, 28/28 transitions.
[2025-06-03 08:14:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[185] Max Struct:[204]
RANDOM walk for 1000040 steps (2 resets) in 503 ms. (1984 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 484 ms. (2061 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[185] Max Struct:[204]
[2025-06-03 08:14:19] [INFO ] Invariant cache hit.
[2025-06-03 08:14:19] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:14:19] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-03 08:14:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:14:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:14:19] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:14:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:14:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2025-06-03 08:14:19] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:14:19] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[185] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2025-06-03 08:14:19] [INFO ] Invariant cache hit.
[2025-06-03 08:14:19] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-03 08:14:19] [INFO ] Invariant cache hit.
[2025-06-03 08:14:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:14:19] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2025-06-03 08:14:19] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-03 08:14:19] [INFO ] Invariant cache hit.
[2025-06-03 08:14:19] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 831ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 831ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 961 ms. Remains : 20/20 places, 28/28 transitions.
[2025-06-03 08:14:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[199] Max Struct:[204]
RANDOM walk for 1000018 steps (2 resets) in 410 ms. (2433 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 402 ms. (2481 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[199] Max Struct:[204]
[2025-06-03 08:14:21] [INFO ] Invariant cache hit.
[2025-06-03 08:14:21] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:14:21] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:14:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:14:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:14:21] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-03 08:14:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:14:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2025-06-03 08:14:21] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:14:21] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[199] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2025-06-03 08:14:21] [INFO ] Invariant cache hit.
[2025-06-03 08:14:21] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-03 08:14:21] [INFO ] Invariant cache hit.
[2025-06-03 08:14:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:14:21] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2025-06-03 08:14:21] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-03 08:14:21] [INFO ] Invariant cache hit.
[2025-06-03 08:14:21] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 674ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 675ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 756 ms. Remains : 20/20 places, 28/28 transitions.
[2025-06-03 08:14:22] [INFO ] Flatten gal took : 3 ms
[2025-06-03 08:14:22] [INFO ] Flatten gal took : 7 ms
[2025-06-03 08:14:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12619069720997638921.gal : 1 ms
[2025-06-03 08:14:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15647613812409637596.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/ReachabilityCardinality12619069720997638921.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15647613812409637596.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40076 steps (8 resets) in 65 ms. (607 steps per ms) remains 2/2 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/ReachabilityCardinality15647613812409637596.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 40003 steps (8 resets) in 47 ms. (833 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 40002 steps (8 resets) in 72 ms. (547 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 5.66311e+10
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5.66311e+10 after 1.14813e+11
Interrupted probabilistic random walk after 343771 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 2
Probabilistic random walk after 343771 steps, saw 233669 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
[2025-06-03 08:14:25] [INFO ] Invariant cache hit.
[2025-06-03 08:14:25] [INFO ] State equation strengthened by 8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-03 08:14:25] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 1 solved, 1 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 1 solved, 1 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 142ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2025-06-03 08:14:25] [INFO ] Invariant cache hit.
[2025-06-03 08:14:25] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 443ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 444ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 446 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40093 steps (8 resets) in 22 ms. (1743 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2188405 steps, run timeout after 3001 ms. (steps per millisecond=729 ) properties seen :0 out of 1
Probabilistic random walk after 2188405 steps, saw 1488561 distinct states, run finished after 3001 ms. (steps per millisecond=729 ) properties seen :0
[2025-06-03 08:14:29] [INFO ] Invariant cache hit.
[2025-06-03 08:14:29] [INFO ] State equation strengthened by 8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-03 08:14:29] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 0 solved, 1 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 0 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 159ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2025-06-03 08:14:29] [INFO ] Invariant cache hit.
[2025-06-03 08:14:29] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-03 08:14:29] [INFO ] Invariant cache hit.
[2025-06-03 08:14:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:14:29] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2025-06-03 08:14:29] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-03 08:14:29] [INFO ] Invariant cache hit.
[2025-06-03 08:14:29] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 462ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 465ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 544 ms. Remains : 20/20 places, 28/28 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 48 edges and 20 vertex of which 8 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 11 ms. Remains 8 /20 variables (removed 12) and now considering 12/28 (removed 16) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 12 rows 8 cols
[2025-06-03 08:14:29] [INFO ] Computed 1 invariants in 1 ms
[2025-06-03 08:14:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:14:29] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-03 08:14:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:14:29] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-03 08:14:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-03 08:14:29] [INFO ] After 4ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-03 08:14:29] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-03 08:14:29] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-03 08:14:29] [INFO ] Flatten gal took : 4 ms
[2025-06-03 08:14:29] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:14:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17233618087949476052.gal : 6 ms
[2025-06-03 08:14:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14818458721752235678.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/ReachabilityCardinality17233618087949476052.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14818458721752235678.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/ReachabilityCardinality14818458721752235678.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
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.00836e+09 after 1.01532e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.47892e+09 after 2.49454e+09
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.57255e+09 after 4.58937e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.48506e+10 after 1.4871e+10
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.14813e+11 after 4.52978e+11
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4.52978e+11 after 8.06626e+11
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.58847e+10 after 5.59122e+10
Detected timeout of ITS tools.
[2025-06-03 08:14:45] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:14:45] [INFO ] Applying decomposition
[2025-06-03 08:14:45] [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/graph1678554131388569435.txt' '-o' '/tmp/graph1678554131388569435.bin' '-w' '/tmp/graph1678554131388569435.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1678554131388569435.bin' '-l' '-1' '-v' '-w' '/tmp/graph1678554131388569435.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:14:45] [INFO ] Decomposing Gal with order
[2025-06-03 08:14:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:14:45] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:14:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 08:14:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6106750856501995120.gal : 1 ms
[2025-06-03 08:14:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality818666661165845567.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/ReachabilityCardinality6106750856501995120.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality818666661165845567.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 ...306
Loading property file /tmp/ReachabilityCardinality818666661165845567.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 374408
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :374408 after 6.41708e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.01288e+10 after 1.02955e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.02955e+10 after 1.02955e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.02955e+10 after 1.02955e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.02955e+10 after 1.02955e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.02955e+10 after 1.04631e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.70011e+10 after 2.72802e+10
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30193 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-03 08:15:00] [INFO ] Flatten gal took : 3 ms
[2025-06-03 08:15:00] [INFO ] Applying decomposition
[2025-06-03 08:15:00] [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/graph5023607881716955955.txt' '-o' '/tmp/graph5023607881716955955.bin' '-w' '/tmp/graph5023607881716955955.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5023607881716955955.bin' '-l' '-1' '-v' '-w' '/tmp/graph5023607881716955955.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:15:00] [INFO ] Decomposing Gal with order
[2025-06-03 08:15:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:15:00] [INFO ] Flatten gal took : 3 ms
[2025-06-03 08:15:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 08:15:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4323842924368372912.gal : 1 ms
[2025-06-03 08:15:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality997868925214966882.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/ReachabilityCardinality4323842924368372912.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality997868925214966882.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 ...306
Loading property file /tmp/ReachabilityCardinality997868925214966882.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 3.56207e+11
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.56207e+11 after 2.91889e+12
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.91889e+12 after 7.12031e+12
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[199] Max Struct:[204]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-06 in 92531 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-07
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 28 rows 20 cols
[2025-06-03 08:15:50] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10050 steps (2 resets) in 6 ms. (1435 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:15:50] [INFO ] Invariant cache hit.
[2025-06-03 08:15:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:15:50] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:15:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:15:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:15:50] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:15:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:15:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2025-06-03 08:15:50] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:15:50] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 7 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 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 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 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:15:50] [INFO ] Computed 0 invariants in 0 ms
[2025-06-03 08:15: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 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 68 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 135ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 3/20 places, 4/28 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 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:15: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 498 ms. (2004 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 365 ms. (2732 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:15:51] [INFO ] Invariant cache hit.
[2025-06-03 08:15:51] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-03 08:15:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:15:51] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:15:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:15:51] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-03 08:15:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:15:51] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:15:51] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 4 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 2 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:15:51] [INFO ] Invariant cache hit.
[2025-06-03 08:15:51] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-03 08:15:51] [INFO ] Invariant cache hit.
[2025-06-03 08:15:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:15:51] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2025-06-03 08:15:51] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:15:51] [INFO ] Invariant cache hit.
[2025-06-03 08:15: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 57 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 152ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 153ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222 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 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:15:51] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:15:51] [INFO ] Flatten gal took : 0 ms
[2025-06-03 08:15:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9513363344414803739.gal : 1 ms
[2025-06-03 08:15:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16697527006484148458.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/ReachabilityCardinality9513363344414803739.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16697527006484148458.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/ReachabilityCardinality16697527006484148458.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.004334,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.004715,3812,1,0,5,44,7,0,25,26,0
RANDOM walk for 40002 steps (8 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 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 6 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-D3N050-UpperBounds-07 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-D3N050-UpperBounds-07 in 1666 ms.
Starting property specific reduction for Murphy-PT-D3N050-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 28 rows 20 cols
[2025-06-03 08:15:51] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10022 steps (2 resets) in 6 ms. (1431 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:15:51] [INFO ] Invariant cache hit.
[2025-06-03 08:15:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:15:51] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:15:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:15:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:15:51] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:15:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:15:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:15:51] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:15:51] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 10 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 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 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 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:15:52] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 08:15: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 53 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 42 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 3/20 places, 4/28 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 :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:15:52] [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 290 ms. (3436 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 208 ms. (4784 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:15:52] [INFO ] Invariant cache hit.
[2025-06-03 08:15:52] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-03 08:15:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:15:52] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:15:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:15:52] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-03 08:15:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:15:52] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:15:52] [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 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:15:52] [INFO ] Invariant cache hit.
[2025-06-03 08:15:52] [INFO ] Implicit Places using invariants in 13 ms returned []
[2025-06-03 08:15:52] [INFO ] Invariant cache hit.
[2025-06-03 08:15:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:15:52] [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:15:52] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:15:52] [INFO ] Invariant cache hit.
[2025-06-03 08:15: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 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 42 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 87ms
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:15:52] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:15:52] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 40000 steps (8 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
[2025-06-03 08:15:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12569811015833614279.gal : 5 ms
[2025-06-03 08:15:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13837852376122644321.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/ReachabilityCardinality12569811015833614279.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13837852376122644321.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40001 steps (8 resets) in 18 ms. (2105 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/ReachabilityCardinality13837852376122644321.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.002482,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.002709,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 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-D3N050-UpperBounds-08 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-D3N050-UpperBounds-08 in 1017 ms.
Starting property specific reduction for Murphy-PT-D3N050-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 28 rows 20 cols
[2025-06-03 08:15:52] [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 5 ms. (1666 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:15:52] [INFO ] Invariant cache hit.
[2025-06-03 08:15:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:15:52] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:15:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:15:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:15:52] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:15:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:15:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:15:52] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:15:52] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 10 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 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 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 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:15:52] [INFO ] Computed 0 invariants in 0 ms
[2025-06-03 08:15: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 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 51 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 115ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 3/20 places, 4/28 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:15:53] [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 351 ms. (2840 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 364 ms. (2739 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:15:53] [INFO ] Invariant cache hit.
[2025-06-03 08:15:53] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-03 08:15:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:15:53] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:15:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:15:53] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-03 08:15:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:15:53] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:15:53] [INFO ] Added : 3 causal constraints over 1 iterations in 5 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:15:53] [INFO ] Invariant cache hit.
[2025-06-03 08:15:53] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-03 08:15:53] [INFO ] Invariant cache hit.
[2025-06-03 08:15:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:15:53] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2025-06-03 08:15:53] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:15:53] [INFO ] Invariant cache hit.
[2025-06-03 08:15: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 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 47 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 110ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 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:15:54] [INFO ] Flatten gal took : 0 ms
RANDOM walk for 40000 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
[2025-06-03 08:15:54] [INFO ] Flatten gal took : 7 ms
[2025-06-03 08:15:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4560409209879004909.gal : 1 ms
[2025-06-03 08:15:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7186075971950661900.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/ReachabilityCardinality4560409209879004909.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7186075971950661900.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/ReachabilityCardinality7186075971950661900.prop.
BEST_FIRST walk for 40001 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
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.00319,3808,2,8,5,44,7,0,24,26,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 is true.

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
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.003528,3808,1,0,5,44,7,0,25,26,0
ITS runner timed out or was interrupted.
FORMULA Murphy-PT-D3N050-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-D3N050-UpperBounds-10 in 1248 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-11
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 28 rows 20 cols
[2025-06-03 08:15:54] [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 5 ms. (1666 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:15:54] [INFO ] Invariant cache hit.
[2025-06-03 08:15:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:15:54] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:15:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:15:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:15:54] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:15:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:15:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:15:54] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:15:54] [INFO ] Added : 2 causal constraints over 1 iterations in 13 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 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 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 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:15:54] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 08:15:54] [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 37 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 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 83 ms. Remains : 3/20 places, 4/28 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 :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:15:54] [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 265 ms. (3759 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 366 ms. (2724 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:15:55] [INFO ] Invariant cache hit.
[2025-06-03 08:15:55] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-03 08:15:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:15:55] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:15:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:15:55] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-03 08:15:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:15:55] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:15:55] [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 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:15:55] [INFO ] Invariant cache hit.
[2025-06-03 08:15:55] [INFO ] Implicit Places using invariants in 14 ms returned []
[2025-06-03 08:15:55] [INFO ] Invariant cache hit.
[2025-06-03 08:15:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:15:55] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2025-06-03 08:15:55] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:15:55] [INFO ] Invariant cache hit.
[2025-06-03 08:15:55] [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 47 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 44 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 97ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 97ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 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:15:55] [INFO ] Flatten gal took : 6 ms
[2025-06-03 08:15:55] [INFO ] Flatten gal took : 0 ms
[2025-06-03 08:15:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12479929018583956374.gal : 1 ms
[2025-06-03 08:15:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5376666699458654155.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/ReachabilityCardinality12479929018583956374.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5376666699458654155.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/ReachabilityCardinality5376666699458654155.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.002897,3812,2,8,5,44,7,0,24,26,0
Total reachable state count : 6

Verifying 1 reachability properties.
RANDOM walk for 40001 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 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.00327,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 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-D3N050-UpperBounds-11 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-D3N050-UpperBounds-11 in 1154 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-13
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 28 rows 20 cols
[2025-06-03 08:15:55] [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 6 ms. (1428 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:15:55] [INFO ] Invariant cache hit.
[2025-06-03 08:15:55] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:15:55] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:15:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:15:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:15:55] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:15:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:15:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:15:55] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:15:55] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 12 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 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 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 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:15:55] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 08:15:55] [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 59 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 123ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 123ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 3/20 places, 4/28 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:15:55] [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 466 ms. (2141 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 373 ms. (2673 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:15:56] [INFO ] Invariant cache hit.
[2025-06-03 08:15:56] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-03 08:15:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:15:56] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:15:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:15:56] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-03 08:15:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:15:56] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-03 08:15:56] [INFO ] Added : 3 causal constraints over 1 iterations in 5 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 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2025-06-03 08:15:56] [INFO ] Invariant cache hit.
[2025-06-03 08:15:56] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-03 08:15:56] [INFO ] Invariant cache hit.
[2025-06-03 08:15:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:15:56] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2025-06-03 08:15:56] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:15:56] [INFO ] Invariant cache hit.
[2025-06-03 08:15:56] [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 55 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 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 171 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:15:56] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:15:56] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:15:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10999641180708418382.gal : 1 ms
[2025-06-03 08:15:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8406279631431369203.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/ReachabilityCardinality10999641180708418382.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8406279631431369203.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/ReachabilityCardinality8406279631431369203.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.002095,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.002296,3808,1,0,5,44,7,0,25,26,0
RANDOM walk for 40000 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 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-D3N050-UpperBounds-13 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-D3N050-UpperBounds-13 in 1449 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-14
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:[204]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[204]
// Phase 1: matrix 28 rows 20 cols
[2025-06-03 08:15:56] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[204]
RANDOM walk for 10003 steps (2 resets) in 6 ms. (1429 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[61] Max Struct:[204]
[2025-06-03 08:15:56] [INFO ] Invariant cache hit.
[2025-06-03 08:15:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:15:56] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-03 08:15:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:15:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:15:56] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:15:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:15:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:15:56] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:15:56] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[61] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[197] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2025-06-03 08:15:56] [INFO ] Invariant cache hit.
[2025-06-03 08:15:56] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 705ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 705ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 707 ms. Remains : 20/20 places, 28/28 transitions.
[2025-06-03 08:15:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[197] Max Struct:[204]
RANDOM walk for 1000014 steps (2 resets) in 706 ms. (1414 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 439 ms. (2272 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[197] Max Struct:[204]
[2025-06-03 08:15:58] [INFO ] Invariant cache hit.
[2025-06-03 08:15:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:15:58] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:15:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:15:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-03 08:15:58] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:15:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:15:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:15:58] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:15:58] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[197] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[197] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2025-06-03 08:15:58] [INFO ] Invariant cache hit.
[2025-06-03 08:15:58] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-03 08:15:58] [INFO ] Invariant cache hit.
[2025-06-03 08:15:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:15:59] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2025-06-03 08:15:59] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-03 08:15:59] [INFO ] Invariant cache hit.
[2025-06-03 08:15:59] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 790ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 791ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 874 ms. Remains : 20/20 places, 28/28 transitions.
[2025-06-03 08:15:59] [INFO ] Flatten gal took : 3 ms
[2025-06-03 08:15:59] [INFO ] Flatten gal took : 3 ms
[2025-06-03 08:15:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14709613796242954063.gal : 6 ms
[2025-06-03 08:15:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5094318229936284725.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/ReachabilityCardinality14709613796242954063.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5094318229936284725.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/ReachabilityCardinality5094318229936284725.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 40091 steps (8 resets) in 93 ms. (426 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 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 39 ms. (1000 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 5.66311e+10
Interrupted probabilistic random walk after 314081 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 2
Probabilistic random walk after 314081 steps, saw 213613 distinct states, run finished after 3002 ms. (steps per millisecond=104 ) properties seen :0
[2025-06-03 08:16:02] [INFO ] Invariant cache hit.
[2025-06-03 08:16:02] [INFO ] State equation strengthened by 8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
[2025-06-03 08:16:02] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
SDD size :5.66311e+10 after 1.14813e+11
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 1 solved, 1 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 1 solved, 1 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 118ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2025-06-03 08:16:03] [INFO ] Invariant cache hit.
[2025-06-03 08:16:03] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 430ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 431ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 432 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40129 steps (8 resets) in 22 ms. (1744 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2233875 steps, run timeout after 3001 ms. (steps per millisecond=744 ) properties seen :0 out of 1
Probabilistic random walk after 2233875 steps, saw 1520128 distinct states, run finished after 3002 ms. (steps per millisecond=744 ) properties seen :0
[2025-06-03 08:16:06] [INFO ] Invariant cache hit.
[2025-06-03 08:16:06] [INFO ] State equation strengthened by 8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-03 08:16:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 0 solved, 1 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 0 solved, 1 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 132ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 300 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=300 )
Parikh walk visited 1 properties in 12 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:[197] Max Struct:[204]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-14 in 9941 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-15
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]
[2025-06-03 08:16:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10038 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:[2] Max Struct:[+inf]
[2025-06-03 08:16:06] [INFO ] Invariant cache hit.
[2025-06-03 08:16:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:16:06] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:16:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:16:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:16:06] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:16:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:16:06] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:16:06] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:16:06] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 8 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 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 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 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:16:06] [INFO ] Computed 0 invariants in 0 ms
[2025-06-03 08:16:06] [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 41 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 89 ms. Remains : 3/20 places, 4/28 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 :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:16:06] [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 337 ms. (2958 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 213 ms. (4672 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:16:07] [INFO ] Invariant cache hit.
[2025-06-03 08:16:07] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-03 08:16:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:16:07] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:16:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:16:07] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-03 08:16:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:16:07] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:16:07] [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 5 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 5 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:16:07] [INFO ] Invariant cache hit.
[2025-06-03 08:16:07] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-03 08:16:07] [INFO ] Invariant cache hit.
[2025-06-03 08:16:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:16:07] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2025-06-03 08:16:07] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:16:07] [INFO ] Invariant cache hit.
[2025-06-03 08:16:07] [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 52 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 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 150 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 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:16:07] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:16:07] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:16:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5812722713602686523.gal : 1 ms
[2025-06-03 08:16:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16324702424623177053.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/ReachabilityCardinality5812722713602686523.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16324702424623177053.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/ReachabilityCardinality16324702424623177053.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.00447,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.004859,3808,1,0,5,44,7,0,25,26,0
RANDOM walk for 40000 steps (8 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 62 ms. (634 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-D3N050-UpperBounds-15 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-D3N050-UpperBounds-15 in 1104 ms.
[2025-06-03 08:16:07] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:16:07] [INFO ] Applying decomposition
[2025-06-03 08:16:07] [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/graph16527858830279059784.txt' '-o' '/tmp/graph16527858830279059784.bin' '-w' '/tmp/graph16527858830279059784.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16527858830279059784.bin' '-l' '-1' '-v' '-w' '/tmp/graph16527858830279059784.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:16:07] [INFO ] Decomposing Gal with order
[2025-06-03 08:16:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:16:07] [INFO ] Flatten gal took : 3 ms
[2025-06-03 08:16:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 08:16:07] [INFO ] Time to serialize gal into /tmp/UpperBounds13891412175483163096.gal : 2 ms
[2025-06-03 08:16:07] [INFO ] Time to serialize properties into /tmp/UpperBounds12557018661381904630.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/UpperBounds13891412175483163096.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12557018661381904630.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 ...285
Loading property file /tmp/UpperBounds12557018661381904630.prop.
Detected timeout of ITS tools.
[2025-06-03 08:37:43] [INFO ] Flatten gal took : 4 ms
[2025-06-03 08:37:43] [INFO ] Time to serialize gal into /tmp/UpperBounds14770546380516555728.gal : 2 ms
[2025-06-03 08:37:43] [INFO ] Time to serialize properties into /tmp/UpperBounds15785147508081813836.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/UpperBounds14770546380516555728.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15785147508081813836.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 ...306
Loading property file /tmp/UpperBounds15785147508081813836.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,5.4071e+14,74.9025,716912,2,7445,5,2.50568e+06,6,0,139,2.74917e+06,0
Total reachable state count : 540710084330928

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 199
Bounds property Murphy-PT-D3N050-UpperBounds-05 :0 <= p1_1 <= 199
FORMULA Murphy-PT-D3N050-UpperBounds-05 199 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-D3N050-UpperBounds-05,0,75.2492,716912,1,0,7,2.50568e+06,9,1,396,2.74917e+06,4
Min sum of variable value : 0
Maximum sum along a path : 199
Bounds property Murphy-PT-D3N050-UpperBounds-06 :0 <= p1_4 <= 199
FORMULA Murphy-PT-D3N050-UpperBounds-06 199 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-D3N050-UpperBounds-06,0,75.2516,716912,1,0,8,2.50568e+06,10,1,605,2.74917e+06,5
Min sum of variable value : 0
Maximum sum along a path : 199
Bounds property Murphy-PT-D3N050-UpperBounds-14 :0 <= p1_2 <= 199
FORMULA Murphy-PT-D3N050-UpperBounds-14 199 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-D3N050-UpperBounds-14,0,75.5276,716912,1,0,9,2.50568e+06,11,1,834,2.74917e+06,6
Total runtime 1658520 ms.

BK_STOP 1748939938699

--------------------
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-D3N050"
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-D3N050, 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-174876533200075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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