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.r041-smll-174853822500033.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 CANInsertWithFailure-PT-010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-smll-174853822500033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 698K 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 CANInsertWithFailure-PT-010-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748547890362

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 19:44:52] [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-05-29 19:44:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:44:52] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2025-05-29 19:44:52] [INFO ] Transformed 324 places.
[2025-05-29 19:44:52] [INFO ] Transformed 660 transitions.
[2025-05-29 19:44:52] [INFO ] Parsed PT model containing 324 places and 660 transitions and 1800 arcs in 433 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 660 rows 324 cols
[2025-05-29 19:44:52] [INFO ] Computed 13 invariants in 46 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 10, 1, 1, 1, 1, 10, 10, 10, 10, 10, 10, 10, 10, 10]
RANDOM walk for 10000 steps (45 resets) in 66 ms. (149 steps per ms)
FORMULA CANInsertWithFailure-PT-010-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100008 steps (50 resets) in 128 ms. (775 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 6] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
[2025-05-29 19:44:53] [INFO ] Invariant cache hit.
[2025-05-29 19:44:53] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2025-05-29 19:44:53] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:44:53] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2025-05-29 19:44:54] [INFO ] State equation strengthened by 190 read => feed constraints.
[2025-05-29 19:44:54] [INFO ] [Real]Added 190 Read/Feed constraints in 81 ms returned sat
[2025-05-29 19:44:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:44:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2025-05-29 19:44:54] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 12 ms returned sat
[2025-05-29 19:44:54] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2025-05-29 19:44:55] [INFO ] [Nat]Added 190 Read/Feed constraints in 156 ms returned sat
[2025-05-29 19:44:55] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 112 ms.
[2025-05-29 19:44:55] [INFO ] Added : 47 causal constraints over 10 iterations in 836 ms. Result :sat
Minimization took 563 ms.
[2025-05-29 19:44:56] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2025-05-29 19:44:56] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:44:56] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2025-05-29 19:44:57] [INFO ] [Real]Added 190 Read/Feed constraints in 38 ms returned sat
[2025-05-29 19:44:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:44:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2025-05-29 19:44:57] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:44:57] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2025-05-29 19:44:57] [INFO ] [Nat]Added 190 Read/Feed constraints in 213 ms returned sat
[2025-05-29 19:44:57] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 105 ms.
[2025-05-29 19:44:58] [INFO ] Added : 45 causal constraints over 9 iterations in 706 ms. Result :sat
Minimization took 558 ms.
[2025-05-29 19:44:59] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2025-05-29 19:44:59] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-29 19:44:59] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2025-05-29 19:44:59] [INFO ] [Real]Added 190 Read/Feed constraints in 36 ms returned sat
[2025-05-29 19:44:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:44:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-05-29 19:44:59] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-29 19:45:00] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2025-05-29 19:45:00] [INFO ] [Nat]Added 190 Read/Feed constraints in 130 ms returned sat
[2025-05-29 19:45:00] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 106 ms.
[2025-05-29 19:45:01] [INFO ] Added : 57 causal constraints over 12 iterations in 842 ms. Result :sat
Minimization took 572 ms.
[2025-05-29 19:45:01] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2025-05-29 19:45:01] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:45:02] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2025-05-29 19:45:02] [INFO ] [Real]Added 190 Read/Feed constraints in 44 ms returned sat
[2025-05-29 19:45:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2025-05-29 19:45:02] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 19:45:02] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2025-05-29 19:45:02] [INFO ] [Nat]Added 190 Read/Feed constraints in 76 ms returned sat
[2025-05-29 19:45:02] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 80 ms.
[2025-05-29 19:45:03] [INFO ] Added : 38 causal constraints over 8 iterations in 468 ms. Result :sat
Minimization took 558 ms.
[2025-05-29 19:45:03] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2025-05-29 19:45:03] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:45:03] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2025-05-29 19:45:03] [INFO ] [Real]Added 190 Read/Feed constraints in 35 ms returned sat
[2025-05-29 19:45:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-05-29 19:45:04] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:45:04] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2025-05-29 19:45:04] [INFO ] [Nat]Added 190 Read/Feed constraints in 96 ms returned sat
[2025-05-29 19:45:04] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 85 ms.
[2025-05-29 19:45:05] [INFO ] Added : 29 causal constraints over 6 iterations in 478 ms. Result :sat
Minimization took 577 ms.
[2025-05-29 19:45:05] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-05-29 19:45:05] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:45:06] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2025-05-29 19:45:06] [INFO ] [Real]Added 190 Read/Feed constraints in 29 ms returned sat
[2025-05-29 19:45:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-05-29 19:45:06] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 19:45:06] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2025-05-29 19:45:06] [INFO ] [Nat]Added 190 Read/Feed constraints in 113 ms returned sat
[2025-05-29 19:45:06] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 78 ms.
[2025-05-29 19:45:07] [INFO ] Added : 46 causal constraints over 10 iterations in 549 ms. Result :sat
Minimization took 512 ms.
[2025-05-29 19:45:07] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2025-05-29 19:45:07] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 19:45:08] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2025-05-29 19:45:08] [INFO ] [Real]Added 190 Read/Feed constraints in 34 ms returned sat
[2025-05-29 19:45:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2025-05-29 19:45:08] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-29 19:45:08] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2025-05-29 19:45:08] [INFO ] [Nat]Added 190 Read/Feed constraints in 104 ms returned sat
[2025-05-29 19:45:08] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 54 ms.
[2025-05-29 19:45:09] [INFO ] Added : 55 causal constraints over 11 iterations in 627 ms. Result :sat
Minimization took 582 ms.
[2025-05-29 19:45:09] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2025-05-29 19:45:09] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:45:10] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2025-05-29 19:45:10] [INFO ] [Real]Added 190 Read/Feed constraints in 34 ms returned sat
[2025-05-29 19:45:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2025-05-29 19:45:10] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:45:10] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2025-05-29 19:45:10] [INFO ] [Nat]Added 190 Read/Feed constraints in 85 ms returned sat
[2025-05-29 19:45:10] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 50 ms.
[2025-05-29 19:45:11] [INFO ] Added : 37 causal constraints over 8 iterations in 371 ms. Result :sat
Minimization took 524 ms.
[2025-05-29 19:45:11] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2025-05-29 19:45:11] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-29 19:45:12] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2025-05-29 19:45:12] [INFO ] [Real]Added 190 Read/Feed constraints in 30 ms returned sat
[2025-05-29 19:45:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-05-29 19:45:12] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:45:12] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2025-05-29 19:45:12] [INFO ] [Nat]Added 190 Read/Feed constraints in 138 ms returned sat
[2025-05-29 19:45:12] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 84 ms.
[2025-05-29 19:45:13] [INFO ] Added : 36 causal constraints over 8 iterations in 571 ms. Result :sat
Minimization took 570 ms.
[2025-05-29 19:45:13] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-05-29 19:45:13] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:45:14] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2025-05-29 19:45:14] [INFO ] [Real]Added 190 Read/Feed constraints in 51 ms returned sat
[2025-05-29 19:45:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2025-05-29 19:45:14] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:45:14] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2025-05-29 19:45:15] [INFO ] [Nat]Added 190 Read/Feed constraints in 220 ms returned sat
[2025-05-29 19:45:15] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 85 ms.
[2025-05-29 19:45:16] [INFO ] Added : 83 causal constraints over 17 iterations in 1064 ms. Result :sat
Minimization took 553 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 6] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 6] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Support contains 10 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 660/660 transitions.
Graph (complete) has 951 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 323 transition count 591
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 254 transition count 590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 141 place count 253 transition count 590
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 283 place count 182 transition count 519
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 3 with 53 rules applied. Total rules applied 336 place count 182 transition count 466
Partial Free-agglomeration rule applied 131 times.
Drop transitions (Partial Free agglomeration) removed 131 transitions
Iterating global reduction 3 with 131 rules applied. Total rules applied 467 place count 182 transition count 466
Applied a total of 467 rules in 274 ms. Remains 182 /324 variables (removed 142) and now considering 466/660 (removed 194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 182/324 places, 466/660 transitions.
// Phase 1: matrix 466 rows 182 cols
[2025-05-29 19:45:17] [INFO ] Computed 12 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 6] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
RANDOM walk for 1000000 steps (16924 resets) in 3225 ms. (309 steps per ms)
BEST_FIRST walk for 10000009 steps (15348 resets) in 6518 ms. (1533 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 9] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
[2025-05-29 19:45:26] [INFO ] Invariant cache hit.
[2025-05-29 19:45:26] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 19:45:26] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-29 19:45:27] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2025-05-29 19:45:27] [INFO ] State equation strengthened by 377 read => feed constraints.
[2025-05-29 19:45:27] [INFO ] [Real]Added 377 Read/Feed constraints in 65 ms returned sat
[2025-05-29 19:45:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 19:45:27] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 19:45:27] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2025-05-29 19:45:27] [INFO ] [Nat]Added 377 Read/Feed constraints in 67 ms returned sat
[2025-05-29 19:45:27] [INFO ] Computed and/alt/rep : 323/952/323 causal constraints (skipped 133 transitions) in 54 ms.
[2025-05-29 19:45:27] [INFO ] Added : 13 causal constraints over 3 iterations in 211 ms. Result :sat
Minimization took 501 ms.
[2025-05-29 19:45:28] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-29 19:45:28] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:45:28] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2025-05-29 19:45:28] [INFO ] [Real]Added 377 Read/Feed constraints in 42 ms returned sat
[2025-05-29 19:45:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-29 19:45:28] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:45:28] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2025-05-29 19:45:28] [INFO ] [Nat]Added 377 Read/Feed constraints in 50 ms returned sat
[2025-05-29 19:45:28] [INFO ] Computed and/alt/rep : 323/952/323 causal constraints (skipped 133 transitions) in 37 ms.
[2025-05-29 19:45:29] [INFO ] Added : 8 causal constraints over 2 iterations in 126 ms. Result :sat
Minimization took 475 ms.
[2025-05-29 19:45:29] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 19:45:29] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-29 19:45:29] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2025-05-29 19:45:29] [INFO ] [Real]Added 377 Read/Feed constraints in 62 ms returned sat
[2025-05-29 19:45:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 19:45:29] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-29 19:45:30] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2025-05-29 19:45:30] [INFO ] [Nat]Added 377 Read/Feed constraints in 133 ms returned sat
[2025-05-29 19:45:30] [INFO ] Computed and/alt/rep : 323/952/323 causal constraints (skipped 133 transitions) in 58 ms.
[2025-05-29 19:45:30] [INFO ] Added : 13 causal constraints over 3 iterations in 236 ms. Result :sat
Minimization took 645 ms.
[2025-05-29 19:45:31] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-29 19:45:31] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:45:31] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2025-05-29 19:45:31] [INFO ] [Real]Added 377 Read/Feed constraints in 45 ms returned sat
[2025-05-29 19:45:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 19:45:31] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 19:45:31] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2025-05-29 19:45:31] [INFO ] [Nat]Added 377 Read/Feed constraints in 91 ms returned sat
[2025-05-29 19:45:31] [INFO ] Computed and/alt/rep : 323/952/323 causal constraints (skipped 133 transitions) in 52 ms.
[2025-05-29 19:45:32] [INFO ] Added : 18 causal constraints over 4 iterations in 254 ms. Result :sat
Minimization took 814 ms.
[2025-05-29 19:45:33] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 19:45:33] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 19:45:33] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2025-05-29 19:45:33] [INFO ] [Real]Added 377 Read/Feed constraints in 56 ms returned sat
[2025-05-29 19:45:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 19:45:33] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 19:45:33] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2025-05-29 19:45:33] [INFO ] [Nat]Added 377 Read/Feed constraints in 76 ms returned sat
[2025-05-29 19:45:33] [INFO ] Computed and/alt/rep : 323/952/323 causal constraints (skipped 133 transitions) in 40 ms.
[2025-05-29 19:45:33] [INFO ] Added : 10 causal constraints over 2 iterations in 129 ms. Result :sat
Minimization took 461 ms.
[2025-05-29 19:45:34] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-29 19:45:34] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 19:45:34] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2025-05-29 19:45:34] [INFO ] [Real]Added 377 Read/Feed constraints in 43 ms returned sat
[2025-05-29 19:45:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 19:45:34] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 19:45:34] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2025-05-29 19:45:34] [INFO ] [Nat]Added 377 Read/Feed constraints in 53 ms returned sat
[2025-05-29 19:45:34] [INFO ] Computed and/alt/rep : 323/952/323 causal constraints (skipped 133 transitions) in 36 ms.
[2025-05-29 19:45:34] [INFO ] Added : 12 causal constraints over 3 iterations in 148 ms. Result :sat
Minimization took 584 ms.
[2025-05-29 19:45:35] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-29 19:45:35] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:45:35] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2025-05-29 19:45:35] [INFO ] [Real]Added 377 Read/Feed constraints in 40 ms returned sat
[2025-05-29 19:45:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-29 19:45:35] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:45:35] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2025-05-29 19:45:35] [INFO ] [Nat]Added 377 Read/Feed constraints in 58 ms returned sat
[2025-05-29 19:45:36] [INFO ] Computed and/alt/rep : 323/952/323 causal constraints (skipped 133 transitions) in 57 ms.
[2025-05-29 19:45:36] [INFO ] Added : 8 causal constraints over 2 iterations in 241 ms. Result :sat
Minimization took 688 ms.
[2025-05-29 19:45:37] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 19:45:37] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:45:37] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2025-05-29 19:45:37] [INFO ] [Real]Added 377 Read/Feed constraints in 50 ms returned sat
[2025-05-29 19:45:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 19:45:37] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:45:37] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2025-05-29 19:45:37] [INFO ] [Nat]Added 377 Read/Feed constraints in 77 ms returned sat
[2025-05-29 19:45:37] [INFO ] Computed and/alt/rep : 323/952/323 causal constraints (skipped 133 transitions) in 52 ms.
[2025-05-29 19:45:37] [INFO ] Added : 11 causal constraints over 3 iterations in 228 ms. Result :sat
Minimization took 759 ms.
[2025-05-29 19:45:38] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 19:45:38] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 19:45:38] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2025-05-29 19:45:38] [INFO ] [Real]Added 377 Read/Feed constraints in 62 ms returned sat
[2025-05-29 19:45:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 19:45:39] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-29 19:45:39] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2025-05-29 19:45:39] [INFO ] [Nat]Added 377 Read/Feed constraints in 85 ms returned sat
[2025-05-29 19:45:39] [INFO ] Computed and/alt/rep : 323/952/323 causal constraints (skipped 133 transitions) in 56 ms.
[2025-05-29 19:45:39] [INFO ] Added : 10 causal constraints over 2 iterations in 193 ms. Result :sat
Minimization took 589 ms.
[2025-05-29 19:45:40] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 19:45:40] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 19:45:40] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2025-05-29 19:45:40] [INFO ] [Real]Added 377 Read/Feed constraints in 64 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 9] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 9]
FORMULA CANInsertWithFailure-PT-010-UpperBounds-15 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10]
Support contains 9 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 466/466 transitions.
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 25 place count 182 transition count 466
Applied a total of 25 rules in 48 ms. Remains 182 /182 variables (removed 0) and now considering 466/466 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 182/182 places, 466/466 transitions.
// Phase 1: matrix 466 rows 182 cols
[2025-05-29 19:45:40] [INFO ] Computed 12 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10]
RANDOM walk for 1000000 steps (17351 resets) in 3192 ms. (313 steps per ms)
BEST_FIRST walk for 9000008 steps (15031 resets) in 6111 ms. (1472 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10]
[2025-05-29 19:45:49] [INFO ] Invariant cache hit.
[2025-05-29 19:45:50] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 19:45:50] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-29 19:45:50] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2025-05-29 19:45:50] [INFO ] State equation strengthened by 402 read => feed constraints.
[2025-05-29 19:45:50] [INFO ] [Real]Added 402 Read/Feed constraints in 69 ms returned sat
[2025-05-29 19:45:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 19:45:50] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 19:45:50] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2025-05-29 19:45:50] [INFO ] [Nat]Added 402 Read/Feed constraints in 107 ms returned sat
[2025-05-29 19:45:50] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 55 ms.
[2025-05-29 19:45:51] [INFO ] Added : 11 causal constraints over 3 iterations in 239 ms. Result :sat
Minimization took 629 ms.
[2025-05-29 19:45:51] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 19:45:51] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-29 19:45:52] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2025-05-29 19:45:52] [INFO ] [Real]Added 402 Read/Feed constraints in 70 ms returned sat
[2025-05-29 19:45:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 19:45:52] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-29 19:45:52] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2025-05-29 19:45:52] [INFO ] [Nat]Added 402 Read/Feed constraints in 83 ms returned sat
[2025-05-29 19:45:52] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 33 ms.
[2025-05-29 19:45:52] [INFO ] Added : 3 causal constraints over 1 iterations in 119 ms. Result :sat
Minimization took 660 ms.
[2025-05-29 19:45:53] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 19:45:53] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:45:53] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2025-05-29 19:45:53] [INFO ] [Real]Added 402 Read/Feed constraints in 46 ms returned sat
[2025-05-29 19:45:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-29 19:45:53] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-29 19:45:53] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2025-05-29 19:45:53] [INFO ] [Nat]Added 402 Read/Feed constraints in 80 ms returned sat
[2025-05-29 19:45:53] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 41 ms.
[2025-05-29 19:45:54] [INFO ] Added : 9 causal constraints over 2 iterations in 172 ms. Result :sat
Minimization took 586 ms.
[2025-05-29 19:45:54] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 19:45:54] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-29 19:45:54] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2025-05-29 19:45:54] [INFO ] [Real]Added 402 Read/Feed constraints in 58 ms returned sat
[2025-05-29 19:45:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 19:45:55] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 19:45:55] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2025-05-29 19:45:55] [INFO ] [Nat]Added 402 Read/Feed constraints in 73 ms returned sat
[2025-05-29 19:45:55] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 51 ms.
[2025-05-29 19:45:55] [INFO ] Added : 8 causal constraints over 2 iterations in 193 ms. Result :sat
Minimization took 622 ms.
[2025-05-29 19:45:56] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 19:45:56] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 19:45:56] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2025-05-29 19:45:56] [INFO ] [Real]Added 402 Read/Feed constraints in 53 ms returned sat
[2025-05-29 19:45:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 19:45:56] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 19:45:56] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2025-05-29 19:45:56] [INFO ] [Nat]Added 402 Read/Feed constraints in 79 ms returned sat
[2025-05-29 19:45:56] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 54 ms.
[2025-05-29 19:45:57] [INFO ] Added : 9 causal constraints over 2 iterations in 202 ms. Result :sat
Minimization took 743 ms.
[2025-05-29 19:45:57] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 19:45:57] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 19:45:58] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2025-05-29 19:45:58] [INFO ] [Real]Added 402 Read/Feed constraints in 68 ms returned sat
[2025-05-29 19:45:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 19:45:58] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-29 19:45:58] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2025-05-29 19:45:58] [INFO ] [Nat]Added 402 Read/Feed constraints in 79 ms returned sat
[2025-05-29 19:45:58] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 39 ms.
[2025-05-29 19:45:58] [INFO ] Added : 11 causal constraints over 3 iterations in 199 ms. Result :sat
Minimization took 675 ms.
[2025-05-29 19:45:59] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 19:45:59] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 19:45:59] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2025-05-29 19:45:59] [INFO ] [Real]Added 402 Read/Feed constraints in 69 ms returned sat
[2025-05-29 19:45:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 19:45:59] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-29 19:46:00] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2025-05-29 19:46:00] [INFO ] [Nat]Added 402 Read/Feed constraints in 99 ms returned sat
[2025-05-29 19:46:00] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 57 ms.
[2025-05-29 19:46:00] [INFO ] Added : 12 causal constraints over 3 iterations in 244 ms. Result :sat
Minimization took 614 ms.
[2025-05-29 19:46:01] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-29 19:46:01] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 19:46:01] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2025-05-29 19:46:01] [INFO ] [Real]Added 402 Read/Feed constraints in 54 ms returned sat
[2025-05-29 19:46:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:46:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-29 19:46:01] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:46:01] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2025-05-29 19:46:01] [INFO ] [Nat]Added 402 Read/Feed constraints in 52 ms returned sat
[2025-05-29 19:46:01] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 42 ms.
[2025-05-29 19:46:01] [INFO ] Added : 7 causal constraints over 2 iterations in 150 ms. Result :sat
Minimization took 414 ms.
[2025-05-29 19:46:02] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 19:46:02] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:46:02] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2025-05-29 19:46:02] [INFO ] [Real]Added 402 Read/Feed constraints in 54 ms returned sat
[2025-05-29 19:46:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:46:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 19:46:02] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 19:46:02] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2025-05-29 19:46:02] [INFO ] [Nat]Added 402 Read/Feed constraints in 78 ms returned sat
[2025-05-29 19:46:02] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 48 ms.
[2025-05-29 19:46:03] [INFO ] Added : 8 causal constraints over 2 iterations in 165 ms. Result :sat
Minimization took 469 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10]
Support contains 9 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 466/466 transitions.
Applied a total of 0 rules in 22 ms. Remains 182 /182 variables (removed 0) and now considering 466/466 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 182/182 places, 466/466 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 466/466 transitions.
Applied a total of 0 rules in 22 ms. Remains 182 /182 variables (removed 0) and now considering 466/466 (removed 0) transitions.
[2025-05-29 19:46:03] [INFO ] Invariant cache hit.
[2025-05-29 19:46:03] [INFO ] Implicit Places using invariants in 294 ms returned []
[2025-05-29 19:46:03] [INFO ] Invariant cache hit.
[2025-05-29 19:46:04] [INFO ] State equation strengthened by 402 read => feed constraints.
[2025-05-29 19:46:05] [INFO ] Implicit Places using invariants and state equation in 1320 ms returned []
Implicit Place search using SMT with State Equation took 1625 ms to find 0 implicit places.
[2025-05-29 19:46:05] [INFO ] Redundant transitions in 48 ms returned []
Running 456 sub problems to find dead transitions.
[2025-05-29 19:46:05] [INFO ] Invariant cache hit.
[2025-05-29 19:46:05] [INFO ] State equation strengthened by 402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2025-05-29 19:46:09] [INFO ] Deduced a trap composed of 2 places in 134 ms of which 18 ms to minimize.
[2025-05-29 19:46:09] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 3 ms to minimize.
[2025-05-29 19:46:09] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2025-05-29 19:46:09] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2025-05-29 19:46:09] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2025-05-29 19:46:09] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2025-05-29 19:46:09] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2025-05-29 19:46:09] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 3 ms to minimize.
[2025-05-29 19:46:09] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2025-05-29 19:46:10] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2025-05-29 19:46:10] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
[2025-05-29 19:46:10] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 3 ms to minimize.
[2025-05-29 19:46:10] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2025-05-29 19:46:10] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2025-05-29 19:46:10] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 3 ms to minimize.
[2025-05-29 19:46:10] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2025-05-29 19:46:10] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2025-05-29 19:46:10] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2025-05-29 19:46:10] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 4 ms to minimize.
[2025-05-29 19:46:11] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2025-05-29 19:46:11] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 3 ms to minimize.
[2025-05-29 19:46:11] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 3 ms to minimize.
[2025-05-29 19:46:11] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2025-05-29 19:46:11] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2025-05-29 19:46:11] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2025-05-29 19:46:11] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2025-05-29 19:46:12] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2025-05-29 19:46:12] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2025-05-29 19:46:12] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2025-05-29 19:46:12] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2025-05-29 19:46:12] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2025-05-29 19:46:12] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2025-05-29 19:46:12] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2025-05-29 19:46:12] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:46:12] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2025-05-29 19:46:12] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:46:12] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:46:12] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:46:12] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:46:12] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2025-05-29 19:46:15] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2025-05-29 19:46:15] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:46:15] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
[2025-05-29 19:46:15] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 2 ms to minimize.
[2025-05-29 19:46:15] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2025-05-29 19:46:15] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2025-05-29 19:46:15] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:46:15] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:46:16] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2025-05-29 19:46:16] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2025-05-29 19:46:16] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 3 ms to minimize.
[2025-05-29 19:46:16] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2025-05-29 19:46:16] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:46:16] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2025-05-29 19:46:16] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:46:16] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:46:17] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 12 ms to minimize.
[2025-05-29 19:46:17] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:46:17] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:46:17] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2025-05-29 19:46:17] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2025-05-29 19:46:17] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2025-05-29 19:46:17] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2025-05-29 19:46:17] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2025-05-29 19:46:17] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
[2025-05-29 19:46:17] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:46:18] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2025-05-29 19:46:18] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2025-05-29 19:46:18] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2025-05-29 19:46:18] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2025-05-29 19:46:18] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2025-05-29 19:46:18] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2025-05-29 19:46:18] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2025-05-29 19:46:18] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2025-05-29 19:46:18] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:46:18] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2025-05-29 19:46:18] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2025-05-29 19:46:18] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2025-05-29 19:46:18] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:46:19] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2025-05-29 19:46:19] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:46:19] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2025-05-29 19:46:20] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2025-05-29 19:46:20] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2025-05-29 19:46:20] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2025-05-29 19:46:20] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2025-05-29 19:46:20] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2025-05-29 19:46:20] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2025-05-29 19:46:20] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2025-05-29 19:46:20] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2025-05-29 19:46:20] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2025-05-29 19:46:20] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2025-05-29 19:46:20] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2025-05-29 19:46:21] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2025-05-29 19:46:21] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:46:21] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:46:21] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
[2025-05-29 19:46:21] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2025-05-29 19:46:22] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:46:22] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2025-05-29 19:46:24] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2025-05-29 19:46:25] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2025-05-29 19:46:25] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2025-05-29 19:46:26] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2025-05-29 19:46:26] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2025-05-29 19:46:26] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2025-05-29 19:46:27] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2025-05-29 19:46:27] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2025-05-29 19:46:27] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2025-05-29 19:46:27] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:46:27] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2025-05-29 19:46:27] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2025-05-29 19:46:28] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 13/125 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2025-05-29 19:46:29] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:46:29] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2025-05-29 19:46:30] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2025-05-29 19:46:30] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2025-05-29 19:46:30] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:46:33] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:46:33] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 7/132 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2025-05-29 19:46:34] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2025-05-29 19:46:34] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:46:34] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2025-05-29 19:46:34] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:46:34] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 181/648 variables, and 137 constraints, problems are : Problem set: 0 solved, 456 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/182 constraints, ReadFeed: 0/402 constraints, PredecessorRefiner: 456/456 constraints, Known Traps: 125/125 constraints]
Escalating to Integer solving :Problem set: 0 solved, 456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 125/137 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2025-05-29 19:46:37] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2025-05-29 19:46:38] [INFO ] Deduced a trap composed of 2 places in 120 ms of which 2 ms to minimize.
[2025-05-29 19:46:38] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 3 ms to minimize.
[2025-05-29 19:46:38] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2025-05-29 19:46:39] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2025-05-29 19:46:39] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2025-05-29 19:46:39] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 7/144 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 5 (OVERLAPS) 466/647 variables, 181/325 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD464 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/647 variables, 402/727 constraints. Problems are: Problem set: 23 solved, 433 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/647 variables, 433/1160 constraints. Problems are: Problem set: 23 solved, 433 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 647/648 variables, and 1160 constraints, problems are : Problem set: 23 solved, 433 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 181/182 constraints, ReadFeed: 402/402 constraints, PredecessorRefiner: 433/456 constraints, Known Traps: 132/132 constraints]
After SMT, in 60516ms problems are : Problem set: 23 solved, 433 unsolved
Search for dead transitions found 23 dead transitions in 60562ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 182/182 places, 443/466 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 169 transition count 417
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 169 transition count 417
Applied a total of 26 rules in 20 ms. Remains 169 /182 variables (removed 13) and now considering 417/443 (removed 26) transitions.
// Phase 1: matrix 417 rows 169 cols
[2025-05-29 19:47:05] [INFO ] Computed 12 invariants in 5 ms
[2025-05-29 19:47:06] [INFO ] Implicit Places using invariants in 315 ms returned []
[2025-05-29 19:47:06] [INFO ] Invariant cache hit.
[2025-05-29 19:47:06] [INFO ] State equation strengthened by 366 read => feed constraints.
[2025-05-29 19:47:07] [INFO ] Implicit Places using invariants and state equation in 1242 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1567 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 168/182 places, 417/466 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 166 transition count 415
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 165 transition count 420
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 165 transition count 414
Applied a total of 12 rules in 45 ms. Remains 165 /168 variables (removed 3) and now considering 414/417 (removed 3) transitions.
// Phase 1: matrix 414 rows 165 cols
[2025-05-29 19:47:07] [INFO ] Computed 11 invariants in 5 ms
[2025-05-29 19:47:07] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-05-29 19:47:07] [INFO ] Invariant cache hit.
[2025-05-29 19:47:07] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-29 19:47:08] [INFO ] Implicit Places using invariants and state equation in 1054 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 165/182 places, 414/466 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 65154 ms. Remains : 165/182 places, 414/466 transitions.
[2025-05-29 19:47:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10]
RANDOM walk for 1000000 steps (18303 resets) in 2800 ms. (357 steps per ms)
BEST_FIRST walk for 9000007 steps (15566 resets) in 5246 ms. (1715 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10]
[2025-05-29 19:47:16] [INFO ] Invariant cache hit.
[2025-05-29 19:47:16] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-05-29 19:47:17] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2025-05-29 19:47:17] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-29 19:47:17] [INFO ] [Real]Added 356 Read/Feed constraints in 56 ms returned sat
[2025-05-29 19:47:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:47:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-05-29 19:47:17] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2025-05-29 19:47:17] [INFO ] [Nat]Added 356 Read/Feed constraints in 51 ms returned sat
[2025-05-29 19:47:17] [INFO ] Computed and/alt/rep : 289/941/289 causal constraints (skipped 115 transitions) in 43 ms.
[2025-05-29 19:47:17] [INFO ] Added : 15 causal constraints over 4 iterations in 206 ms. Result :sat
Minimization took 291 ms.
[2025-05-29 19:47:17] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-05-29 19:47:18] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2025-05-29 19:47:18] [INFO ] [Real]Added 356 Read/Feed constraints in 46 ms returned sat
[2025-05-29 19:47:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:47:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-05-29 19:47:18] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2025-05-29 19:47:18] [INFO ] [Nat]Added 356 Read/Feed constraints in 42 ms returned sat
[2025-05-29 19:47:18] [INFO ] Computed and/alt/rep : 289/941/289 causal constraints (skipped 115 transitions) in 28 ms.
[2025-05-29 19:47:18] [INFO ] Added : 3 causal constraints over 1 iterations in 83 ms. Result :sat
Minimization took 428 ms.
[2025-05-29 19:47:18] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-05-29 19:47:19] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2025-05-29 19:47:19] [INFO ] [Real]Added 356 Read/Feed constraints in 50 ms returned sat
[2025-05-29 19:47:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:47:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-05-29 19:47:19] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2025-05-29 19:47:19] [INFO ] [Nat]Added 356 Read/Feed constraints in 70 ms returned sat
[2025-05-29 19:47:19] [INFO ] Computed and/alt/rep : 289/941/289 causal constraints (skipped 115 transitions) in 42 ms.
[2025-05-29 19:47:19] [INFO ] Added : 9 causal constraints over 2 iterations in 142 ms. Result :sat
Minimization took 329 ms.
[2025-05-29 19:47:20] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-05-29 19:47:20] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2025-05-29 19:47:20] [INFO ] [Real]Added 356 Read/Feed constraints in 38 ms returned sat
[2025-05-29 19:47:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:47:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-05-29 19:47:20] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2025-05-29 19:47:20] [INFO ] [Nat]Added 356 Read/Feed constraints in 53 ms returned sat
[2025-05-29 19:47:20] [INFO ] Computed and/alt/rep : 289/941/289 causal constraints (skipped 115 transitions) in 29 ms.
[2025-05-29 19:47:20] [INFO ] Added : 10 causal constraints over 2 iterations in 113 ms. Result :sat
Minimization took 291 ms.
[2025-05-29 19:47:20] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2025-05-29 19:47:21] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2025-05-29 19:47:21] [INFO ] [Real]Added 356 Read/Feed constraints in 56 ms returned sat
[2025-05-29 19:47:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:47:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-05-29 19:47:21] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2025-05-29 19:47:21] [INFO ] [Nat]Added 356 Read/Feed constraints in 45 ms returned sat
[2025-05-29 19:47:21] [INFO ] Computed and/alt/rep : 289/941/289 causal constraints (skipped 115 transitions) in 29 ms.
[2025-05-29 19:47:21] [INFO ] Added : 9 causal constraints over 2 iterations in 114 ms. Result :sat
Minimization took 321 ms.
[2025-05-29 19:47:21] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-05-29 19:47:22] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2025-05-29 19:47:22] [INFO ] [Real]Added 356 Read/Feed constraints in 53 ms returned sat
[2025-05-29 19:47:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:47:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-05-29 19:47:22] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2025-05-29 19:47:22] [INFO ] [Nat]Added 356 Read/Feed constraints in 51 ms returned sat
[2025-05-29 19:47:22] [INFO ] Computed and/alt/rep : 289/941/289 causal constraints (skipped 115 transitions) in 28 ms.
[2025-05-29 19:47:22] [INFO ] Added : 9 causal constraints over 2 iterations in 110 ms. Result :sat
Minimization took 292 ms.
[2025-05-29 19:47:22] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-05-29 19:47:22] [INFO ] [Real]Absence check using state equation in 144 ms returned unsat
[2025-05-29 19:47:23] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-05-29 19:47:23] [INFO ] [Real]Absence check using state equation in 114 ms returned unsat
[2025-05-29 19:47:23] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-05-29 19:47:23] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2025-05-29 19:47:23] [INFO ] [Real]Added 356 Read/Feed constraints in 38 ms returned sat
[2025-05-29 19:47:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:47:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-05-29 19:47:23] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2025-05-29 19:47:23] [INFO ] [Nat]Added 356 Read/Feed constraints in 65 ms returned sat
[2025-05-29 19:47:23] [INFO ] Computed and/alt/rep : 289/941/289 causal constraints (skipped 115 transitions) in 36 ms.
[2025-05-29 19:47:23] [INFO ] Added : 8 causal constraints over 2 iterations in 149 ms. Result :sat
Minimization took 504 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 1, 1, 10]
FORMULA CANInsertWithFailure-PT-010-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10]
Support contains 7 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 414/414 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 163 transition count 412
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 163 transition count 410
Applied a total of 6 rules in 23 ms. Remains 163 /165 variables (removed 2) and now considering 410/414 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 163/165 places, 410/414 transitions.
// Phase 1: matrix 410 rows 163 cols
[2025-05-29 19:47:24] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10]
RANDOM walk for 1000000 steps (18523 resets) in 2453 ms. (407 steps per ms)
BEST_FIRST walk for 7000006 steps (12159 resets) in 4011 ms. (1744 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10]
[2025-05-29 19:47:30] [INFO ] Invariant cache hit.
[2025-05-29 19:47:30] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-05-29 19:47:31] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2025-05-29 19:47:31] [INFO ] State equation strengthened by 358 read => feed constraints.
[2025-05-29 19:47:31] [INFO ] [Real]Added 358 Read/Feed constraints in 55 ms returned sat
[2025-05-29 19:47:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:47:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-05-29 19:47:31] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2025-05-29 19:47:31] [INFO ] [Nat]Added 358 Read/Feed constraints in 46 ms returned sat
[2025-05-29 19:47:31] [INFO ] Computed and/alt/rep : 285/943/285 causal constraints (skipped 115 transitions) in 29 ms.
[2025-05-29 19:47:31] [INFO ] Added : 13 causal constraints over 3 iterations in 135 ms. Result :sat
Minimization took 372 ms.
[2025-05-29 19:47:32] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2025-05-29 19:47:32] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2025-05-29 19:47:32] [INFO ] [Real]Added 358 Read/Feed constraints in 53 ms returned sat
[2025-05-29 19:47:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:47:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-05-29 19:47:32] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2025-05-29 19:47:32] [INFO ] [Nat]Added 358 Read/Feed constraints in 46 ms returned sat
[2025-05-29 19:47:32] [INFO ] Computed and/alt/rep : 285/943/285 causal constraints (skipped 115 transitions) in 53 ms.
[2025-05-29 19:47:32] [INFO ] Added : 3 causal constraints over 1 iterations in 144 ms. Result :sat
Minimization took 530 ms.
[2025-05-29 19:47:33] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-05-29 19:47:33] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2025-05-29 19:47:33] [INFO ] [Real]Added 358 Read/Feed constraints in 54 ms returned sat
[2025-05-29 19:47:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:47:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-05-29 19:47:33] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2025-05-29 19:47:33] [INFO ] [Nat]Added 358 Read/Feed constraints in 56 ms returned sat
[2025-05-29 19:47:33] [INFO ] Computed and/alt/rep : 285/943/285 causal constraints (skipped 115 transitions) in 29 ms.
[2025-05-29 19:47:33] [INFO ] Added : 11 causal constraints over 3 iterations in 131 ms. Result :sat
Minimization took 484 ms.
[2025-05-29 19:47:34] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2025-05-29 19:47:34] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2025-05-29 19:47:34] [INFO ] [Real]Added 358 Read/Feed constraints in 56 ms returned sat
[2025-05-29 19:47:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:47:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-05-29 19:47:34] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2025-05-29 19:47:34] [INFO ] [Nat]Added 358 Read/Feed constraints in 51 ms returned sat
[2025-05-29 19:47:34] [INFO ] Computed and/alt/rep : 285/943/285 causal constraints (skipped 115 transitions) in 30 ms.
[2025-05-29 19:47:35] [INFO ] Added : 8 causal constraints over 2 iterations in 171 ms. Result :sat
Minimization took 544 ms.
[2025-05-29 19:47:35] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-05-29 19:47:35] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2025-05-29 19:47:35] [INFO ] [Real]Added 358 Read/Feed constraints in 62 ms returned sat
[2025-05-29 19:47:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:47:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2025-05-29 19:47:36] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2025-05-29 19:47:36] [INFO ] [Nat]Added 358 Read/Feed constraints in 70 ms returned sat
[2025-05-29 19:47:36] [INFO ] Computed and/alt/rep : 285/943/285 causal constraints (skipped 115 transitions) in 45 ms.
[2025-05-29 19:47:36] [INFO ] Added : 13 causal constraints over 3 iterations in 208 ms. Result :sat
Minimization took 495 ms.
[2025-05-29 19:47:37] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-05-29 19:47:37] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2025-05-29 19:47:37] [INFO ] [Real]Added 358 Read/Feed constraints in 55 ms returned sat
[2025-05-29 19:47:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:47:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-05-29 19:47:37] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2025-05-29 19:47:37] [INFO ] [Nat]Added 358 Read/Feed constraints in 68 ms returned sat
[2025-05-29 19:47:37] [INFO ] Computed and/alt/rep : 285/943/285 causal constraints (skipped 115 transitions) in 49 ms.
[2025-05-29 19:47:37] [INFO ] Added : 9 causal constraints over 2 iterations in 180 ms. Result :sat
Minimization took 491 ms.
[2025-05-29 19:47:38] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2025-05-29 19:47:38] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2025-05-29 19:47:38] [INFO ] [Real]Added 358 Read/Feed constraints in 58 ms returned sat
[2025-05-29 19:47:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:47:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-05-29 19:47:38] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2025-05-29 19:47:39] [INFO ] [Nat]Added 358 Read/Feed constraints in 56 ms returned sat
[2025-05-29 19:47:39] [INFO ] Computed and/alt/rep : 285/943/285 causal constraints (skipped 115 transitions) in 47 ms.
[2025-05-29 19:47:39] [INFO ] Added : 9 causal constraints over 2 iterations in 153 ms. Result :sat
Minimization took 343 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10]
Support contains 7 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 410/410 transitions.
Applied a total of 0 rules in 14 ms. Remains 163 /163 variables (removed 0) and now considering 410/410 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 163/163 places, 410/410 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 410/410 transitions.
Applied a total of 0 rules in 15 ms. Remains 163 /163 variables (removed 0) and now considering 410/410 (removed 0) transitions.
[2025-05-29 19:47:39] [INFO ] Invariant cache hit.
[2025-05-29 19:47:39] [INFO ] Implicit Places using invariants in 229 ms returned []
[2025-05-29 19:47:39] [INFO ] Invariant cache hit.
[2025-05-29 19:47:40] [INFO ] State equation strengthened by 358 read => feed constraints.
[2025-05-29 19:47:41] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 1419 ms to find 0 implicit places.
[2025-05-29 19:47:41] [INFO ] Redundant transitions in 3 ms returned []
Running 400 sub problems to find dead transitions.
[2025-05-29 19:47:41] [INFO ] Invariant cache hit.
[2025-05-29 19:47:41] [INFO ] State equation strengthened by 358 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:47:43] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2025-05-29 19:47:43] [INFO ] Deduced a trap composed of 2 places in 107 ms of which 2 ms to minimize.
[2025-05-29 19:47:43] [INFO ] Deduced a trap composed of 2 places in 109 ms of which 3 ms to minimize.
[2025-05-29 19:47:43] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2025-05-29 19:47:44] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 2 ms to minimize.
[2025-05-29 19:47:44] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 3 ms to minimize.
[2025-05-29 19:47:44] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 2 ms to minimize.
[2025-05-29 19:47:44] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 3 ms to minimize.
[2025-05-29 19:47:44] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
[2025-05-29 19:47:44] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 3 ms to minimize.
[2025-05-29 19:47:44] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 4 ms to minimize.
[2025-05-29 19:47:44] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2025-05-29 19:47:44] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 2 ms to minimize.
[2025-05-29 19:47:45] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2025-05-29 19:47:45] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2025-05-29 19:47:45] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2025-05-29 19:47:45] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2025-05-29 19:47:45] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2025-05-29 19:47:45] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
[2025-05-29 19:47:45] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:47:45] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:47:45] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:47:45] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2025-05-29 19:47:46] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2025-05-29 19:47:46] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2025-05-29 19:47:46] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:47:46] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:47:46] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
[2025-05-29 19:47:46] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:47:46] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2025-05-29 19:47:46] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:47:46] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:47:46] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:47:47] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:47:47] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:47:47] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:47:47] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:47:48] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 2 ms to minimize.
[2025-05-29 19:47:48] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2025-05-29 19:47:48] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:47:49] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:47:49] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:47:54] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:47:54] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2025-05-29 19:47:54] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2025-05-29 19:47:54] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2025-05-29 19:47:54] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:47:56] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:47:58] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2025-05-29 19:47:58] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:47:58] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:47:58] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:47:58] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:47:58] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2025-05-29 19:47:59] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:47:59] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2025-05-29 19:47:59] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2025-05-29 19:47:59] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:47:59] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
[2025-05-29 19:47:59] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:47:59] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2025-05-29 19:47:59] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
[2025-05-29 19:47:59] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2025-05-29 19:47:59] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:47:59] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2025-05-29 19:47:59] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2025-05-29 19:47:59] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2025-05-29 19:47:59] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:48:02] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:48:02] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:48:02] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2025-05-29 19:48:02] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2025-05-29 19:48:02] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2025-05-29 19:48:02] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2025-05-29 19:48:02] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2025-05-29 19:48:02] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2025-05-29 19:48:02] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2025-05-29 19:48:02] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2025-05-29 19:48:03] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 3 ms to minimize.
[2025-05-29 19:48:03] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
[2025-05-29 19:48:03] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 2 ms to minimize.
[2025-05-29 19:48:03] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2025-05-29 19:48:03] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2025-05-29 19:48:03] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2025-05-29 19:48:03] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 3 ms to minimize.
[2025-05-29 19:48:03] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2025-05-29 19:48:03] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2025-05-29 19:48:03] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:48:04] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2025-05-29 19:48:04] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:48:05] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2025-05-29 19:48:05] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2025-05-29 19:48:05] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2025-05-29 19:48:05] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:48:05] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2025-05-29 19:48:05] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2025-05-29 19:48:06] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2025-05-29 19:48:06] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2025-05-29 19:48:06] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2025-05-29 19:48:06] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2025-05-29 19:48:06] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:48:06] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:48:06] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:48:06] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2025-05-29 19:48:06] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2025-05-29 19:48:06] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:48:07] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2025-05-29 19:48:07] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:48:07] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:48:07] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:48:07] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2025-05-29 19:48:07] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:48:08] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:48:08] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:48:08] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:48:08] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:48:10] [INFO ] Deduced a trap composed of 2 places in 147 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 162/573 variables, and 128 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/163 constraints, ReadFeed: 0/358 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 117/117 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 117/128 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:48:12] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:48:12] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2025-05-29 19:48:12] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2025-05-29 19:48:12] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2025-05-29 19:48:13] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2025-05-29 19:48:13] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:48:14] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 4 ms to minimize.
[2025-05-29 19:48:14] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2025-05-29 19:48:14] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2025-05-29 19:48:14] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2025-05-29 19:48:14] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:48:14] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2025-05-29 19:48:15] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2025-05-29 19:48:15] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2025-05-29 19:48:15] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2025-05-29 19:48:15] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:48:15] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:48:15] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:48:15] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2025-05-29 19:48:15] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:48:16] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:48:16] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
[2025-05-29 19:48:16] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:48:16] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:48:16] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:48:16] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:48:16] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:48:16] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2025-05-29 19:48:17] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 9/157 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:48:19] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:48:19] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:48:19] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:48:22] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:48:24] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2025-05-29 19:48:24] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
[2025-05-29 19:48:24] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:48:25] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 5/165 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 410/572 variables, 162/327 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 358/685 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 400/1085 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/573 variables, and 1085 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 162/163 constraints, ReadFeed: 358/358 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 154/154 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61634 ms. Remains : 163/163 places, 410/410 transitions.
RANDOM walk for 40000 steps (743 resets) in 1587 ms. (25 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (73 resets) in 283 ms. (140 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (68 resets) in 235 ms. (169 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (67 resets) in 130 ms. (305 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (68 resets) in 160 ms. (248 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (64 resets) in 175 ms. (227 steps per ms) remains 14/14 properties
[2025-05-29 19:48:42] [INFO ] Flatten gal took : 260 ms
BEST_FIRST walk for 40003 steps (68 resets) in 161 ms. (246 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (70 resets) in 146 ms. (272 steps per ms) remains 14/14 properties
[2025-05-29 19:48:42] [INFO ] Flatten gal took : 85 ms
BEST_FIRST walk for 40004 steps (66 resets) in 185 ms. (215 steps per ms) remains 14/14 properties
[2025-05-29 19:48:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14095953012573481261.gal : 34 ms
[2025-05-29 19:48:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6549415566342098160.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/ReachabilityCardinality14095953012573481261.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6549415566342098160.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
BEST_FIRST walk for 40004 steps (66 resets) in 191 ms. (208 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (66 resets) in 82 ms. (481 steps per ms) remains 14/14 properties
Loading property file /tmp/ReachabilityCardinality6549415566342098160.prop.
BEST_FIRST walk for 40004 steps (69 resets) in 123 ms. (322 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 29
BEST_FIRST walk for 40002 steps (73 resets) in 134 ms. (296 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :29 after 38
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :38 after 43
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :43 after 45
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :45 after 47
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :47 after 67
BEST_FIRST walk for 40003 steps (67 resets) in 89 ms. (444 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :67 after 89
BEST_FIRST walk for 40004 steps (69 resets) in 54 ms. (727 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :89 after 530
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :530 after 4409
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :4409 after 6859
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :6859 after 32724
Interrupted probabilistic random walk after 497292 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 14
Probabilistic random walk after 497292 steps, saw 67846 distinct states, run finished after 3006 ms. (steps per millisecond=165 ) properties seen :0
[2025-05-29 19:48:45] [INFO ] Invariant cache hit.
[2025-05-29 19:48:45] [INFO ] State equation strengthened by 358 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 145/152 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2025-05-29 19:48:45] [INFO ] Deduced a trap composed of 2 places in 115 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
[2025-05-29 19:48:45] [INFO ] Deduced a trap composed of 2 places in 115 ms of which 2 ms to minimize.
[2025-05-29 19:48:46] [INFO ] Deduced a trap composed of 2 places in 144 ms of which 3 ms to minimize.
[2025-05-29 19:48:46] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 2 ms to minimize.
[2025-05-29 19:48:46] [INFO ] Deduced a trap composed of 2 places in 149 ms of which 3 ms to minimize.
[2025-05-29 19:48:46] [INFO ] Deduced a trap composed of 2 places in 128 ms of which 2 ms to minimize.
[2025-05-29 19:48:46] [INFO ] Deduced a trap composed of 2 places in 110 ms of which 2 ms to minimize.
[2025-05-29 19:48:46] [INFO ] Deduced a trap composed of 2 places in 111 ms of which 1 ms to minimize.
[2025-05-29 19:48:46] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 2 ms to minimize.
Problem MAX1 is UNSAT
[2025-05-29 19:48:47] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2025-05-29 19:48:47] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2025-05-29 19:48:47] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2025-05-29 19:48:47] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2025-05-29 19:48:47] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
Problem MAX2 is UNSAT
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :32724 after 141802
[2025-05-29 19:48:47] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2025-05-29 19:48:47] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 2 ms to minimize.
[2025-05-29 19:48:47] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2025-05-29 19:48:47] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2025-05-29 19:48:47] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2025-05-29 19:48:48] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 20/22 constraints. Problems are: Problem set: 7 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/22 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 9/161 variables, 9/31 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/31 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 410/571 variables, 161/192 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 358/550 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 0/550 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 2/573 variables, 2/552 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 0/552 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/573 variables, 0/552 constraints. Problems are: Problem set: 7 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 573/573 variables, and 552 constraints, problems are : Problem set: 7 solved, 7 unsolved in 2965 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 163/163 constraints, ReadFeed: 358/358 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 7 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 145/152 variables, 2/2 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 20/22 constraints. Problems are: Problem set: 7 solved, 7 unsolved
[2025-05-29 19:48:48] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2025-05-29 19:48:48] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2025-05-29 19:48:48] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2025-05-29 19:48:49] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2025-05-29 19:48:49] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2025-05-29 19:48:49] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2025-05-29 19:48:49] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 7/29 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/29 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 9/161 variables, 9/38 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/38 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 410/571 variables, 161/199 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 358/557 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 7/564 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 0/564 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 2/573 variables, 2/566 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/573 variables, 0/566 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/573 variables, 0/566 constraints. Problems are: Problem set: 7 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 573/573 variables, and 566 constraints, problems are : Problem set: 7 solved, 7 unsolved in 2067 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 163/163 constraints, ReadFeed: 358/358 constraints, PredecessorRefiner: 7/14 constraints, Known Traps: 27/27 constraints]
After SMT, in 5062ms problems are : Problem set: 7 solved, 7 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 7 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 410/410 transitions.
Applied a total of 0 rules in 9 ms. Remains 163 /163 variables (removed 0) and now considering 410/410 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 163/163 places, 410/410 transitions.
RANDOM walk for 40000 steps (743 resets) in 461 ms. (86 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (70 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (70 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (71 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (65 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (66 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (70 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (67 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 568513 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 7
Probabilistic random walk after 568513 steps, saw 75469 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
[2025-05-29 19:48:54] [INFO ] Invariant cache hit.
[2025-05-29 19:48:54] [INFO ] State equation strengthened by 358 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 145/152 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 9/161 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 410/571 variables, 161/172 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 358/530 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2/573 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/573 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 573/573 variables, and 532 constraints, problems are : Problem set: 0 solved, 7 unsolved in 604 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 163/163 constraints, ReadFeed: 358/358 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 145/152 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2025-05-29 19:48:54] [INFO ] Deduced a trap composed of 2 places in 98 ms of which 2 ms to minimize.
[2025-05-29 19:48:54] [INFO ] Deduced a trap composed of 2 places in 133 ms of which 2 ms to minimize.
[2025-05-29 19:48:55] [INFO ] Deduced a trap composed of 2 places in 110 ms of which 2 ms to minimize.
[2025-05-29 19:48:55] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2025-05-29 19:48:55] [INFO ] Deduced a trap composed of 2 places in 165 ms of which 3 ms to minimize.
[2025-05-29 19:48:55] [INFO ] Deduced a trap composed of 2 places in 119 ms of which 2 ms to minimize.
[2025-05-29 19:48:55] [INFO ] Deduced a trap composed of 2 places in 164 ms of which 3 ms to minimize.
[2025-05-29 19:48:55] [INFO ] Deduced a trap composed of 2 places in 163 ms of which 3 ms to minimize.
[2025-05-29 19:48:56] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 2 ms to minimize.
[2025-05-29 19:48:56] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 3 ms to minimize.
[2025-05-29 19:48:56] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 2 ms to minimize.
[2025-05-29 19:48:56] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 3 ms to minimize.
[2025-05-29 19:48:56] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 3 ms to minimize.
[2025-05-29 19:48:56] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2025-05-29 19:48:56] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 3 ms to minimize.
[2025-05-29 19:48:57] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 3 ms to minimize.
[2025-05-29 19:48:57] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 3 ms to minimize.
[2025-05-29 19:48:57] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 3 ms to minimize.
[2025-05-29 19:48:57] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:48:57] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2025-05-29 19:48:57] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 3 ms to minimize.
[2025-05-29 19:48:57] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 3 ms to minimize.
[2025-05-29 19:48:57] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2025-05-29 19:48:58] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2025-05-29 19:48:58] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2025-05-29 19:48:58] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2025-05-29 19:48:58] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2025-05-29 19:48:58] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 9/161 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 410/571 variables, 161/200 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 358/558 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 7/565 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 2/573 variables, 2/567 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :141802 after 1.50932e+06
At refinement iteration 12 (INCLUDED_ONLY) 0/573 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/573 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 573/573 variables, and 567 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5544 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 163/163 constraints, ReadFeed: 358/358 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 28/28 constraints]
After SMT, in 6163ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 544 ms.
Support contains 7 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 410/410 transitions.
Applied a total of 0 rules in 19 ms. Remains 163 /163 variables (removed 0) and now considering 410/410 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 163/163 places, 410/410 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 410/410 transitions.
Applied a total of 0 rules in 13 ms. Remains 163 /163 variables (removed 0) and now considering 410/410 (removed 0) transitions.
[2025-05-29 19:49:00] [INFO ] Invariant cache hit.
[2025-05-29 19:49:01] [INFO ] Implicit Places using invariants in 251 ms returned []
[2025-05-29 19:49:01] [INFO ] Invariant cache hit.
[2025-05-29 19:49:01] [INFO ] State equation strengthened by 358 read => feed constraints.
[2025-05-29 19:49:02] [INFO ] Implicit Places using invariants and state equation in 1178 ms returned []
Implicit Place search using SMT with State Equation took 1436 ms to find 0 implicit places.
[2025-05-29 19:49:02] [INFO ] Redundant transitions in 3 ms returned []
Running 400 sub problems to find dead transitions.
[2025-05-29 19:49:02] [INFO ] Invariant cache hit.
[2025-05-29 19:49:02] [INFO ] State equation strengthened by 358 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:49:05] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:49:05] [INFO ] Deduced a trap composed of 2 places in 130 ms of which 3 ms to minimize.
[2025-05-29 19:49:05] [INFO ] Deduced a trap composed of 2 places in 125 ms of which 3 ms to minimize.
[2025-05-29 19:49:05] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 2 ms to minimize.
[2025-05-29 19:49:05] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2025-05-29 19:49:05] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2025-05-29 19:49:05] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2025-05-29 19:49:05] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2025-05-29 19:49:06] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 16 ms to minimize.
[2025-05-29 19:49:06] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2025-05-29 19:49:06] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2025-05-29 19:49:06] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:49:06] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 3 ms to minimize.
[2025-05-29 19:49:06] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2025-05-29 19:49:06] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2025-05-29 19:49:06] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2025-05-29 19:49:06] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2025-05-29 19:49:06] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2025-05-29 19:49:06] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2025-05-29 19:49:06] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:49:07] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:49:07] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2025-05-29 19:49:07] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2025-05-29 19:49:07] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
[2025-05-29 19:49:07] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2025-05-29 19:49:07] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2025-05-29 19:49:07] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:49:07] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:49:07] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2025-05-29 19:49:07] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:49:07] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2025-05-29 19:49:08] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:49:08] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:49:08] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:49:08] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:49:08] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 3 ms to minimize.
[2025-05-29 19:49:09] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2025-05-29 19:49:10] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 2 ms to minimize.
[2025-05-29 19:49:10] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2025-05-29 19:49:10] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:49:11] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:49:11] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
SDD proceeding with computation,14 properties remain. new max is 32768
SDD size :1.50932e+06 after 2.06054e+06
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:49:16] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:49:17] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:49:17] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:49:17] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:49:17] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:49:19] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:49:22] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2025-05-29 19:49:22] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:49:22] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:49:22] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2025-05-29 19:49:22] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:49:22] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2025-05-29 19:49:22] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:49:22] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2025-05-29 19:49:22] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2025-05-29 19:49:22] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:49:22] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:49:22] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:49:23] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2025-05-29 19:49:23] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:49:23] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2025-05-29 19:49:23] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:49:23] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2025-05-29 19:49:23] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2025-05-29 19:49:23] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2025-05-29 19:49:23] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:49:25] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2025-05-29 19:49:25] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2025-05-29 19:49:25] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2025-05-29 19:49:26] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2025-05-29 19:49:26] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2025-05-29 19:49:26] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2025-05-29 19:49:26] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:49:26] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
[2025-05-29 19:49:26] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:49:26] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2025-05-29 19:49:26] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2025-05-29 19:49:26] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:49:26] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2025-05-29 19:49:26] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2025-05-29 19:49:26] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:49:26] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
[2025-05-29 19:49:26] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2025-05-29 19:49:27] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2025-05-29 19:49:27] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2025-05-29 19:49:27] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:49:27] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2025-05-29 19:49:28] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:49:28] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2025-05-29 19:49:28] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2025-05-29 19:49:28] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2025-05-29 19:49:28] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:49:29] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2025-05-29 19:49:29] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2025-05-29 19:49:29] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2025-05-29 19:49:29] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2025-05-29 19:49:29] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2025-05-29 19:49:29] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2025-05-29 19:49:30] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2025-05-29 19:49:30] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:49:30] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2025-05-29 19:49:30] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:49:30] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2025-05-29 19:49:30] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:49:30] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2025-05-29 19:49:30] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:49:31] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2025-05-29 19:49:31] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:49:31] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:49:31] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:49:31] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2025-05-29 19:49:31] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:49:31] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:49:31] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2025-05-29 19:49:32] [INFO ] Flatten gal took : 53 ms
[2025-05-29 19:49:32] [INFO ] Applying decomposition
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 162/573 variables, and 127 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/163 constraints, ReadFeed: 0/358 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 116/116 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
[2025-05-29 19:49:32] [INFO ] Flatten gal took : 48 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 400 unsolved
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/graph18281132446694101124.txt' '-o' '/tmp/graph18281132446694101124.bin' '-w' '/tmp/graph18281132446694101124.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18281132446694101124.bin' '-l' '-1' '-v' '-w' '/tmp/graph18281132446694101124.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:49:32] [INFO ] Decomposing Gal with order
[2025-05-29 19:49:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:49:33] [INFO ] Removed a total of 317 redundant transitions.
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 116/127 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:49:33] [INFO ] Flatten gal took : 131 ms
[2025-05-29 19:49:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 39 ms.
[2025-05-29 19:49:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4934498881292477382.gal : 13 ms
[2025-05-29 19:49:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5161422640264871281.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/ReachabilityCardinality4934498881292477382.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5161422640264871281.prop' '--nowitness'
[2025-05-29 19:49:33] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 7 ms to minimize.

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/ReachabilityCardinality5161422640264871281.prop.
[2025-05-29 19:49:33] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :10 after 47
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :47 after 72
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :72 after 333
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :333 after 2761
[2025-05-29 19:49:33] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :2761 after 28611
[2025-05-29 19:49:33] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :28611 after 305386
[2025-05-29 19:49:33] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2025-05-29 19:49:33] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:49:33] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:49:34] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:49:34] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:49:34] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:49:34] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2025-05-29 19:49:34] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2025-05-29 19:49:34] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:49:35] [INFO ] Deduced a trap composed of 2 places in 97 ms of which 2 ms to minimize.
[2025-05-29 19:49:35] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 2 ms to minimize.
[2025-05-29 19:49:35] [INFO ] Deduced a trap composed of 2 places in 111 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 16/143 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:49:37] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:49:37] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2025-05-29 19:49:37] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:49:37] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :305386 after 6.85674e+06
[2025-05-29 19:49:39] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:49:39] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 6/149 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:49:39] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:49:40] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:49:40] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:49:40] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:49:40] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:49:41] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2025-05-29 19:49:41] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2025-05-29 19:49:41] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2025-05-29 19:49:42] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2025-05-29 19:49:42] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2025-05-29 19:49:42] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:49:42] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:49:43] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:49:43] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2025-05-29 19:49:43] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:49:43] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 16/165 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:49:44] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2025-05-29 19:49:44] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:49:44] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:49:45] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2025-05-29 19:49:45] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2025-05-29 19:49:45] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2025-05-29 19:49:45] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2025-05-29 19:49:46] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:49:47] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2025-05-29 19:49:50] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:49:50] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:49:50] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:49:55] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2025-05-29 19:49:55] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
[2025-05-29 19:49:55] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:49:56] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2025-05-29 19:49:57] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 24 ms to minimize.
[2025-05-29 19:49:57] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2025-05-29 19:49:58] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:49:58] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 5/185 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:49:59] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:50:01] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:50:01] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 162/573 variables, and 188 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/163 constraints, ReadFeed: 0/358 constraints, PredecessorRefiner: 0/400 constraints, Known Traps: 177/177 constraints]
After SMT, in 60273ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60281ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61742 ms. Remains : 163/163 places, 410/410 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 327 edges and 163 vertex of which 113 / 163 are part of one of the 3 SCC in 13 ms
Free SCC test removed 110 places
Drop transitions (Empty/Sink Transition effects.) removed 255 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 334 transitions.
Graph (complete) has 135 edges and 53 vertex of which 23 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 23 transition count 38
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 22 transition count 37
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 41 place count 14 transition count 29
Iterating global reduction 2 with 8 rules applied. Total rules applied 49 place count 14 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 13 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 11 transition count 26
Applied a total of 53 rules in 45 ms. Remains 11 /163 variables (removed 152) and now considering 26/410 (removed 384) transitions.
Running SMT prover for 7 properties.
[2025-05-29 19:50:02] [INFO ] Flow matrix only has 24 transitions (discarded 2 similar events)
// Phase 1: matrix 24 rows 11 cols
[2025-05-29 19:50:02] [INFO ] Computed 0 invariants in 0 ms
[2025-05-29 19:50:02] [INFO ] After 25ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:6
TRAPS : Iteration 0
[2025-05-29 19:50:02] [INFO ] After 37ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:7
[2025-05-29 19:50:02] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2025-05-29 19:50:02] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2025-05-29 19:50:02] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2025-05-29 19:50:02] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2025-05-29 19:50:02] [INFO ] Flatten gal took : 2 ms
[2025-05-29 19:50:02] [INFO ] Flatten gal took : 1 ms
[2025-05-29 19:50:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7040065782754425942.gal : 1 ms
[2025-05-29 19:50:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality427979534467931710.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/ReachabilityCardinality7040065782754425942.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality427979534467931710.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality427979534467931710.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 6
Invariant property MIN6 does not hold.
Invariant property MIN5 does not hold.
Invariant property MIN4 does not hold.
Invariant property MIN0 does not hold.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :6 after 21
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :21 after 56
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :56 after 252
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :252 after 2079
Invariant property MIN3 does not hold.
Invariant property MIN2 does not hold.
Invariant property MIN1 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
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,87230,0.01073,3944,2,115,17,1240,6,0,65,1054,0
Total reachable state count : 87230

Verifying 7 reachability properties.
Invariant property MIN0 does not hold.

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,1,0.011109,3944,2,12,17,1240,7,0,68,1054,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,924,0.01131,3944,2,42,17,1240,8,0,70,1054,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,6435,0.01151,3944,2,61,17,1240,9,0,72,1054,0
Invariant property MIN3 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,462,0.011704,3944,2,36,17,1240,10,0,74,1054,0
Invariant property MIN4 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,84,0.011893,3944,2,24,17,1240,11,0,76,1054,0
Invariant property MIN5 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN5,28,0.012109,3944,2,18,17,1240,12,0,78,1054,0
Invariant property MIN6 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN6,7,0.012304,3944,2,12,17,1240,13,0,80,1054,0
Over-approximation ignoring read arcs solved 0 properties in 273 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, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10]
Starting property specific reduction for CANInsertWithFailure-PT-010-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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 410 rows 163 cols
[2025-05-29 19:50:02] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (184 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (16 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-05-29 19:50:02] [INFO ] Invariant cache hit.
[2025-05-29 19:50:02] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-05-29 19:50:03] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2025-05-29 19:50:03] [INFO ] State equation strengthened by 358 read => feed constraints.
[2025-05-29 19:50:03] [INFO ] [Real]Added 358 Read/Feed constraints in 64 ms returned sat
[2025-05-29 19:50:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:50:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2025-05-29 19:50:03] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2025-05-29 19:50:03] [INFO ] [Nat]Added 358 Read/Feed constraints in 63 ms returned sat
[2025-05-29 19:50:03] [INFO ] Computed and/alt/rep : 285/943/285 causal constraints (skipped 115 transitions) in 44 ms.
[2025-05-29 19:50:03] [INFO ] Added : 13 causal constraints over 3 iterations in 180 ms. Result :sat
Minimization took 392 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 410/410 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 160 transition count 407
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 160 transition count 406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 159 transition count 406
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 159 transition count 406
Applied a total of 12 rules in 44 ms. Remains 159 /163 variables (removed 4) and now considering 406/410 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 159/163 places, 406/410 transitions.
// Phase 1: matrix 406 rows 159 cols
[2025-05-29 19:50:04] [INFO ] Computed 11 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (18837 resets) in 2971 ms. (336 steps per ms)
BEST_FIRST walk for 1000001 steps (1756 resets) in 572 ms. (1745 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-05-29 19:50:07] [INFO ] Invariant cache hit.
[2025-05-29 19:50:07] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-05-29 19:50:07] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2025-05-29 19:50:07] [INFO ] State equation strengthened by 368 read => feed constraints.
[2025-05-29 19:50:07] [INFO ] [Real]Added 368 Read/Feed constraints in 41 ms returned sat
[2025-05-29 19:50:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:50:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-05-29 19:50:08] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2025-05-29 19:50:08] [INFO ] [Nat]Added 368 Read/Feed constraints in 47 ms returned sat
[2025-05-29 19:50:08] [INFO ] Computed and/alt/rep : 282/970/282 causal constraints (skipped 114 transitions) in 29 ms.
[2025-05-29 19:50:08] [INFO ] Added : 7 causal constraints over 2 iterations in 112 ms. Result :sat
Minimization took 478 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 406/406 transitions.
Applied a total of 0 rules in 11 ms. Remains 159 /159 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 159/159 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 406/406 transitions.
Applied a total of 0 rules in 10 ms. Remains 159 /159 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2025-05-29 19:50:08] [INFO ] Invariant cache hit.
[2025-05-29 19:50:09] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-05-29 19:50:09] [INFO ] Invariant cache hit.
[2025-05-29 19:50:09] [INFO ] State equation strengthened by 368 read => feed constraints.
[2025-05-29 19:50:10] [INFO ] Implicit Places using invariants and state equation in 951 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
[2025-05-29 19:50:10] [INFO ] Redundant transitions in 3 ms returned []
Running 396 sub problems to find dead transitions.
[2025-05-29 19:50:10] [INFO ] Invariant cache hit.
[2025-05-29 19:50:10] [INFO ] State equation strengthened by 368 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:50:12] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 2 ms to minimize.
[2025-05-29 19:50:12] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:50:12] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
[2025-05-29 19:50:12] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2025-05-29 19:50:12] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2025-05-29 19:50:12] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2025-05-29 19:50:12] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2025-05-29 19:50:12] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
[2025-05-29 19:50:12] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2025-05-29 19:50:13] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:50:13] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:50:13] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:50:13] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:50:13] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:50:13] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:50:14] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:50:14] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:50:14] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2025-05-29 19:50:14] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:50:14] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:50:14] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:50:14] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2025-05-29 19:50:14] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2025-05-29 19:50:14] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2025-05-29 19:50:14] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2025-05-29 19:50:14] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2025-05-29 19:50:14] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:50:15] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:50:15] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:50:15] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:50:15] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:50:15] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2025-05-29 19:50:15] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
[2025-05-29 19:50:16] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2025-05-29 19:50:16] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2025-05-29 19:50:16] [INFO ] Deduced a trap composed of 2 places in 103 ms of which 2 ms to minimize.
[2025-05-29 19:50:16] [INFO ] Deduced a trap composed of 2 places in 116 ms of which 2 ms to minimize.
[2025-05-29 19:50:16] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2025-05-29 19:50:16] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:50:16] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:50:16] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2025-05-29 19:50:16] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2025-05-29 19:50:16] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2025-05-29 19:50:17] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:50:17] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:50:17] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2025-05-29 19:50:17] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:50:17] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2025-05-29 19:50:18] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 3 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:50:22] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:50:23] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:50:23] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2025-05-29 19:50:23] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2025-05-29 19:50:23] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2025-05-29 19:50:23] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2025-05-29 19:50:24] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2025-05-29 19:50:24] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2025-05-29 19:50:24] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2025-05-29 19:50:24] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 2 ms to minimize.
[2025-05-29 19:50:24] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2025-05-29 19:50:24] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2025-05-29 19:50:24] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2025-05-29 19:50:24] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2025-05-29 19:50:24] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2025-05-29 19:50:24] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2025-05-29 19:50:24] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2025-05-29 19:50:25] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2025-05-29 19:50:25] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2025-05-29 19:50:25] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:50:25] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:50:25] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2025-05-29 19:50:26] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:50:26] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:50:26] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:50:26] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:50:26] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:50:26] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2025-05-29 19:50:26] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:50:27] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2025-05-29 19:50:27] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2025-05-29 19:50:27] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2025-05-29 19:50:27] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2025-05-29 19:50:27] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2025-05-29 19:50:27] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2025-05-29 19:50:27] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2025-05-29 19:50:27] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2025-05-29 19:50:27] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2025-05-29 19:50:28] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
[2025-05-29 19:50:28] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:50:28] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:50:28] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:50:29] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2025-05-29 19:50:29] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2025-05-29 19:50:29] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2025-05-29 19:50:29] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2025-05-29 19:50:29] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2025-05-29 19:50:29] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2025-05-29 19:50:31] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2025-05-29 19:50:31] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2025-05-29 19:50:31] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
[2025-05-29 19:50:31] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:50:31] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:50:31] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 14/125 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:50:34] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:50:37] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:50:39] [INFO ] Deduced a trap composed of 2 places in 110 ms of which 2 ms to minimize.
[2025-05-29 19:50:39] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/565 variables, and 129 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/159 constraints, ReadFeed: 0/368 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 118/118 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 118/129 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:50:40] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2025-05-29 19:50:41] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:50:41] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2025-05-29 19:50:41] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:50:41] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2025-05-29 19:50:41] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:50:41] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:50:41] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:50:43] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2025-05-29 19:50:43] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2025-05-29 19:50:44] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:50:44] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2025-05-29 19:50:44] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:50:44] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2025-05-29 19:50:44] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2025-05-29 19:50:44] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2025-05-29 19:50:44] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2025-05-29 19:50:44] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2025-05-29 19:50:44] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:50:44] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:50:46] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2025-05-29 19:50:46] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2025-05-29 19:50:46] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2025-05-29 19:50:46] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2025-05-29 19:50:46] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 3 ms to minimize.
[2025-05-29 19:50:46] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2025-05-29 19:50:46] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2025-05-29 19:50:47] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2025-05-29 19:50:47] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:50:47] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:50:48] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2025-05-29 19:50:49] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2025-05-29 19:50:49] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2025-05-29 19:50:49] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:50:50] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (OVERLAPS) 406/564 variables, 158/322 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Problem TDEAD144 is UNSAT
Problem TDEAD402 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 368/690 constraints. Problems are: Problem set: 2 solved, 394 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 394/1084 constraints. Problems are: Problem set: 2 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/565 variables, and 1084 constraints, problems are : Problem set: 2 solved, 394 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 158/159 constraints, ReadFeed: 368/368 constraints, PredecessorRefiner: 394/396 constraints, Known Traps: 153/153 constraints]
After SMT, in 60161ms problems are : Problem set: 2 solved, 394 unsolved
Search for dead transitions found 2 dead transitions in 60169ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 159/159 places, 404/406 transitions.
Graph (complete) has 726 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 157 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 402
Applied a total of 3 rules in 13 ms. Remains 157 /159 variables (removed 2) and now considering 402/404 (removed 2) transitions.
// Phase 1: matrix 402 rows 157 cols
[2025-05-29 19:51:10] [INFO ] Computed 11 invariants in 2 ms
[2025-05-29 19:51:10] [INFO ] Implicit Places using invariants in 217 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 235 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 156/159 places, 402/406 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 155 transition count 409
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 155 transition count 401
Applied a total of 10 rules in 20 ms. Remains 155 /156 variables (removed 1) and now considering 401/402 (removed 1) transitions.
// Phase 1: matrix 401 rows 155 cols
[2025-05-29 19:51:10] [INFO ] Computed 10 invariants in 2 ms
[2025-05-29 19:51:10] [INFO ] Implicit Places using invariants in 197 ms returned []
[2025-05-29 19:51:10] [INFO ] Invariant cache hit.
[2025-05-29 19:51:10] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-29 19:51:11] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 155/159 places, 401/406 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 62587 ms. Remains : 155/159 places, 401/406 transitions.
[2025-05-29 19:51:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20655 resets) in 2517 ms. (397 steps per ms)
BEST_FIRST walk for 1000001 steps (1865 resets) in 578 ms. (1727 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-05-29 19:51:14] [INFO ] Invariant cache hit.
[2025-05-29 19:51:14] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2025-05-29 19:51:14] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 19:51:14] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2025-05-29 19:51:14] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-29 19:51:14] [INFO ] [Real]Added 356 Read/Feed constraints in 44 ms returned sat
[2025-05-29 19:51:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:51:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-05-29 19:51:14] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 19:51:14] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2025-05-29 19:51:14] [INFO ] [Nat]Added 356 Read/Feed constraints in 46 ms returned sat
[2025-05-29 19:51:14] [INFO ] Computed and/alt/rep : 250/824/250 causal constraints (skipped 141 transitions) in 30 ms.
[2025-05-29 19:51:15] [INFO ] Added : 8 causal constraints over 2 iterations in 114 ms. Result :sat
Minimization took 275 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 7 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 155/155 places, 401/401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 7 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2025-05-29 19:51:15] [INFO ] Invariant cache hit.
[2025-05-29 19:51:15] [INFO ] Implicit Places using invariants in 210 ms returned []
[2025-05-29 19:51:15] [INFO ] Invariant cache hit.
[2025-05-29 19:51:15] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-29 19:51:16] [INFO ] Implicit Places using invariants and state equation in 842 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
[2025-05-29 19:51:16] [INFO ] Redundant transitions in 25 ms returned []
Running 391 sub problems to find dead transitions.
[2025-05-29 19:51:16] [INFO ] Invariant cache hit.
[2025-05-29 19:51:16] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/555 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 356/520 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2025-05-29 19:51:26] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 391 unsolved
SMT process timed out in 30212ms, After SMT, problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 30220ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31326 ms. Remains : 155/155 places, 401/401 transitions.
[2025-05-29 19:51:46] [INFO ] Flatten gal took : 53 ms
RANDOM walk for 40000 steps (819 resets) in 259 ms. (153 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (70 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (75 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
[2025-05-29 19:51:46] [INFO ] Flatten gal took : 42 ms
[2025-05-29 19:51:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7145350880976309577.gal : 13 ms
[2025-05-29 19:51:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7192480923544296707.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/ReachabilityCardinality7145350880976309577.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7192480923544296707.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/ReachabilityCardinality7192480923544296707.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 38
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :38 after 44
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :44 after 46
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :46 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 73
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :73 after 403
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :403 after 518
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :518 after 2001
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2001 after 4515
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4515 after 12829
Interrupted probabilistic random walk after 584519 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :0 out of 2
Probabilistic random walk after 584519 steps, saw 76970 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
[2025-05-29 19:51:49] [INFO ] Invariant cache hit.
[2025-05-29 19:51:49] [INFO ] State equation strengthened by 356 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 149/201 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 110/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 26/227 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 8/235 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 285/520 variables, 74/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 236/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 19 (OVERLAPS) 36/556 variables, 36/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/556 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/556 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 505 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 149/201 variables, 29/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 110/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/227 variables, 1/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 3/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/235 variables, 8/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 8/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 1/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/235 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 285/520 variables, 74/250 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 236/486 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 0/486 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 36/556 variables, 36/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/556 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/556 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 522 constraints, problems are : Problem set: 1 solved, 1 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 920ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 155/155 places, 401/401 transitions.
RANDOM walk for 40000 steps (822 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (69 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :12829 after 164896
Interrupted probabilistic random walk after 1121303 steps, run timeout after 3001 ms. (steps per millisecond=373 ) properties seen :0 out of 1
Probabilistic random walk after 1121303 steps, saw 142240 distinct states, run finished after 3001 ms. (steps per millisecond=373 ) properties seen :0
[2025-05-29 19:51:53] [INFO ] Invariant cache hit.
[2025-05-29 19:51:53] [INFO ] State equation strengthened by 356 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 149/201 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 110/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/227 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/235 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 285/520 variables, 74/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 236/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 36/556 variables, 36/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/556 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/556 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 149/201 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 110/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/227 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/235 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/235 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 285/520 variables, 74/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 236/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 36/556 variables, 36/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/556 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/556 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 522 constraints, problems are : Problem set: 0 solved, 1 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 751ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 7 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 155/155 places, 401/401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 12 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2025-05-29 19:51:54] [INFO ] Invariant cache hit.
[2025-05-29 19:51:54] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-05-29 19:51:54] [INFO ] Invariant cache hit.
[2025-05-29 19:51:55] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-29 19:51:55] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
[2025-05-29 19:51:55] [INFO ] Redundant transitions in 9 ms returned []
Running 391 sub problems to find dead transitions.
[2025-05-29 19:51:55] [INFO ] Invariant cache hit.
[2025-05-29 19:51:55] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/555 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 356/520 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2025-05-29 19:52:05] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :164896 after 3.73296e+06
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 391 unsolved
SMT process timed out in 30131ms, After SMT, problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 30135ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31251 ms. Remains : 155/155 places, 401/401 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 327 edges and 155 vertex of which 115 / 155 are part of one of the 3 SCC in 1 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 268 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 348 transitions.
Graph (complete) has 106 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 40 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 2 transition count 3
Applied a total of 51 rules in 9 ms. Remains 2 /155 variables (removed 153) and now considering 3/401 (removed 398) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2025-05-29 19:52:25] [INFO ] Computed 0 invariants in 0 ms
[2025-05-29 19:52:25] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 19:52:25] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 19:52:25] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 19:52:25] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 19:52:25] [INFO ] Flatten gal took : 1 ms
[2025-05-29 19:52:25] [INFO ] Flatten gal took : 1 ms
[2025-05-29 19:52:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4447408905645161611.gal : 1 ms
[2025-05-29 19:52:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1811890826407585577.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/ReachabilityCardinality4447408905645161611.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1811890826407585577.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/ReachabilityCardinality1811890826407585577.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
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,9,0.002917,3484,2,7,7,42,6,0,13,34,0
Total reachable state count : 9

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

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,2,0.00355,3860,2,3,7,42,7,0,16,34,0
Over-approximation ignoring read arcs solved 0 properties in 80 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-29 19:52:26] [INFO ] Flatten gal took : 35 ms
[2025-05-29 19:52:26] [INFO ] Applying decomposition
[2025-05-29 19:52:26] [INFO ] Flatten gal took : 33 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/graph9497408572442331228.txt' '-o' '/tmp/graph9497408572442331228.bin' '-w' '/tmp/graph9497408572442331228.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9497408572442331228.bin' '-l' '-1' '-v' '-w' '/tmp/graph9497408572442331228.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:52:26] [INFO ] Decomposing Gal with order
[2025-05-29 19:52:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:52:26] [INFO ] Removed a total of 326 redundant transitions.
[2025-05-29 19:52:26] [INFO ] Flatten gal took : 87 ms
[2025-05-29 19:52:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 262 labels/synchronizations in 28 ms.
[2025-05-29 19:52:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17124536431025805696.gal : 9 ms
[2025-05-29 19:52:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality256619002441645165.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/ReachabilityCardinality17124536431025805696.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality256619002441645165.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/ReachabilityCardinality256619002441645165.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 23
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :23 after 23
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :23 after 23
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :23 after 23
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 23
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :23 after 258
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :258 after 8290
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8290 after 85633
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :85633 after 710292
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.05078e+08 after 5.29889e+08
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-02 in 193608 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 410 rows 163 cols
[2025-05-29 19:53:16] [INFO ] Computed 11 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (189 resets) in 32 ms. (303 steps per ms)
BEST_FIRST walk for 10001 steps (18 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-05-29 19:53:16] [INFO ] Invariant cache hit.
[2025-05-29 19:53:16] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-05-29 19:53:16] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2025-05-29 19:53:16] [INFO ] State equation strengthened by 358 read => feed constraints.
[2025-05-29 19:53:16] [INFO ] [Real]Added 358 Read/Feed constraints in 55 ms returned sat
[2025-05-29 19:53:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:53:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-05-29 19:53:17] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2025-05-29 19:53:17] [INFO ] [Nat]Added 358 Read/Feed constraints in 56 ms returned sat
[2025-05-29 19:53:17] [INFO ] Computed and/alt/rep : 285/943/285 causal constraints (skipped 115 transitions) in 46 ms.
[2025-05-29 19:53:17] [INFO ] Added : 3 causal constraints over 1 iterations in 119 ms. Result :sat
Minimization took 475 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 410/410 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 160 transition count 407
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 160 transition count 406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 159 transition count 406
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 159 transition count 406
Applied a total of 12 rules in 34 ms. Remains 159 /163 variables (removed 4) and now considering 406/410 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 159/163 places, 406/410 transitions.
// Phase 1: matrix 406 rows 159 cols
[2025-05-29 19:53:17] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (18844 resets) in 2623 ms. (381 steps per ms)
BEST_FIRST walk for 1000001 steps (1750 resets) in 572 ms. (1745 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-05-29 19:53:21] [INFO ] Invariant cache hit.
[2025-05-29 19:53:21] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-05-29 19:53:21] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2025-05-29 19:53:21] [INFO ] State equation strengthened by 368 read => feed constraints.
[2025-05-29 19:53:21] [INFO ] [Real]Added 368 Read/Feed constraints in 41 ms returned sat
[2025-05-29 19:53:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:53:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-05-29 19:53:21] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2025-05-29 19:53:21] [INFO ] [Nat]Added 368 Read/Feed constraints in 41 ms returned sat
[2025-05-29 19:53:21] [INFO ] Computed and/alt/rep : 283/979/283 causal constraints (skipped 113 transitions) in 28 ms.
[2025-05-29 19:53:21] [INFO ] Added : 3 causal constraints over 1 iterations in 114 ms. Result :sat
Minimization took 419 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 406/406 transitions.
Applied a total of 0 rules in 8 ms. Remains 159 /159 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 159/159 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 406/406 transitions.
Applied a total of 0 rules in 8 ms. Remains 159 /159 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2025-05-29 19:53:22] [INFO ] Invariant cache hit.
[2025-05-29 19:53:22] [INFO ] Implicit Places using invariants in 271 ms returned []
[2025-05-29 19:53:22] [INFO ] Invariant cache hit.
[2025-05-29 19:53:22] [INFO ] State equation strengthened by 368 read => feed constraints.
[2025-05-29 19:53:23] [INFO ] Implicit Places using invariants and state equation in 976 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
[2025-05-29 19:53:23] [INFO ] Redundant transitions in 13 ms returned []
Running 396 sub problems to find dead transitions.
[2025-05-29 19:53:23] [INFO ] Invariant cache hit.
[2025-05-29 19:53:23] [INFO ] State equation strengthened by 368 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:53:26] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2025-05-29 19:53:26] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:53:26] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:53:26] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:53:26] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2025-05-29 19:53:26] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2025-05-29 19:53:26] [INFO ] Deduced a trap composed of 2 places in 153 ms of which 3 ms to minimize.
[2025-05-29 19:53:26] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 2 ms to minimize.
[2025-05-29 19:53:26] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 3 ms to minimize.
[2025-05-29 19:53:27] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2025-05-29 19:53:27] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2025-05-29 19:53:27] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2025-05-29 19:53:27] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2025-05-29 19:53:27] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2025-05-29 19:53:27] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2025-05-29 19:53:27] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2025-05-29 19:53:27] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 2 ms to minimize.
[2025-05-29 19:53:27] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
[2025-05-29 19:53:27] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:53:28] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:53:28] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2025-05-29 19:53:28] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2025-05-29 19:53:28] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2025-05-29 19:53:28] [INFO ] Deduced a trap composed of 2 places in 138 ms of which 3 ms to minimize.
[2025-05-29 19:53:28] [INFO ] Deduced a trap composed of 2 places in 140 ms of which 2 ms to minimize.
[2025-05-29 19:53:28] [INFO ] Deduced a trap composed of 2 places in 141 ms of which 2 ms to minimize.
[2025-05-29 19:53:29] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 3 ms to minimize.
[2025-05-29 19:53:29] [INFO ] Deduced a trap composed of 2 places in 137 ms of which 3 ms to minimize.
[2025-05-29 19:53:29] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 3 ms to minimize.
[2025-05-29 19:53:29] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 2 ms to minimize.
[2025-05-29 19:53:29] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 2 ms to minimize.
[2025-05-29 19:53:29] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2025-05-29 19:53:29] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2025-05-29 19:53:29] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2025-05-29 19:53:29] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2025-05-29 19:53:30] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2025-05-29 19:53:30] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2025-05-29 19:53:30] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2025-05-29 19:53:30] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2025-05-29 19:53:30] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:53:30] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2025-05-29 19:53:30] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2025-05-29 19:53:30] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2025-05-29 19:53:30] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2025-05-29 19:53:31] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2025-05-29 19:53:31] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2025-05-29 19:53:31] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2025-05-29 19:53:31] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2025-05-29 19:53:31] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2025-05-29 19:53:31] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:53:31] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2025-05-29 19:53:31] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2025-05-29 19:53:31] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2025-05-29 19:53:31] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2025-05-29 19:53:31] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2025-05-29 19:53:31] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2025-05-29 19:53:31] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2025-05-29 19:53:32] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2025-05-29 19:53:32] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 3 ms to minimize.
[2025-05-29 19:53:32] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:53:34] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:53:34] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2025-05-29 19:53:35] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:53:35] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:53:35] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:53:35] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:53:35] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:53:35] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:53:35] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:53:35] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:53:35] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:53:35] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:53:35] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:53:35] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2025-05-29 19:53:35] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:53:35] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:53:36] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:53:36] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:53:36] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:53:36] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:53:36] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2025-05-29 19:53:36] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2025-05-29 19:53:38] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2025-05-29 19:53:38] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2025-05-29 19:53:38] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2025-05-29 19:53:38] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2025-05-29 19:53:38] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2025-05-29 19:53:38] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2025-05-29 19:53:38] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2025-05-29 19:53:38] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2025-05-29 19:53:38] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2025-05-29 19:53:38] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:53:39] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2025-05-29 19:53:39] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2025-05-29 19:53:39] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2025-05-29 19:53:39] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2025-05-29 19:53:39] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2025-05-29 19:53:39] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2025-05-29 19:53:39] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2025-05-29 19:53:39] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:53:40] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:53:40] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:53:40] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:53:40] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:53:40] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:53:40] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2025-05-29 19:53:40] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2025-05-29 19:53:40] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2025-05-29 19:53:41] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2025-05-29 19:53:41] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2025-05-29 19:53:41] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2025-05-29 19:53:41] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2025-05-29 19:53:41] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2025-05-29 19:53:41] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 3 ms to minimize.
[2025-05-29 19:53:41] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
[2025-05-29 19:53:41] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:53:41] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2025-05-29 19:53:42] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:53:42] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2025-05-29 19:53:42] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:53:44] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2025-05-29 19:53:45] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2025-05-29 19:53:45] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2025-05-29 19:53:45] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2025-05-29 19:53:45] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2025-05-29 19:53:45] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:53:45] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:53:45] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:53:45] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:53:46] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2025-05-29 19:53:47] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2025-05-29 19:53:47] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 12/143 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:53:48] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:53:48] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:53:48] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
[2025-05-29 19:53:48] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:53:48] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2025-05-29 19:53:48] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2025-05-29 19:53:48] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2025-05-29 19:53:48] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:53:48] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2025-05-29 19:53:49] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:53:49] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2025-05-29 19:53:49] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2025-05-29 19:53:49] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2025-05-29 19:53:51] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2025-05-29 19:53:51] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2025-05-29 19:53:51] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 16/159 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:53:51] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:53:51] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:53:52] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:53:52] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:53:52] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:53:52] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:53:52] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/565 variables, and 166 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/159 constraints, ReadFeed: 0/368 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 155/155 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 155/166 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:53:55] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:53:55] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:53:56] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:53:56] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:53:57] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:53:59] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:54:00] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2025-05-29 19:54:00] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:54:03] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:54:03] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:54:05] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2025-05-29 19:54:05] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2025-05-29 19:54:07] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:54:07] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:54:10] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:54:10] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2025-05-29 19:54:10] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:54:11] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:54:12] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
[2025-05-29 19:54:12] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:54:15] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:54:15] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:54:15] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:54:15] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:54:15] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2025-05-29 19:54:15] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 6/192 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:54:17] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:54:19] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:54:19] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:54:22] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2025-05-29 19:54:22] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 158/565 variables, and 197 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/159 constraints, ReadFeed: 0/368 constraints, PredecessorRefiner: 0/396 constraints, Known Traps: 186/186 constraints]
After SMT, in 60224ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60232ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61510 ms. Remains : 159/159 places, 406/406 transitions.
[2025-05-29 19:54:23] [INFO ] Flatten gal took : 67 ms
[2025-05-29 19:54:23] [INFO ] Flatten gal took : 30 ms
[2025-05-29 19:54:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality875445044450226624.gal : 17 ms
[2025-05-29 19:54:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8582160039578485041.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/ReachabilityCardinality875445044450226624.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8582160039578485041.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
RANDOM walk for 40000 steps (747 resets) in 627 ms. (63 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality8582160039578485041.prop.
BEST_FIRST walk for 40003 steps (67 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (68 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 38
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :38 after 43
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :43 after 44
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :44 after 46
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :46 after 52
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :52 after 78
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :78 after 441
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :441 after 570
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :570 after 2100
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2100 after 6749
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6749 after 63537
Interrupted probabilistic random walk after 793111 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :0 out of 2
Probabilistic random walk after 793111 steps, saw 102973 distinct states, run finished after 3001 ms. (steps per millisecond=264 ) properties seen :0
[2025-05-29 19:54:26] [INFO ] Invariant cache hit.
[2025-05-29 19:54:26] [INFO ] State equation strengthened by 368 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) 147/148 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 19:54:27] [INFO ] Deduced a trap composed of 2 places in 127 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
[2025-05-29 19:54:27] [INFO ] Deduced a trap composed of 2 places in 137 ms of which 3 ms to minimize.
[2025-05-29 19:54:27] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 3 ms to minimize.
[2025-05-29 19:54:27] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 3 ms to minimize.
[2025-05-29 19:54:27] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 2 ms to minimize.
[2025-05-29 19:54:27] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 2 ms to minimize.
[2025-05-29 19:54:27] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 2 ms to minimize.
[2025-05-29 19:54:27] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 2 ms to minimize.
[2025-05-29 19:54:28] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 9/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/157 variables, 9/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 406/563 variables, 157/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 368/545 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/545 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/565 variables, 2/547 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 0/547 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/565 variables, 0/547 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 547 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1351 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 159/159 constraints, ReadFeed: 368/368 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 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) 147/148 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 9/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 19:54:28] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2025-05-29 19:54:28] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/157 variables, 9/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 406/563 variables, 157/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 368/547 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 1/548 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 0/548 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/565 variables, 2/550 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 0/550 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/565 variables, 0/550 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 550 constraints, problems are : Problem set: 1 solved, 1 unsolved in 420 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 159/159 constraints, ReadFeed: 368/368 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 1795ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 406/406 transitions.
Applied a total of 0 rules in 6 ms. Remains 159 /159 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 159/159 places, 406/406 transitions.
RANDOM walk for 40000 steps (753 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (64 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :63537 after 203056
Interrupted probabilistic random walk after 1192174 steps, run timeout after 3001 ms. (steps per millisecond=397 ) properties seen :0 out of 1
Probabilistic random walk after 1192174 steps, saw 152685 distinct states, run finished after 3001 ms. (steps per millisecond=397 ) properties seen :0
[2025-05-29 19:54:31] [INFO ] Invariant cache hit.
[2025-05-29 19:54:31] [INFO ] State equation strengthened by 368 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) 147/148 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:54:31] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/157 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 406/563 variables, 157/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 368/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/565 variables, 2/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/565 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 539 constraints, problems are : Problem set: 0 solved, 1 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 159/159 constraints, ReadFeed: 368/368 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) 147/148 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:54:32] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2025-05-29 19:54:32] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/157 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 406/563 variables, 157/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 368/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/565 variables, 2/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/565 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 542 constraints, problems are : Problem set: 0 solved, 1 unsolved in 549 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 159/159 constraints, ReadFeed: 368/368 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 965ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 406/406 transitions.
Applied a total of 0 rules in 9 ms. Remains 159 /159 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 159/159 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 406/406 transitions.
Applied a total of 0 rules in 8 ms. Remains 159 /159 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2025-05-29 19:54:32] [INFO ] Invariant cache hit.
[2025-05-29 19:54:33] [INFO ] Implicit Places using invariants in 310 ms returned []
[2025-05-29 19:54:33] [INFO ] Invariant cache hit.
[2025-05-29 19:54:33] [INFO ] State equation strengthened by 368 read => feed constraints.
[2025-05-29 19:54:34] [INFO ] Implicit Places using invariants and state equation in 995 ms returned []
Implicit Place search using SMT with State Equation took 1307 ms to find 0 implicit places.
[2025-05-29 19:54:34] [INFO ] Redundant transitions in 5 ms returned []
Running 396 sub problems to find dead transitions.
[2025-05-29 19:54:34] [INFO ] Invariant cache hit.
[2025-05-29 19:54:34] [INFO ] State equation strengthened by 368 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:54:36] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:54:36] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:54:36] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:54:36] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2025-05-29 19:54:36] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2025-05-29 19:54:36] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2025-05-29 19:54:36] [INFO ] Deduced a trap composed of 2 places in 108 ms of which 2 ms to minimize.
[2025-05-29 19:54:37] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2025-05-29 19:54:37] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2025-05-29 19:54:37] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2025-05-29 19:54:37] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2025-05-29 19:54:37] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2025-05-29 19:54:37] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2025-05-29 19:54:37] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2025-05-29 19:54:37] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 5 ms to minimize.
[2025-05-29 19:54:37] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2025-05-29 19:54:37] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2025-05-29 19:54:37] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2025-05-29 19:54:38] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:54:38] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:54:38] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:54:38] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2025-05-29 19:54:38] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2025-05-29 19:54:38] [INFO ] Deduced a trap composed of 2 places in 95 ms of which 2 ms to minimize.
[2025-05-29 19:54:38] [INFO ] Deduced a trap composed of 2 places in 103 ms of which 2 ms to minimize.
[2025-05-29 19:54:39] [INFO ] Deduced a trap composed of 2 places in 105 ms of which 2 ms to minimize.
[2025-05-29 19:54:39] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2025-05-29 19:54:39] [INFO ] Deduced a trap composed of 2 places in 95 ms of which 2 ms to minimize.
[2025-05-29 19:54:39] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
[2025-05-29 19:54:39] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2025-05-29 19:54:39] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2025-05-29 19:54:39] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2025-05-29 19:54:39] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2025-05-29 19:54:39] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2025-05-29 19:54:39] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:54:39] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2025-05-29 19:54:40] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2025-05-29 19:54:40] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2025-05-29 19:54:40] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2025-05-29 19:54:40] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:54:40] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2025-05-29 19:54:40] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2025-05-29 19:54:40] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2025-05-29 19:54:40] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2025-05-29 19:54:40] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2025-05-29 19:54:40] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2025-05-29 19:54:41] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2025-05-29 19:54:41] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2025-05-29 19:54:41] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:54:41] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2025-05-29 19:54:41] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2025-05-29 19:54:41] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2025-05-29 19:54:41] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 3 ms to minimize.
[2025-05-29 19:54:41] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 3 ms to minimize.
[2025-05-29 19:54:41] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2025-05-29 19:54:41] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2025-05-29 19:54:41] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2025-05-29 19:54:42] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2025-05-29 19:54:42] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2025-05-29 19:54:42] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:54:44] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:54:44] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:54:44] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2025-05-29 19:54:44] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:54:44] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:54:44] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:54:44] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:54:44] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:54:44] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:54:44] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:54:44] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:54:44] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:54:45] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2025-05-29 19:54:45] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:54:45] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2025-05-29 19:54:45] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2025-05-29 19:54:45] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2025-05-29 19:54:45] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2025-05-29 19:54:45] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2025-05-29 19:54:45] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:54:46] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2025-05-29 19:54:46] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2025-05-29 19:54:47] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2025-05-29 19:54:47] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2025-05-29 19:54:47] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2025-05-29 19:54:47] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2025-05-29 19:54:47] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2025-05-29 19:54:47] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2025-05-29 19:54:47] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2025-05-29 19:54:47] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2025-05-29 19:54:47] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2025-05-29 19:54:47] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:54:48] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2025-05-29 19:54:48] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:54:48] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2025-05-29 19:54:48] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2025-05-29 19:54:48] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2025-05-29 19:54:48] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2025-05-29 19:54:48] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2025-05-29 19:54:49] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:54:49] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:54:49] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:54:49] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:54:49] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:54:49] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:54:49] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2025-05-29 19:54:49] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:54:50] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2025-05-29 19:54:50] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2025-05-29 19:54:50] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2025-05-29 19:54:50] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2025-05-29 19:54:50] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2025-05-29 19:54:50] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2025-05-29 19:54:50] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:54:50] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:54:50] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:54:50] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
[2025-05-29 19:54:51] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2025-05-29 19:54:51] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:54:51] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 396 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
[2025-05-29 19:54:54] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:54:54] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
SDD size :203056 after 4.8232e+06
[2025-05-29 19:54:54] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:54:54] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2025-05-29 19:54:54] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2025-05-29 19:54:54] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2025-05-29 19:54:54] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2025-05-29 19:54:54] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:54:54] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:54:56] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:54:57] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2025-05-29 19:54:57] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 12/143 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:54:57] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:54:57] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2025-05-29 19:54:57] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2025-05-29 19:54:57] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2025-05-29 19:54:58] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2025-05-29 19:54:58] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2025-05-29 19:54:58] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2025-05-29 19:54:58] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2025-05-29 19:54:58] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:54:58] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:54:58] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:54:59] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:54:59] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2025-05-29 19:55:00] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2025-05-29 19:55:00] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2025-05-29 19:55:00] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 16/159 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:55:01] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
[2025-05-29 19:55:01] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2025-05-29 19:55:01] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:55:01] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:55:01] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:55:01] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:55:02] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:55:03] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:55:03] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/565 variables, and 168 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/159 constraints, ReadFeed: 0/368 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 157/157 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 157/168 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:55:05] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:55:05] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:55:05] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2025-05-29 19:55:06] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2025-05-29 19:55:06] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2025-05-29 19:55:07] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 6/174 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:55:08] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:55:08] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:55:08] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:55:10] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2025-05-29 19:55:10] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:55:10] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2025-05-29 19:55:11] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:55:11] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:55:11] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:55:11] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:55:11] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 11/185 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 19:55:11] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:55:12] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:55:12] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:55:12] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:55:12] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:55:13] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2025-05-29 19:55:13] [INFO ] Flatten gal took : 16 ms
[2025-05-29 19:55:13] [INFO ] Applying decomposition
[2025-05-29 19:55:13] [INFO ] Flatten gal took : 19 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/graph9519852918030919422.txt' '-o' '/tmp/graph9519852918030919422.bin' '-w' '/tmp/graph9519852918030919422.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9519852918030919422.bin' '-l' '-1' '-v' '-w' '/tmp/graph9519852918030919422.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:55:13] [INFO ] Decomposing Gal with order
[2025-05-29 19:55:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:55:13] [INFO ] Removed a total of 322 redundant transitions.
[2025-05-29 19:55:13] [INFO ] Flatten gal took : 46 ms
[2025-05-29 19:55:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 222 labels/synchronizations in 16 ms.
[2025-05-29 19:55:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13909996476934125391.gal : 6 ms
[2025-05-29 19:55:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3100109569502875618.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/ReachabilityCardinality13909996476934125391.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3100109569502875618.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/ReachabilityCardinality3100109569502875618.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 25
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :25 after 181
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :181 after 182
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :182 after 1211
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1211 after 3473
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3473 after 22304
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :22304 after 343812
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 6/191 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (OVERLAPS) 406/564 variables, 158/349 constraints. Problems are: Problem set: 0 solved, 396 unsolved
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :343812 after 6.19236e+06
Problem TDEAD144 is UNSAT
Problem TDEAD402 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 368/717 constraints. Problems are: Problem set: 2 solved, 394 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 394/1111 constraints. Problems are: Problem set: 2 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/565 variables, and 1111 constraints, problems are : Problem set: 2 solved, 394 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 158/159 constraints, ReadFeed: 368/368 constraints, PredecessorRefiner: 394/396 constraints, Known Traps: 180/180 constraints]
After SMT, in 60185ms problems are : Problem set: 2 solved, 394 unsolved
Search for dead transitions found 2 dead transitions in 60191ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 159/159 places, 404/406 transitions.
Graph (complete) has 726 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 157 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 402
Applied a total of 3 rules in 8 ms. Remains 157 /159 variables (removed 2) and now considering 402/404 (removed 2) transitions.
// Phase 1: matrix 402 rows 157 cols
[2025-05-29 19:55:34] [INFO ] Computed 11 invariants in 14 ms
[2025-05-29 19:55:34] [INFO ] Implicit Places using invariants in 179 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 180 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 156/159 places, 402/406 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 155 transition count 409
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 155 transition count 401
Applied a total of 10 rules in 17 ms. Remains 155 /156 variables (removed 1) and now considering 401/402 (removed 1) transitions.
// Phase 1: matrix 401 rows 155 cols
[2025-05-29 19:55:34] [INFO ] Computed 10 invariants in 2 ms
[2025-05-29 19:55:34] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-05-29 19:55:34] [INFO ] Invariant cache hit.
[2025-05-29 19:55:34] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-29 19:55:35] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 155/159 places, 401/406 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 62539 ms. Remains : 155/159 places, 401/406 transitions.
RANDOM walk for 40000 steps (822 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (74 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1158690 steps, run timeout after 3001 ms. (steps per millisecond=386 ) properties seen :0 out of 1
Probabilistic random walk after 1158690 steps, saw 147542 distinct states, run finished after 3001 ms. (steps per millisecond=386 ) properties seen :0
[2025-05-29 19:55:38] [INFO ] Invariant cache hit.
[2025-05-29 19:55:38] [INFO ] State equation strengthened by 356 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/36 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 112/148 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 69/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/174 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/182 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 8/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 325/507 variables, 72/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/507 variables, 277/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/507 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 49/556 variables, 49/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/556 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/556 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/36 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 112/148 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 69/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/174 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/174 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/182 variables, 8/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:55:38] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/182 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 325/507 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/507 variables, 277/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/507 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 49/556 variables, 49/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/556 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/556 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 523 constraints, problems are : Problem set: 0 solved, 1 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 570ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 8 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 155/155 places, 401/401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2025-05-29 19:55:38] [INFO ] Invariant cache hit.
[2025-05-29 19:55:39] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-05-29 19:55:39] [INFO ] Invariant cache hit.
[2025-05-29 19:55:39] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-29 19:55:39] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
[2025-05-29 19:55:39] [INFO ] Redundant transitions in 3 ms returned []
Running 391 sub problems to find dead transitions.
[2025-05-29 19:55:39] [INFO ] Invariant cache hit.
[2025-05-29 19:55:39] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/555 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 356/520 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (OVERLAPS) 1/556 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Detected timeout of ITS tools.
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 556/556 variables, and 521 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/555 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 356/520 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 391/911 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (OVERLAPS) 1/556 variables, 1/912 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 9 (OVERLAPS) 0/556 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 912 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61066 ms. Remains : 155/155 places, 401/401 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-07 in 203550 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 410 rows 163 cols
[2025-05-29 19:56:40] [INFO ] Computed 11 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (190 resets) in 41 ms. (238 steps per ms)
BEST_FIRST walk for 10000 steps (16 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-05-29 19:56:40] [INFO ] Invariant cache hit.
[2025-05-29 19:56:40] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2025-05-29 19:56:40] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2025-05-29 19:56:40] [INFO ] State equation strengthened by 358 read => feed constraints.
[2025-05-29 19:56:40] [INFO ] [Real]Added 358 Read/Feed constraints in 63 ms returned sat
[2025-05-29 19:56:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:56:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-05-29 19:56:40] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2025-05-29 19:56:40] [INFO ] [Nat]Added 358 Read/Feed constraints in 99 ms returned sat
[2025-05-29 19:56:40] [INFO ] Computed and/alt/rep : 285/943/285 causal constraints (skipped 115 transitions) in 49 ms.
[2025-05-29 19:56:41] [INFO ] Added : 11 causal constraints over 3 iterations in 215 ms. Result :sat
Minimization took 511 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 410/410 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 160 transition count 407
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 160 transition count 407
Applied a total of 9 rules in 22 ms. Remains 160 /163 variables (removed 3) and now considering 407/410 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 160/163 places, 407/410 transitions.
// Phase 1: matrix 407 rows 160 cols
[2025-05-29 19:56:41] [INFO ] Computed 11 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (18967 resets) in 3027 ms. (330 steps per ms)
BEST_FIRST walk for 1000001 steps (1766 resets) in 572 ms. (1745 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-05-29 19:56:45] [INFO ] Invariant cache hit.
[2025-05-29 19:56:45] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-05-29 19:56:45] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2025-05-29 19:56:45] [INFO ] State equation strengthened by 367 read => feed constraints.
[2025-05-29 19:56:45] [INFO ] [Real]Added 367 Read/Feed constraints in 41 ms returned sat
[2025-05-29 19:56:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:56:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-05-29 19:56:45] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2025-05-29 19:56:45] [INFO ] [Nat]Added 367 Read/Feed constraints in 68 ms returned sat
[2025-05-29 19:56:45] [INFO ] Computed and/alt/rep : 283/970/283 causal constraints (skipped 114 transitions) in 47 ms.
[2025-05-29 19:56:45] [INFO ] Added : 13 causal constraints over 4 iterations in 250 ms. Result :sat
Minimization took 535 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 407/407 transitions.
Applied a total of 0 rules in 7 ms. Remains 160 /160 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 160/160 places, 407/407 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 407/407 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2025-05-29 19:56:46] [INFO ] Invariant cache hit.
[2025-05-29 19:56:46] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-05-29 19:56:46] [INFO ] Invariant cache hit.
[2025-05-29 19:56:46] [INFO ] State equation strengthened by 367 read => feed constraints.
[2025-05-29 19:56:47] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1113 ms to find 0 implicit places.
[2025-05-29 19:56:47] [INFO ] Redundant transitions in 5 ms returned []
Running 397 sub problems to find dead transitions.
[2025-05-29 19:56:47] [INFO ] Invariant cache hit.
[2025-05-29 19:56:47] [INFO ] State equation strengthened by 367 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:56:50] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:56:50] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2025-05-29 19:56:50] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2025-05-29 19:56:50] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2025-05-29 19:56:50] [INFO ] Deduced a trap composed of 2 places in 138 ms of which 3 ms to minimize.
[2025-05-29 19:56:51] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 3 ms to minimize.
[2025-05-29 19:56:51] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 3 ms to minimize.
[2025-05-29 19:56:51] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 2 ms to minimize.
[2025-05-29 19:56:51] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 3 ms to minimize.
[2025-05-29 19:56:51] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2025-05-29 19:56:51] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 2 ms to minimize.
[2025-05-29 19:56:51] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2025-05-29 19:56:51] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
[2025-05-29 19:56:51] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2025-05-29 19:56:52] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 3 ms to minimize.
[2025-05-29 19:56:52] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 3 ms to minimize.
[2025-05-29 19:56:52] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 3 ms to minimize.
[2025-05-29 19:56:52] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2025-05-29 19:56:52] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
[2025-05-29 19:56:52] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:56:53] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:56:53] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2025-05-29 19:56:53] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2025-05-29 19:56:53] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2025-05-29 19:56:53] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2025-05-29 19:56:53] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2025-05-29 19:56:53] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2025-05-29 19:56:53] [INFO ] Deduced a trap composed of 2 places in 117 ms of which 2 ms to minimize.
[2025-05-29 19:56:53] [INFO ] Deduced a trap composed of 2 places in 117 ms of which 3 ms to minimize.
[2025-05-29 19:56:53] [INFO ] Deduced a trap composed of 2 places in 137 ms of which 2 ms to minimize.
[2025-05-29 19:56:54] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 3 ms to minimize.
[2025-05-29 19:56:54] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 3 ms to minimize.
[2025-05-29 19:56:54] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:56:54] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2025-05-29 19:56:54] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 2 ms to minimize.
[2025-05-29 19:56:54] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 2 ms to minimize.
[2025-05-29 19:56:54] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2025-05-29 19:56:54] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 3 ms to minimize.
[2025-05-29 19:56:55] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2025-05-29 19:56:55] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:56:55] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 3 ms to minimize.
[2025-05-29 19:56:55] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 2 ms to minimize.
[2025-05-29 19:56:55] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2025-05-29 19:56:55] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
[2025-05-29 19:56:55] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2025-05-29 19:56:56] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2025-05-29 19:56:56] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2025-05-29 19:56:56] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2025-05-29 19:56:56] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2025-05-29 19:56:56] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2025-05-29 19:56:56] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2025-05-29 19:56:56] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2025-05-29 19:56:56] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2025-05-29 19:56:56] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
[2025-05-29 19:56:56] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2025-05-29 19:56:56] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:56:56] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2025-05-29 19:56:57] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2025-05-29 19:56:57] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2025-05-29 19:56:57] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:56:59] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2025-05-29 19:56:59] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2025-05-29 19:57:00] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2025-05-29 19:57:00] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2025-05-29 19:57:00] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2025-05-29 19:57:00] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2025-05-29 19:57:00] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2025-05-29 19:57:00] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2025-05-29 19:57:00] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2025-05-29 19:57:00] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2025-05-29 19:57:00] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2025-05-29 19:57:00] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2025-05-29 19:57:00] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2025-05-29 19:57:00] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:57:00] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:57:00] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:57:01] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:57:01] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:57:01] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
[2025-05-29 19:57:01] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:57:01] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2025-05-29 19:57:01] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2025-05-29 19:57:02] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:57:02] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:57:02] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:57:02] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:57:02] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:57:02] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2025-05-29 19:57:02] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2025-05-29 19:57:02] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2025-05-29 19:57:03] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2025-05-29 19:57:03] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2025-05-29 19:57:03] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:57:03] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:57:03] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2025-05-29 19:57:03] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2025-05-29 19:57:03] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 3 ms to minimize.
[2025-05-29 19:57:04] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 2 ms to minimize.
[2025-05-29 19:57:04] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2025-05-29 19:57:04] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:57:04] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2025-05-29 19:57:04] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:57:04] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:57:04] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2025-05-29 19:57:04] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2025-05-29 19:57:05] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2025-05-29 19:57:05] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:57:05] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2025-05-29 19:57:05] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2025-05-29 19:57:05] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2025-05-29 19:57:05] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2025-05-29 19:57:05] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:57:05] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2025-05-29 19:57:05] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:57:05] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2025-05-29 19:57:05] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2025-05-29 19:57:05] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2025-05-29 19:57:05] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2025-05-29 19:57:06] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2025-05-29 19:57:06] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:57:09] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2025-05-29 19:57:09] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2025-05-29 19:57:10] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2025-05-29 19:57:10] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2025-05-29 19:57:10] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2025-05-29 19:57:10] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2025-05-29 19:57:11] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2025-05-29 19:57:11] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2025-05-29 19:57:11] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2025-05-29 19:57:11] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2025-05-29 19:57:11] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2025-05-29 19:57:11] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2025-05-29 19:57:11] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:57:12] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2025-05-29 19:57:12] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2025-05-29 19:57:12] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2025-05-29 19:57:13] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2025-05-29 19:57:13] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 18/149 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:57:13] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2025-05-29 19:57:13] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 2 ms to minimize.
[2025-05-29 19:57:14] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 2 ms to minimize.
[2025-05-29 19:57:14] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:57:14] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:57:16] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2025-05-29 19:57:16] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2025-05-29 19:57:16] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2025-05-29 19:57:16] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2025-05-29 19:57:16] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:57:17] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 159/567 variables, and 160 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/160 constraints, ReadFeed: 0/367 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 149/149 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 149/160 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:57:19] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:57:19] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:57:19] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:57:19] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:57:19] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2025-05-29 19:57:19] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:57:21] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:57:21] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 8/168 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:57:22] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:57:22] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2025-05-29 19:57:22] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:57:22] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2025-05-29 19:57:22] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2025-05-29 19:57:22] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:57:23] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 2 ms to minimize.
[2025-05-29 19:57:23] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 8/176 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:57:24] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:57:26] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:57:27] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:57:27] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2025-05-29 19:57:27] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:57:27] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:57:29] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 5/183 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:57:29] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:57:29] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:57:29] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2025-05-29 19:57:29] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2025-05-29 19:57:30] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2025-05-29 19:57:31] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 6/189 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:57:32] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:57:32] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:57:34] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:57:34] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:57:34] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2025-05-29 19:57:36] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:57:37] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:57:39] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 12 (OVERLAPS) 407/566 variables, 159/356 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 367/723 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/567 variables, and 1120 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 159/160 constraints, ReadFeed: 367/367 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 186/186 constraints]
After SMT, in 60247ms problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 60254ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61385 ms. Remains : 160/160 places, 407/407 transitions.
[2025-05-29 19:57:47] [INFO ] Flatten gal took : 30 ms
[2025-05-29 19:57:47] [INFO ] Flatten gal took : 13 ms
[2025-05-29 19:57:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6929532683599587799.gal : 5 ms
[2025-05-29 19:57:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11213169361903122451.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/ReachabilityCardinality6929532683599587799.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11213169361903122451.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/ReachabilityCardinality11213169361903122451.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 38
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :38 after 43
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :43 after 45
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :45 after 46
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :46 after 56
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :56 after 87
RANDOM walk for 40000 steps (754 resets) in 467 ms. (85 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :87 after 495
BEST_FIRST walk for 40004 steps (68 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (65 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :495 after 1966
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1966 after 4422
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4422 after 10360
Interrupted probabilistic random walk after 559243 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 2
Probabilistic random walk after 559243 steps, saw 74549 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
[2025-05-29 19:57:51] [INFO ] Invariant cache hit.
[2025-05-29 19:57:51] [INFO ] State equation strengthened by 367 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) 148/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 19:57:51] [INFO ] Deduced a trap composed of 2 places in 238 ms of which 48 ms to minimize.
Problem MAX0 is UNSAT
[2025-05-29 19:57:51] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 6 ms to minimize.
[2025-05-29 19:57:51] [INFO ] Deduced a trap composed of 2 places in 179 ms of which 3 ms to minimize.
[2025-05-29 19:57:52] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 8 ms to minimize.
[2025-05-29 19:57:52] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 32 ms to minimize.
[2025-05-29 19:57:52] [INFO ] Deduced a trap composed of 2 places in 137 ms of which 2 ms to minimize.
[2025-05-29 19:57:52] [INFO ] Deduced a trap composed of 2 places in 152 ms of which 1 ms to minimize.
[2025-05-29 19:57:52] [INFO ] Deduced a trap composed of 2 places in 112 ms of which 2 ms to minimize.
[2025-05-29 19:57:53] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 9/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/158 variables, 9/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 407/565 variables, 158/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 367/545 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/545 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/567 variables, 2/547 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 0/547 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/567 variables, 0/547 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 547 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2083 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 160/160 constraints, ReadFeed: 367/367 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 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) 148/149 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 9/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 19:57:53] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 4 ms to minimize.
[2025-05-29 19:57:53] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2025-05-29 19:57:53] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:57:53] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :10360 after 173074
[2025-05-29 19:57:53] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:57:53] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 6/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/158 variables, 9/26 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 407/565 variables, 158/184 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 367/551 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 1/552 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 0/552 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/567 variables, 2/554 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 0/554 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/567 variables, 0/554 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 554 constraints, problems are : Problem set: 1 solved, 1 unsolved in 800 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 160/160 constraints, ReadFeed: 367/367 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 15/15 constraints]
After SMT, in 2924ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 407/407 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 160/160 places, 407/407 transitions.
RANDOM walk for 40000 steps (756 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (69 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1132169 steps, run timeout after 3001 ms. (steps per millisecond=377 ) properties seen :0 out of 1
Probabilistic random walk after 1132169 steps, saw 143962 distinct states, run finished after 3001 ms. (steps per millisecond=377 ) properties seen :0
[2025-05-29 19:57:57] [INFO ] Invariant cache hit.
[2025-05-29 19:57:57] [INFO ] State equation strengthened by 367 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) 148/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:57:57] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 2 ms to minimize.
[2025-05-29 19:57:57] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:57:57] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2025-05-29 19:57:57] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:57:57] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/158 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 407/565 variables, 158/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 367/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/567 variables, 2/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/567 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 543 constraints, problems are : Problem set: 0 solved, 1 unsolved in 812 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 160/160 constraints, ReadFeed: 367/367 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 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) 148/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:57:58] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/158 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 407/565 variables, 158/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 367/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/567 variables, 2/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/567 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 160/160 constraints, ReadFeed: 367/367 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1231ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 407/407 transitions.
Applied a total of 0 rules in 10 ms. Remains 160 /160 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 160/160 places, 407/407 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 407/407 transitions.
Applied a total of 0 rules in 18 ms. Remains 160 /160 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2025-05-29 19:57:58] [INFO ] Invariant cache hit.
[2025-05-29 19:57:58] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-05-29 19:57:58] [INFO ] Invariant cache hit.
[2025-05-29 19:57:58] [INFO ] State equation strengthened by 367 read => feed constraints.
[2025-05-29 19:57:59] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 921 ms to find 0 implicit places.
[2025-05-29 19:57:59] [INFO ] Redundant transitions in 3 ms returned []
Running 397 sub problems to find dead transitions.
[2025-05-29 19:57:59] [INFO ] Invariant cache hit.
[2025-05-29 19:57:59] [INFO ] State equation strengthened by 367 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:58:01] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:58:01] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:58:01] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:58:01] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:58:01] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 2 ms to minimize.
[2025-05-29 19:58:01] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2025-05-29 19:58:01] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2025-05-29 19:58:01] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2025-05-29 19:58:01] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2025-05-29 19:58:01] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2025-05-29 19:58:02] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2025-05-29 19:58:02] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2025-05-29 19:58:02] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2025-05-29 19:58:02] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2025-05-29 19:58:02] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2025-05-29 19:58:02] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2025-05-29 19:58:02] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 4 ms to minimize.
[2025-05-29 19:58:02] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2025-05-29 19:58:02] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2025-05-29 19:58:02] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:58:02] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:58:02] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2025-05-29 19:58:03] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:58:03] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2025-05-29 19:58:03] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
[2025-05-29 19:58:03] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
[2025-05-29 19:58:03] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:58:03] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 2 ms to minimize.
[2025-05-29 19:58:03] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
[2025-05-29 19:58:03] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
[2025-05-29 19:58:03] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2025-05-29 19:58:03] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2025-05-29 19:58:03] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:58:03] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:58:03] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2025-05-29 19:58:03] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2025-05-29 19:58:03] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2025-05-29 19:58:03] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2025-05-29 19:58:04] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2025-05-29 19:58:04] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:58:04] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2025-05-29 19:58:04] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2025-05-29 19:58:04] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2025-05-29 19:58:04] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2025-05-29 19:58:04] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2025-05-29 19:58:04] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2025-05-29 19:58:04] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2025-05-29 19:58:04] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2025-05-29 19:58:04] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 ms to minimize.
[2025-05-29 19:58:04] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:58:04] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2025-05-29 19:58:05] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2025-05-29 19:58:05] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:58:05] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:58:05] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2025-05-29 19:58:05] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:58:05] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2025-05-29 19:58:05] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2025-05-29 19:58:05] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2025-05-29 19:58:05] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :173074 after 1.49958e+06
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:58:08] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2025-05-29 19:58:08] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2025-05-29 19:58:08] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:58:08] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2025-05-29 19:58:08] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2025-05-29 19:58:08] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2025-05-29 19:58:08] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:58:08] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:58:09] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2025-05-29 19:58:09] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2025-05-29 19:58:09] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2025-05-29 19:58:09] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:58:09] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2025-05-29 19:58:09] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:58:09] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:58:09] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:58:09] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:58:09] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2025-05-29 19:58:09] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2025-05-29 19:58:09] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2025-05-29 19:58:09] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2025-05-29 19:58:10] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2025-05-29 19:58:10] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:58:10] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:58:10] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:58:10] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:58:10] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2025-05-29 19:58:10] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:58:10] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:58:10] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2025-05-29 19:58:10] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:58:10] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:58:10] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
[2025-05-29 19:58:10] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:58:10] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:58:10] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:58:11] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:58:11] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2025-05-29 19:58:11] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2025-05-29 19:58:11] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2025-05-29 19:58:11] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:58:11] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:58:11] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:58:13] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:58:13] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2025-05-29 19:58:14] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:58:14] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2025-05-29 19:58:14] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:58:14] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2025-05-29 19:58:14] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:58:14] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:58:14] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:58:14] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:58:14] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:58:14] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:58:15] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2025-05-29 19:58:15] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:58:15] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:58:15] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:58:16] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:58:16] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 18/149 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:58:16] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:58:16] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2025-05-29 19:58:16] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2025-05-29 19:58:16] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2025-05-29 19:58:16] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2025-05-29 19:58:18] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:58:18] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:58:18] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2025-05-29 19:58:18] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:58:18] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:58:19] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:58:19] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2025-05-29 19:58:20] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:58:20] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2025-05-29 19:58:20] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:58:20] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:58:20] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:58:20] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:58:21] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:58:21] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:58:21] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 11/170 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:58:23] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:58:23] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2025-05-29 19:58:23] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2025-05-29 19:58:23] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2025-05-29 19:58:24] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:58:24] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:58:24] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2025-05-29 19:58:25] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2025-05-29 19:58:25] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:58:25] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:58:25] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 11/181 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:58:26] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.49958e+06 after 3.55003e+06
[2025-05-29 19:58:27] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2025-05-29 19:58:27] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2025-05-29 19:58:29] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:58:29] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 159/567 variables, and 186 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/160 constraints, ReadFeed: 0/367 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 175/175 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 175/186 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:58:30] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:58:31] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:58:32] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:58:32] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:58:32] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:58:32] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:58:32] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:58:32] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 5/194 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:58:35] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2025-05-29 19:58:37] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:58:37] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:58:37] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2025-05-29 19:58:38] [INFO ] Flatten gal took : 13 ms
[2025-05-29 19:58:38] [INFO ] Applying decomposition
[2025-05-29 19:58:38] [INFO ] Flatten gal took : 12 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/graph2244447471160473532.txt' '-o' '/tmp/graph2244447471160473532.bin' '-w' '/tmp/graph2244447471160473532.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2244447471160473532.bin' '-l' '-1' '-v' '-w' '/tmp/graph2244447471160473532.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:58:38] [INFO ] Decomposing Gal with order
[2025-05-29 19:58:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:58:38] [INFO ] Removed a total of 335 redundant transitions.
[2025-05-29 19:58:38] [INFO ] Flatten gal took : 55 ms
[2025-05-29 19:58:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 248 labels/synchronizations in 17 ms.
[2025-05-29 19:58:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17794747675592251294.gal : 6 ms
[2025-05-29 19:58:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18206298510845469141.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/ReachabilityCardinality17794747675592251294.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18206298510845469141.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality18206298510845469141.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 36
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :36 after 36
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :36 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 36
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :36 after 454
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :454 after 10553
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 397 unsolved
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :10553 after 102635
[2025-05-29 19:58:39] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :102635 after 728051
[2025-05-29 19:58:40] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:58:43] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2025-05-29 19:58:43] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:58:44] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:58:44] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:58:44] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:58:45] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:58:45] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:58:45] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:58:46] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 6/209 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:58:47] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
[2025-05-29 19:58:47] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:58:47] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2025-05-29 19:58:47] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
[2025-05-29 19:58:47] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2025-05-29 19:58:47] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:58:47] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:58:47] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:58:48] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:58:48] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :728051 after 1.43187e+07
[2025-05-29 19:58:49] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:58:49] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 12/221 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:58:50] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:58:50] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:58:50] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:58:51] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2025-05-29 19:58:51] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:58:51] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 6/227 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:58:54] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 2 ms to minimize.
[2025-05-29 19:58:55] [INFO ] Deduced a trap composed of 2 places in 147 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 12 (OVERLAPS) 407/566 variables, 159/388 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 367/755 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/567 variables, and 1152 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 159/160 constraints, ReadFeed: 367/367 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 218/218 constraints]
After SMT, in 60203ms problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 60208ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61158 ms. Remains : 160/160 places, 407/407 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 347 edges and 160 vertex of which 117 / 160 are part of one of the 3 SCC in 1 ms
Free SCC test removed 114 places
Drop transitions (Empty/Sink Transition effects.) removed 271 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 350 transitions.
Graph (complete) has 115 edges and 46 vertex of which 16 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 16 transition count 20
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 38 place count 8 transition count 12
Iterating global reduction 1 with 8 rules applied. Total rules applied 46 place count 8 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 7 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 5 transition count 9
Applied a total of 50 rules in 11 ms. Remains 5 /160 variables (removed 155) and now considering 9/407 (removed 398) transitions.
Running SMT prover for 1 properties.
[2025-05-29 19:58:59] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2025-05-29 19:58:59] [INFO ] Computed 0 invariants in 1 ms
[2025-05-29 19:58:59] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 19:58:59] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 19:58:59] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 19:58:59] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 19:58:59] [INFO ] Flatten gal took : 2 ms
[2025-05-29 19:58:59] [INFO ] Flatten gal took : 1 ms
[2025-05-29 19:58:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10126269884880316976.gal : 1 ms
[2025-05-29 19:58:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5501916844814441460.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/ReachabilityCardinality10126269884880316976.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5501916844814441460.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/ReachabilityCardinality5501916844814441460.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 18
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 fixpoint passes
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,179,0.008351,3860,2,33,8,487,6,0,29,543,0
Total reachable state count : 179

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

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,30,0.008852,3860,2,13,8,487,7,0,32,543,0
Over-approximation ignoring read arcs solved 0 properties in 99 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] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-08 in 139799 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-09
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 410 rows 163 cols
[2025-05-29 19:58:59] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (189 resets) in 42 ms. (232 steps per ms)
BEST_FIRST walk for 10001 steps (15 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-05-29 19:58:59] [INFO ] Invariant cache hit.
[2025-05-29 19:58:59] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2025-05-29 19:59:00] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2025-05-29 19:59:00] [INFO ] State equation strengthened by 358 read => feed constraints.
[2025-05-29 19:59:00] [INFO ] [Real]Added 358 Read/Feed constraints in 64 ms returned sat
[2025-05-29 19:59:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:59:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-05-29 19:59:00] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2025-05-29 19:59:00] [INFO ] [Nat]Added 358 Read/Feed constraints in 76 ms returned sat
[2025-05-29 19:59:00] [INFO ] Computed and/alt/rep : 285/943/285 causal constraints (skipped 115 transitions) in 50 ms.
[2025-05-29 19:59:00] [INFO ] Added : 8 causal constraints over 2 iterations in 183 ms. Result :sat
Minimization took 502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 410/410 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 161 transition count 408
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 161 transition count 407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 160 transition count 407
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 160 transition count 407
Applied a total of 11 rules in 29 ms. Remains 160 /163 variables (removed 3) and now considering 407/410 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 160/163 places, 407/410 transitions.
// Phase 1: matrix 407 rows 160 cols
[2025-05-29 19:59:01] [INFO ] Computed 11 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (18740 resets) in 2690 ms. (371 steps per ms)
BEST_FIRST walk for 1000001 steps (1764 resets) in 594 ms. (1680 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-05-29 19:59:04] [INFO ] Invariant cache hit.
[2025-05-29 19:59:04] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-05-29 19:59:04] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2025-05-29 19:59:04] [INFO ] State equation strengthened by 367 read => feed constraints.
[2025-05-29 19:59:04] [INFO ] [Real]Added 367 Read/Feed constraints in 52 ms returned sat
[2025-05-29 19:59:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:59:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-05-29 19:59:05] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2025-05-29 19:59:05] [INFO ] [Nat]Added 367 Read/Feed constraints in 71 ms returned sat
[2025-05-29 19:59:05] [INFO ] Computed and/alt/rep : 284/975/284 causal constraints (skipped 113 transitions) in 48 ms.
[2025-05-29 19:59:05] [INFO ] Added : 8 causal constraints over 2 iterations in 173 ms. Result :sat
Minimization took 459 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 407/407 transitions.
Applied a total of 0 rules in 8 ms. Remains 160 /160 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 160/160 places, 407/407 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 407/407 transitions.
Applied a total of 0 rules in 7 ms. Remains 160 /160 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2025-05-29 19:59:05] [INFO ] Invariant cache hit.
[2025-05-29 19:59:06] [INFO ] Implicit Places using invariants in 376 ms returned []
[2025-05-29 19:59:06] [INFO ] Invariant cache hit.
[2025-05-29 19:59:06] [INFO ] State equation strengthened by 367 read => feed constraints.
[2025-05-29 19:59:07] [INFO ] Implicit Places using invariants and state equation in 1204 ms returned []
Implicit Place search using SMT with State Equation took 1582 ms to find 0 implicit places.
[2025-05-29 19:59:07] [INFO ] Redundant transitions in 5 ms returned []
Running 397 sub problems to find dead transitions.
[2025-05-29 19:59:07] [INFO ] Invariant cache hit.
[2025-05-29 19:59:07] [INFO ] State equation strengthened by 367 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:59:10] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
[2025-05-29 19:59:10] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:59:10] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2025-05-29 19:59:10] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2025-05-29 19:59:10] [INFO ] Deduced a trap composed of 2 places in 155 ms of which 2 ms to minimize.
[2025-05-29 19:59:10] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2025-05-29 19:59:11] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2025-05-29 19:59:11] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2025-05-29 19:59:11] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2025-05-29 19:59:11] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2025-05-29 19:59:11] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:59:11] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 2 ms to minimize.
[2025-05-29 19:59:11] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:59:11] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:59:11] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:59:12] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2025-05-29 19:59:12] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2025-05-29 19:59:12] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2025-05-29 19:59:12] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2025-05-29 19:59:12] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:59:13] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:59:13] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2025-05-29 19:59:13] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2025-05-29 19:59:13] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:59:13] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
[2025-05-29 19:59:13] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 2 ms to minimize.
[2025-05-29 19:59:13] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 3 ms to minimize.
[2025-05-29 19:59:13] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2025-05-29 19:59:13] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2025-05-29 19:59:13] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 2 ms to minimize.
[2025-05-29 19:59:14] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:59:14] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:59:14] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:59:14] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2025-05-29 19:59:15] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 2 ms to minimize.
[2025-05-29 19:59:15] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 2 ms to minimize.
[2025-05-29 19:59:15] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 2 ms to minimize.
[2025-05-29 19:59:15] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2025-05-29 19:59:15] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
[2025-05-29 19:59:15] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:59:16] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2025-05-29 19:59:16] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2025-05-29 19:59:16] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2025-05-29 19:59:16] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2025-05-29 19:59:16] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2025-05-29 19:59:16] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 3 ms to minimize.
[2025-05-29 19:59:16] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2025-05-29 19:59:16] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2025-05-29 19:59:16] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2025-05-29 19:59:17] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2025-05-29 19:59:17] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2025-05-29 19:59:17] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:59:17] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
[2025-05-29 19:59:17] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
[2025-05-29 19:59:17] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2025-05-29 19:59:17] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2025-05-29 19:59:17] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2025-05-29 19:59:17] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2025-05-29 19:59:17] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2025-05-29 19:59:17] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:59:20] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 3 ms to minimize.
[2025-05-29 19:59:20] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:59:20] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2025-05-29 19:59:20] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2025-05-29 19:59:20] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:59:21] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2025-05-29 19:59:21] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2025-05-29 19:59:21] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2025-05-29 19:59:21] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2025-05-29 19:59:21] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:59:21] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:59:21] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:59:21] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:59:22] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2025-05-29 19:59:22] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:59:22] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:59:22] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2025-05-29 19:59:23] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:59:23] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2025-05-29 19:59:23] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:59:24] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2025-05-29 19:59:24] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2025-05-29 19:59:24] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:59:25] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2025-05-29 19:59:25] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:59:25] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2025-05-29 19:59:26] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2025-05-29 19:59:26] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2025-05-29 19:59:26] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2025-05-29 19:59:26] [INFO ] Deduced a trap composed of 2 places in 115 ms of which 2 ms to minimize.
[2025-05-29 19:59:26] [INFO ] Deduced a trap composed of 2 places in 146 ms of which 3 ms to minimize.
[2025-05-29 19:59:26] [INFO ] Deduced a trap composed of 2 places in 100 ms of which 2 ms to minimize.
[2025-05-29 19:59:27] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 3 ms to minimize.
[2025-05-29 19:59:27] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2025-05-29 19:59:27] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2025-05-29 19:59:27] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2025-05-29 19:59:27] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2025-05-29 19:59:27] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2025-05-29 19:59:27] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2025-05-29 19:59:27] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:59:28] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:59:28] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:59:28] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:59:28] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2025-05-29 19:59:28] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:59:29] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2025-05-29 19:59:29] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2025-05-29 19:59:29] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:59:29] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2025-05-29 19:59:29] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2025-05-29 19:59:29] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:59:31] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2025-05-29 19:59:31] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2025-05-29 19:59:31] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2025-05-29 19:59:31] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2025-05-29 19:59:31] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2025-05-29 19:59:31] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2025-05-29 19:59:31] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2025-05-29 19:59:31] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2025-05-29 19:59:31] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:59:34] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:59:34] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2025-05-29 19:59:34] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2025-05-29 19:59:35] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2025-05-29 19:59:35] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
[2025-05-29 19:59:36] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:59:37] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:59:37] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:59:37] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 2.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 159/567 variables, and 140 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/160 constraints, ReadFeed: 0/367 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 129/129 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 129/140 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:59:38] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2025-05-29 19:59:38] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2025-05-29 19:59:39] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2025-05-29 19:59:39] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2025-05-29 19:59:39] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2025-05-29 19:59:40] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2025-05-29 19:59:40] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 7/147 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 19:59:43] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (OVERLAPS) 407/566 variables, 159/307 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Problem TDEAD147 is UNSAT
Problem TDEAD402 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 367/674 constraints. Problems are: Problem set: 2 solved, 395 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 395/1069 constraints. Problems are: Problem set: 2 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/567 variables, and 1069 constraints, problems are : Problem set: 2 solved, 395 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 159/160 constraints, ReadFeed: 367/367 constraints, PredecessorRefiner: 395/397 constraints, Known Traps: 137/137 constraints]
After SMT, in 60231ms problems are : Problem set: 2 solved, 395 unsolved
Search for dead transitions found 2 dead transitions in 60246ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 160/160 places, 405/407 transitions.
Graph (complete) has 726 edges and 160 vertex of which 159 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 158 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 158 transition count 403
Applied a total of 3 rules in 11 ms. Remains 158 /160 variables (removed 2) and now considering 403/405 (removed 2) transitions.
// Phase 1: matrix 403 rows 158 cols
[2025-05-29 20:00:07] [INFO ] Computed 11 invariants in 4 ms
[2025-05-29 20:00:07] [INFO ] Implicit Places using invariants in 270 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 271 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 157/160 places, 403/407 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 156 transition count 410
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 156 transition count 402
Applied a total of 10 rules in 16 ms. Remains 156 /157 variables (removed 1) and now considering 402/403 (removed 1) transitions.
// Phase 1: matrix 402 rows 156 cols
[2025-05-29 20:00:07] [INFO ] Computed 10 invariants in 3 ms
[2025-05-29 20:00:08] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-05-29 20:00:08] [INFO ] Invariant cache hit.
[2025-05-29 20:00:08] [INFO ] State equation strengthened by 355 read => feed constraints.
[2025-05-29 20:00:08] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 156/160 places, 402/407 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 63063 ms. Remains : 156/160 places, 402/407 transitions.
[2025-05-29 20:00:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20578 resets) in 2479 ms. (403 steps per ms)
BEST_FIRST walk for 1000001 steps (1866 resets) in 586 ms. (1703 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-05-29 20:00:11] [INFO ] Invariant cache hit.
[2025-05-29 20:00:12] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2025-05-29 20:00:12] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:00:12] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2025-05-29 20:00:12] [INFO ] State equation strengthened by 355 read => feed constraints.
[2025-05-29 20:00:12] [INFO ] [Real]Added 355 Read/Feed constraints in 64 ms returned sat
[2025-05-29 20:00:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:00:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2025-05-29 20:00:12] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:00:12] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2025-05-29 20:00:12] [INFO ] [Nat]Added 355 Read/Feed constraints in 43 ms returned sat
[2025-05-29 20:00:12] [INFO ] Computed and/alt/rep : 252/829/252 causal constraints (skipped 140 transitions) in 28 ms.
[2025-05-29 20:00:12] [INFO ] Added : 8 causal constraints over 2 iterations in 113 ms. Result :sat
Minimization took 277 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 9 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 156/156 places, 402/402 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 8 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
[2025-05-29 20:00:13] [INFO ] Invariant cache hit.
[2025-05-29 20:00:13] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-05-29 20:00:13] [INFO ] Invariant cache hit.
[2025-05-29 20:00:13] [INFO ] State equation strengthened by 355 read => feed constraints.
[2025-05-29 20:00:14] [INFO ] Implicit Places using invariants and state equation in 991 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
[2025-05-29 20:00:14] [INFO ] Redundant transitions in 3 ms returned []
Running 392 sub problems to find dead transitions.
[2025-05-29 20:00:14] [INFO ] Invariant cache hit.
[2025-05-29 20:00:14] [INFO ] State equation strengthened by 355 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 402/557 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 355/520 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2025-05-29 20:00:23] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2025-05-29 20:00:32] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2025-05-29 20:00:32] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 557/558 variables, and 523 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (OVERLAPS) 402/557 variables, 155/168 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 355/523 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 392/915 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 8 (OVERLAPS) 1/558 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/558 variables, and 916 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 3/3 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61387 ms. Remains : 156/156 places, 402/402 transitions.
[2025-05-29 20:01:14] [INFO ] Flatten gal took : 22 ms
[2025-05-29 20:01:14] [INFO ] Flatten gal took : 23 ms
[2025-05-29 20:01:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13430930640930358424.gal : 6 ms
[2025-05-29 20:01:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12786910456522311929.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/ReachabilityCardinality13430930640930358424.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12786910456522311929.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/ReachabilityCardinality12786910456522311929.prop.
RANDOM walk for 40000 steps (822 resets) in 675 ms. (59 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (73 resets) in 136 ms. (292 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 38
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :38 after 43
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :43 after 45
BEST_FIRST walk for 40003 steps (70 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :45 after 46
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :46 after 56
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :56 after 87
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :87 after 487
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :487 after 1969
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1969 after 4494
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4494 after 13386
Interrupted probabilistic random walk after 610545 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :0 out of 2
Probabilistic random walk after 610545 steps, saw 79876 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
[2025-05-29 20:01:17] [INFO ] Invariant cache hit.
[2025-05-29 20:01:17] [INFO ] State equation strengthened by 355 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/36 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 153/189 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 117/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/190 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 26/216 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/224 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/224 variables, 8/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/224 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 285/509 variables, 70/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/509 variables, 232/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/509 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 20 (OVERLAPS) 49/558 variables, 43/515 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/558 variables, 6/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/558 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/558 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/36 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/189 variables, 26/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 117/148 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/190 variables, 1/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/216 variables, 1/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 3/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/224 variables, 8/162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/224 variables, 8/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/224 variables, 1/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 20:01:18] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/224 variables, 1/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/224 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 285/509 variables, 70/242 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/509 variables, 232/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/509 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 49/558 variables, 43/517 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/558 variables, 6/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/558 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/558 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 523 constraints, problems are : Problem set: 1 solved, 1 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 883ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 156/156 places, 402/402 transitions.
RANDOM walk for 40000 steps (812 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (72 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :13386 after 150650
Interrupted probabilistic random walk after 1121119 steps, run timeout after 3001 ms. (steps per millisecond=373 ) properties seen :0 out of 1
Probabilistic random walk after 1121119 steps, saw 142225 distinct states, run finished after 3001 ms. (steps per millisecond=373 ) properties seen :0
[2025-05-29 20:01:21] [INFO ] Invariant cache hit.
[2025-05-29 20:01:21] [INFO ] State equation strengthened by 355 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/36 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/189 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 117/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/190 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/216 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/224 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/224 variables, 8/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/224 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 285/509 variables, 70/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/509 variables, 232/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/509 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 49/558 variables, 43/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/558 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/558 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/558 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/36 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/189 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 117/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/190 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/216 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/224 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/224 variables, 8/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/224 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:01:22] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/224 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/224 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 285/509 variables, 70/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/509 variables, 232/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/509 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 49/558 variables, 43/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/558 variables, 6/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/558 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/558 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 523 constraints, problems are : Problem set: 0 solved, 1 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 789ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 156/156 places, 402/402 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
[2025-05-29 20:01:22] [INFO ] Invariant cache hit.
[2025-05-29 20:01:22] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-05-29 20:01:22] [INFO ] Invariant cache hit.
[2025-05-29 20:01:22] [INFO ] State equation strengthened by 355 read => feed constraints.
[2025-05-29 20:01:23] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
[2025-05-29 20:01:23] [INFO ] Redundant transitions in 3 ms returned []
Running 392 sub problems to find dead transitions.
[2025-05-29 20:01:23] [INFO ] Invariant cache hit.
[2025-05-29 20:01:23] [INFO ] State equation strengthened by 355 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 402/557 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 355/520 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2025-05-29 20:01:32] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2025-05-29 20:01:40] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2025-05-29 20:01:40] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :150650 after 4.07873e+06
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 557/558 variables, and 523 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (OVERLAPS) 402/557 variables, 155/168 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 355/523 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 392/915 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Detected timeout of ITS tools.
[2025-05-29 20:02:04] [INFO ] Flatten gal took : 17 ms
[2025-05-29 20:02:04] [INFO ] Applying decomposition
[2025-05-29 20:02:04] [INFO ] Flatten gal took : 18 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/graph1581768861821819524.txt' '-o' '/tmp/graph1581768861821819524.bin' '-w' '/tmp/graph1581768861821819524.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1581768861821819524.bin' '-l' '-1' '-v' '-w' '/tmp/graph1581768861821819524.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:02:04] [INFO ] Decomposing Gal with order
[2025-05-29 20:02:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:02:04] [INFO ] Removed a total of 328 redundant transitions.
[2025-05-29 20:02:04] [INFO ] Flatten gal took : 48 ms
[2025-05-29 20:02:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 298 labels/synchronizations in 12 ms.
[2025-05-29 20:02:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5351433646608820120.gal : 6 ms
[2025-05-29 20:02:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16002481805121068007.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/ReachabilityCardinality5351433646608820120.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16002481805121068007.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/ReachabilityCardinality16002481805121068007.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :10 after 34
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :34 after 52
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :52 after 396
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :396 after 3754
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3754 after 18423
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :18423 after 768691
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 8 (OVERLAPS) 1/558 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 392 unsolved
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.46981e+08 after 2.46984e+08
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/558 variables, and 916 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 3/3 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61255 ms. Remains : 156/156 places, 402/402 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 328 edges and 156 vertex of which 116 / 156 are part of one of the 3 SCC in 1 ms
Free SCC test removed 113 places
Drop transitions (Empty/Sink Transition effects.) removed 269 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 349 transitions.
Graph (complete) has 106 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 40 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 2 transition count 3
Applied a total of 51 rules in 6 ms. Remains 2 /156 variables (removed 154) and now considering 3/402 (removed 399) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2025-05-29 20:02:23] [INFO ] Computed 0 invariants in 1 ms
[2025-05-29 20:02:23] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:02:23] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-05-29 20:02:23] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 20:02:23] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:02:23] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:02:23] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:02:23] [INFO ] Flatten gal took : 1 ms
[2025-05-29 20:02:23] [INFO ] Flatten gal took : 0 ms
[2025-05-29 20:02:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10336991758668497698.gal : 1 ms
[2025-05-29 20:02:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9204576847741420834.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/ReachabilityCardinality10336991758668497698.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9204576847741420834.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/ReachabilityCardinality9204576847741420834.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
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,9,0.00227,3480,2,7,7,42,6,0,13,34,0
Total reachable state count : 9

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

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,2,0.002587,3856,2,3,7,42,7,0,16,34,0
Over-approximation ignoring read arcs solved 0 properties in 76 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] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-09 in 204127 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-10
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 410 rows 163 cols
[2025-05-29 20:02:23] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (188 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10000 steps (18 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-05-29 20:02:23] [INFO ] Invariant cache hit.
[2025-05-29 20:02:24] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-05-29 20:02:24] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2025-05-29 20:02:24] [INFO ] State equation strengthened by 358 read => feed constraints.
[2025-05-29 20:02:24] [INFO ] [Real]Added 358 Read/Feed constraints in 49 ms returned sat
[2025-05-29 20:02:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:02:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-05-29 20:02:24] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2025-05-29 20:02:24] [INFO ] [Nat]Added 358 Read/Feed constraints in 63 ms returned sat
[2025-05-29 20:02:24] [INFO ] Computed and/alt/rep : 285/943/285 causal constraints (skipped 115 transitions) in 44 ms.
[2025-05-29 20:02:24] [INFO ] Added : 13 causal constraints over 3 iterations in 209 ms. Result :sat
Minimization took 503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 410/410 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 161 transition count 408
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 161 transition count 407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 160 transition count 407
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 160 transition count 407
Applied a total of 11 rules in 26 ms. Remains 160 /163 variables (removed 3) and now considering 407/410 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 160/163 places, 407/410 transitions.
// Phase 1: matrix 407 rows 160 cols
[2025-05-29 20:02:25] [INFO ] Computed 11 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (18770 resets) in 2498 ms. (400 steps per ms)
BEST_FIRST walk for 1000001 steps (1745 resets) in 596 ms. (1675 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-05-29 20:02:28] [INFO ] Invariant cache hit.
[2025-05-29 20:02:28] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-05-29 20:02:28] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2025-05-29 20:02:28] [INFO ] State equation strengthened by 367 read => feed constraints.
[2025-05-29 20:02:28] [INFO ] [Real]Added 367 Read/Feed constraints in 53 ms returned sat
[2025-05-29 20:02:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:02:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2025-05-29 20:02:28] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2025-05-29 20:02:28] [INFO ] [Nat]Added 367 Read/Feed constraints in 68 ms returned sat
[2025-05-29 20:02:29] [INFO ] Computed and/alt/rep : 284/975/284 causal constraints (skipped 113 transitions) in 51 ms.
[2025-05-29 20:02:29] [INFO ] Added : 8 causal constraints over 2 iterations in 180 ms. Result :sat
Minimization took 394 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 407/407 transitions.
Applied a total of 0 rules in 8 ms. Remains 160 /160 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 160/160 places, 407/407 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 407/407 transitions.
Applied a total of 0 rules in 7 ms. Remains 160 /160 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2025-05-29 20:02:29] [INFO ] Invariant cache hit.
[2025-05-29 20:02:29] [INFO ] Implicit Places using invariants in 255 ms returned []
[2025-05-29 20:02:29] [INFO ] Invariant cache hit.
[2025-05-29 20:02:30] [INFO ] State equation strengthened by 367 read => feed constraints.
[2025-05-29 20:02:31] [INFO ] Implicit Places using invariants and state equation in 1137 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
[2025-05-29 20:02:31] [INFO ] Redundant transitions in 5 ms returned []
Running 397 sub problems to find dead transitions.
[2025-05-29 20:02:31] [INFO ] Invariant cache hit.
[2025-05-29 20:02:31] [INFO ] State equation strengthened by 367 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:02:33] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2025-05-29 20:02:33] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2025-05-29 20:02:33] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2025-05-29 20:02:34] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2025-05-29 20:02:34] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2025-05-29 20:02:34] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2025-05-29 20:02:34] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 2 ms to minimize.
[2025-05-29 20:02:34] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2025-05-29 20:02:34] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2025-05-29 20:02:34] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2025-05-29 20:02:34] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2025-05-29 20:02:34] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2025-05-29 20:02:34] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-05-29 20:02:34] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2025-05-29 20:02:35] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2025-05-29 20:02:35] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2025-05-29 20:02:35] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2025-05-29 20:02:35] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2025-05-29 20:02:35] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2025-05-29 20:02:35] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:02:36] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:02:36] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2025-05-29 20:02:36] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2025-05-29 20:02:36] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2025-05-29 20:02:36] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2025-05-29 20:02:36] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2025-05-29 20:02:36] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-05-29 20:02:36] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:02:37] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2025-05-29 20:02:37] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2025-05-29 20:02:37] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2025-05-29 20:02:37] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2025-05-29 20:02:37] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2025-05-29 20:02:37] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2025-05-29 20:02:37] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2025-05-29 20:02:38] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2025-05-29 20:02:38] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2025-05-29 20:02:38] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2025-05-29 20:02:38] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2025-05-29 20:02:38] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:02:38] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2025-05-29 20:02:38] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2025-05-29 20:02:38] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2025-05-29 20:02:38] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2025-05-29 20:02:38] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2025-05-29 20:02:39] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2025-05-29 20:02:39] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2025-05-29 20:02:39] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2025-05-29 20:02:40] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 2 ms to minimize.
[2025-05-29 20:02:40] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 5 ms to minimize.
[2025-05-29 20:02:40] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2025-05-29 20:02:40] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2025-05-29 20:02:40] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
[2025-05-29 20:02:40] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2025-05-29 20:02:40] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2025-05-29 20:02:40] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2025-05-29 20:02:40] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2025-05-29 20:02:40] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2025-05-29 20:02:41] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2025-05-29 20:02:41] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:02:43] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2025-05-29 20:02:44] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-05-29 20:02:44] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-05-29 20:02:44] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-05-29 20:02:44] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-05-29 20:02:44] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-05-29 20:02:44] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2025-05-29 20:02:44] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-05-29 20:02:44] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2025-05-29 20:02:45] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-05-29 20:02:45] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:02:45] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2025-05-29 20:02:45] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-29 20:02:45] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:02:45] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-05-29 20:02:45] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 16/87 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:02:46] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2025-05-29 20:02:46] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2025-05-29 20:02:47] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2025-05-29 20:02:47] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2025-05-29 20:02:47] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2025-05-29 20:02:47] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2025-05-29 20:02:47] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2025-05-29 20:02:48] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2025-05-29 20:02:48] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2025-05-29 20:02:48] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
[2025-05-29 20:02:48] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2025-05-29 20:02:48] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2025-05-29 20:02:48] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 2 ms to minimize.
[2025-05-29 20:02:48] [INFO ] Deduced a trap composed of 2 places in 130 ms of which 3 ms to minimize.
[2025-05-29 20:02:49] [INFO ] Deduced a trap composed of 2 places in 153 ms of which 2 ms to minimize.
[2025-05-29 20:02:49] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2025-05-29 20:02:49] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2025-05-29 20:02:49] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 18/105 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:02:50] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2025-05-29 20:02:50] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2025-05-29 20:02:50] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2025-05-29 20:02:50] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2025-05-29 20:02:50] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2025-05-29 20:02:51] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2025-05-29 20:02:51] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2025-05-29 20:02:51] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2025-05-29 20:02:51] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2025-05-29 20:02:51] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2025-05-29 20:02:51] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2025-05-29 20:02:51] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2025-05-29 20:02:51] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2025-05-29 20:02:52] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2025-05-29 20:02:52] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2025-05-29 20:02:52] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2025-05-29 20:02:52] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2025-05-29 20:02:52] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2025-05-29 20:02:52] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2025-05-29 20:02:52] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:02:54] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2025-05-29 20:02:54] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 2 ms to minimize.
[2025-05-29 20:02:54] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2025-05-29 20:02:54] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2025-05-29 20:02:54] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2025-05-29 20:02:54] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2025-05-29 20:02:55] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2025-05-29 20:02:55] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2025-05-29 20:02:55] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2025-05-29 20:02:55] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2025-05-29 20:02:55] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2025-05-29 20:02:56] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2025-05-29 20:02:56] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:02:56] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2025-05-29 20:02:56] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2025-05-29 20:02:56] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2025-05-29 20:02:56] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2025-05-29 20:02:56] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
[2025-05-29 20:02:56] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
[2025-05-29 20:02:56] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:02:57] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2025-05-29 20:02:57] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2025-05-29 20:02:58] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2025-05-29 20:02:58] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2025-05-29 20:02:58] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2025-05-29 20:02:58] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2025-05-29 20:02:58] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 2 ms to minimize.
[2025-05-29 20:02:59] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2025-05-29 20:03:00] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2025-05-29 20:03:00] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2025-05-29 20:03:00] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 2 ms to minimize.
[2025-05-29 20:03:00] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
[2025-05-29 20:03:00] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2025-05-29 20:03:00] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 14/159 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:03:01] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 159/567 variables, and 160 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/160 constraints, ReadFeed: 0/367 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 149/149 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 149/160 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:03:02] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2025-05-29 20:03:03] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2025-05-29 20:03:03] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2025-05-29 20:03:04] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2025-05-29 20:03:04] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2025-05-29 20:03:04] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2025-05-29 20:03:04] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:03:06] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2025-05-29 20:03:07] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2025-05-29 20:03:07] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2025-05-29 20:03:07] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2025-05-29 20:03:07] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2025-05-29 20:03:07] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:03:08] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2025-05-29 20:03:08] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-05-29 20:03:08] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-05-29 20:03:08] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-05-29 20:03:08] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:03:09] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2025-05-29 20:03:10] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-05-29 20:03:10] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 8/181 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 6 (OVERLAPS) 407/566 variables, 159/340 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Problem TDEAD147 is UNSAT
Problem TDEAD402 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 367/707 constraints. Problems are: Problem set: 2 solved, 395 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 395/1102 constraints. Problems are: Problem set: 2 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/567 variables, and 1102 constraints, problems are : Problem set: 2 solved, 395 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 159/160 constraints, ReadFeed: 367/367 constraints, PredecessorRefiner: 395/397 constraints, Known Traps: 170/170 constraints]
After SMT, in 60218ms problems are : Problem set: 2 solved, 395 unsolved
Search for dead transitions found 2 dead transitions in 60225ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 160/160 places, 405/407 transitions.
Graph (complete) has 726 edges and 160 vertex of which 159 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 158 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 158 transition count 403
Applied a total of 3 rules in 11 ms. Remains 158 /160 variables (removed 2) and now considering 403/405 (removed 2) transitions.
// Phase 1: matrix 403 rows 158 cols
[2025-05-29 20:03:31] [INFO ] Computed 11 invariants in 3 ms
[2025-05-29 20:03:31] [INFO ] Implicit Places using invariants in 308 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 310 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 157/160 places, 403/407 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 156 transition count 410
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 156 transition count 402
Applied a total of 10 rules in 22 ms. Remains 156 /157 variables (removed 1) and now considering 402/403 (removed 1) transitions.
// Phase 1: matrix 402 rows 156 cols
[2025-05-29 20:03:31] [INFO ] Computed 10 invariants in 3 ms
[2025-05-29 20:03:31] [INFO ] Implicit Places using invariants in 297 ms returned []
[2025-05-29 20:03:31] [INFO ] Invariant cache hit.
[2025-05-29 20:03:32] [INFO ] State equation strengthened by 355 read => feed constraints.
[2025-05-29 20:03:32] [INFO ] Implicit Places using invariants and state equation in 1092 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 156/160 places, 402/407 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 63377 ms. Remains : 156/160 places, 402/407 transitions.
[2025-05-29 20:03:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20617 resets) in 2573 ms. (388 steps per ms)
BEST_FIRST walk for 1000001 steps (1871 resets) in 564 ms. (1769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-05-29 20:03:36] [INFO ] Invariant cache hit.
[2025-05-29 20:03:36] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2025-05-29 20:03:36] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:03:36] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2025-05-29 20:03:36] [INFO ] State equation strengthened by 355 read => feed constraints.
[2025-05-29 20:03:36] [INFO ] [Real]Added 355 Read/Feed constraints in 39 ms returned sat
[2025-05-29 20:03:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:03:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-05-29 20:03:36] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:03:36] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2025-05-29 20:03:36] [INFO ] [Nat]Added 355 Read/Feed constraints in 67 ms returned sat
[2025-05-29 20:03:36] [INFO ] Computed and/alt/rep : 252/829/252 causal constraints (skipped 140 transitions) in 48 ms.
[2025-05-29 20:03:36] [INFO ] Added : 8 causal constraints over 2 iterations in 177 ms. Result :sat
Minimization took 409 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 8 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 156/156 places, 402/402 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 7 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
[2025-05-29 20:03:37] [INFO ] Invariant cache hit.
[2025-05-29 20:03:37] [INFO ] Implicit Places using invariants in 273 ms returned []
[2025-05-29 20:03:37] [INFO ] Invariant cache hit.
[2025-05-29 20:03:37] [INFO ] State equation strengthened by 355 read => feed constraints.
[2025-05-29 20:03:38] [INFO ] Implicit Places using invariants and state equation in 1055 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
[2025-05-29 20:03:38] [INFO ] Redundant transitions in 5 ms returned []
Running 392 sub problems to find dead transitions.
[2025-05-29 20:03:38] [INFO ] Invariant cache hit.
[2025-05-29 20:03:38] [INFO ] State equation strengthened by 355 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 402/557 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 355/520 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2025-05-29 20:03:50] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 392 unsolved
SMT process timed out in 30183ms, After SMT, problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 30191ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31543 ms. Remains : 156/156 places, 402/402 transitions.
[2025-05-29 20:04:08] [INFO ] Flatten gal took : 12 ms
[2025-05-29 20:04:08] [INFO ] Flatten gal took : 10 ms
[2025-05-29 20:04:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17431511002911140189.gal : 3 ms
[2025-05-29 20:04:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7611016862561880422.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/ReachabilityCardinality17431511002911140189.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7611016862561880422.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/ReachabilityCardinality7611016862561880422.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 19
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :19 after 24
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :24 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 52
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :52 after 176
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :176 after 260
RANDOM walk for 40000 steps (817 resets) in 786 ms. (50 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (75 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (68 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :260 after 2545
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2545 after 4894
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4894 after 26326
Interrupted probabilistic random walk after 712936 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :0 out of 2
Probabilistic random walk after 712936 steps, saw 92477 distinct states, run finished after 3001 ms. (steps per millisecond=237 ) properties seen :0
[2025-05-29 20:04:12] [INFO ] Invariant cache hit.
[2025-05-29 20:04:12] [INFO ] State equation strengthened by 355 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/37 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 153/190 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 118/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 26/217 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/225 variables, 8/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 284/509 variables, 70/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/509 variables, 231/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/509 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 20 (OVERLAPS) 49/558 variables, 43/515 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/558 variables, 6/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/558 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/558 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/37 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/190 variables, 26/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 118/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/217 variables, 1/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 3/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/225 variables, 8/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 8/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 284/509 variables, 70/242 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/509 variables, 231/473 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/509 variables, 0/473 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 49/558 variables, 43/516 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/558 variables, 6/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/558 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/558 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 522 constraints, problems are : Problem set: 1 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 653ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 156/156 places, 402/402 transitions.
RANDOM walk for 40000 steps (816 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (68 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :26326 after 82833
Interrupted probabilistic random walk after 1130350 steps, run timeout after 3001 ms. (steps per millisecond=376 ) properties seen :0 out of 1
Probabilistic random walk after 1130350 steps, saw 143756 distinct states, run finished after 3001 ms. (steps per millisecond=376 ) properties seen :0
[2025-05-29 20:04:15] [INFO ] Invariant cache hit.
[2025-05-29 20:04:15] [INFO ] State equation strengthened by 355 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/37 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/190 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 118/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/217 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/225 variables, 8/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 284/509 variables, 70/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/509 variables, 231/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/509 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 49/558 variables, 43/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/558 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/558 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/558 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/37 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/190 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 118/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/217 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/225 variables, 8/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 284/509 variables, 70/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/509 variables, 231/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/509 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 49/558 variables, 43/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/558 variables, 6/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/558 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/558 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 522 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 585ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 156/156 places, 402/402 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
[2025-05-29 20:04:16] [INFO ] Invariant cache hit.
[2025-05-29 20:04:16] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-05-29 20:04:16] [INFO ] Invariant cache hit.
[2025-05-29 20:04:16] [INFO ] State equation strengthened by 355 read => feed constraints.
[2025-05-29 20:04:17] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
[2025-05-29 20:04:17] [INFO ] Redundant transitions in 3 ms returned []
Running 392 sub problems to find dead transitions.
[2025-05-29 20:04:17] [INFO ] Invariant cache hit.
[2025-05-29 20:04:17] [INFO ] State equation strengthened by 355 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :82833 after 667545
At refinement iteration 3 (OVERLAPS) 402/557 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 355/520 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2025-05-29 20:04:25] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 1/558 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 558/558 variables, and 522 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (OVERLAPS) 402/557 variables, 155/166 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 355/521 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 392/913 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Detected timeout of ITS tools.
[2025-05-29 20:04:58] [INFO ] Flatten gal took : 9 ms
[2025-05-29 20:04:58] [INFO ] Applying decomposition
[2025-05-29 20:04:58] [INFO ] Flatten gal took : 22 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/graph13649261663198716081.txt' '-o' '/tmp/graph13649261663198716081.bin' '-w' '/tmp/graph13649261663198716081.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13649261663198716081.bin' '-l' '-1' '-v' '-w' '/tmp/graph13649261663198716081.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:04:58] [INFO ] Decomposing Gal with order
[2025-05-29 20:04:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:04:58] [INFO ] Removed a total of 329 redundant transitions.
[2025-05-29 20:04:59] [INFO ] Flatten gal took : 32 ms
[2025-05-29 20:04:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 250 labels/synchronizations in 9 ms.
[2025-05-29 20:04:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12441657969595067288.gal : 8 ms
[2025-05-29 20:04:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1887631697908551944.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/ReachabilityCardinality12441657969595067288.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1887631697908551944.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/ReachabilityCardinality1887631697908551944.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 194
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :194 after 194
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :194 after 194
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :194 after 194
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :194 after 215
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :215 after 244
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :244 after 10577
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :10577 after 140759
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :140759 after 1.34926e+06
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 8 (OVERLAPS) 1/558 variables, 1/914 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/558 variables, and 914 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 1/1 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61124 ms. Remains : 156/156 places, 402/402 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 328 edges and 156 vertex of which 116 / 156 are part of one of the 3 SCC in 0 ms
Free SCC test removed 113 places
Drop transitions (Empty/Sink Transition effects.) removed 269 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 349 transitions.
Graph (complete) has 106 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 40 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 2 transition count 3
Applied a total of 51 rules in 4 ms. Remains 2 /156 variables (removed 154) and now considering 3/402 (removed 399) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2025-05-29 20:05:17] [INFO ] Computed 0 invariants in 0 ms
[2025-05-29 20:05:17] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:05:17] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-05-29 20:05:17] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 20:05:17] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:05:17] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:05:17] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:05:17] [INFO ] Flatten gal took : 1 ms
[2025-05-29 20:05:17] [INFO ] Flatten gal took : 0 ms
[2025-05-29 20:05:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1607226483197270143.gal : 1 ms
[2025-05-29 20:05:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9648941233446112024.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/ReachabilityCardinality1607226483197270143.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9648941233446112024.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/ReachabilityCardinality9648941233446112024.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
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,9,0.002454,3480,2,7,7,42,6,0,13,34,0
Total reachable state count : 9

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

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,2,0.002793,3856,2,3,7,42,7,0,16,34,0
Over-approximation ignoring read arcs solved 0 properties in 70 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] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-10 in 173756 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 410 rows 163 cols
[2025-05-29 20:05:17] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (181 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (18 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-05-29 20:05:17] [INFO ] Invariant cache hit.
[2025-05-29 20:05:17] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-05-29 20:05:17] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2025-05-29 20:05:17] [INFO ] State equation strengthened by 358 read => feed constraints.
[2025-05-29 20:05:17] [INFO ] [Real]Added 358 Read/Feed constraints in 39 ms returned sat
[2025-05-29 20:05:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:05:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-05-29 20:05:18] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2025-05-29 20:05:18] [INFO ] [Nat]Added 358 Read/Feed constraints in 57 ms returned sat
[2025-05-29 20:05:18] [INFO ] Computed and/alt/rep : 285/943/285 causal constraints (skipped 115 transitions) in 45 ms.
[2025-05-29 20:05:18] [INFO ] Added : 9 causal constraints over 2 iterations in 148 ms. Result :sat
Minimization took 483 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 410/410 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 161 transition count 408
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 161 transition count 407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 160 transition count 407
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 160 transition count 407
Applied a total of 11 rules in 28 ms. Remains 160 /163 variables (removed 3) and now considering 407/410 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 160/163 places, 407/410 transitions.
// Phase 1: matrix 407 rows 160 cols
[2025-05-29 20:05:18] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (18743 resets) in 2800 ms. (357 steps per ms)
BEST_FIRST walk for 1000001 steps (1778 resets) in 585 ms. (1706 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-05-29 20:05:22] [INFO ] Invariant cache hit.
[2025-05-29 20:05:22] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-05-29 20:05:22] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2025-05-29 20:05:22] [INFO ] State equation strengthened by 367 read => feed constraints.
[2025-05-29 20:05:22] [INFO ] [Real]Added 367 Read/Feed constraints in 43 ms returned sat
[2025-05-29 20:05:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:05:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-05-29 20:05:22] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2025-05-29 20:05:22] [INFO ] [Nat]Added 367 Read/Feed constraints in 50 ms returned sat
[2025-05-29 20:05:22] [INFO ] Computed and/alt/rep : 284/975/284 causal constraints (skipped 113 transitions) in 30 ms.
[2025-05-29 20:05:22] [INFO ] Added : 14 causal constraints over 4 iterations in 152 ms. Result :sat
Minimization took 424 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 407/407 transitions.
Applied a total of 0 rules in 7 ms. Remains 160 /160 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 160/160 places, 407/407 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 407/407 transitions.
Applied a total of 0 rules in 6 ms. Remains 160 /160 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2025-05-29 20:05:23] [INFO ] Invariant cache hit.
[2025-05-29 20:05:23] [INFO ] Implicit Places using invariants in 304 ms returned []
[2025-05-29 20:05:23] [INFO ] Invariant cache hit.
[2025-05-29 20:05:23] [INFO ] State equation strengthened by 367 read => feed constraints.
[2025-05-29 20:05:24] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1279 ms to find 0 implicit places.
[2025-05-29 20:05:24] [INFO ] Redundant transitions in 5 ms returned []
Running 397 sub problems to find dead transitions.
[2025-05-29 20:05:24] [INFO ] Invariant cache hit.
[2025-05-29 20:05:24] [INFO ] State equation strengthened by 367 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:05:26] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2025-05-29 20:05:26] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2025-05-29 20:05:26] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2025-05-29 20:05:26] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2025-05-29 20:05:27] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2025-05-29 20:05:27] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2025-05-29 20:05:27] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2025-05-29 20:05:27] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 2 ms to minimize.
[2025-05-29 20:05:27] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
[2025-05-29 20:05:27] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2025-05-29 20:05:27] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 2 ms to minimize.
[2025-05-29 20:05:27] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 2 ms to minimize.
[2025-05-29 20:05:27] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2025-05-29 20:05:27] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2025-05-29 20:05:28] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2025-05-29 20:05:28] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2025-05-29 20:05:28] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2025-05-29 20:05:28] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2025-05-29 20:05:28] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2025-05-29 20:05:28] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:05:28] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-29 20:05:28] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2025-05-29 20:05:28] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2025-05-29 20:05:28] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2025-05-29 20:05:28] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2025-05-29 20:05:29] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2025-05-29 20:05:29] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2025-05-29 20:05:29] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2025-05-29 20:05:29] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-05-29 20:05:30] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 3 ms to minimize.
[2025-05-29 20:05:31] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 3 ms to minimize.
[2025-05-29 20:05:31] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 3 ms to minimize.
[2025-05-29 20:05:31] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2025-05-29 20:05:31] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2025-05-29 20:05:31] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 2 ms to minimize.
[2025-05-29 20:05:31] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 3 ms to minimize.
[2025-05-29 20:05:31] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2025-05-29 20:05:31] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2025-05-29 20:05:32] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2025-05-29 20:05:32] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:05:32] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
[2025-05-29 20:05:32] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 2 ms to minimize.
[2025-05-29 20:05:32] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2025-05-29 20:05:32] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 2 ms to minimize.
[2025-05-29 20:05:32] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 2 ms to minimize.
[2025-05-29 20:05:32] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 2 ms to minimize.
[2025-05-29 20:05:33] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2025-05-29 20:05:33] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2025-05-29 20:05:33] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2025-05-29 20:05:33] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2025-05-29 20:05:33] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2025-05-29 20:05:33] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2025-05-29 20:05:33] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2025-05-29 20:05:33] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2025-05-29 20:05:33] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2025-05-29 20:05:33] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2025-05-29 20:05:33] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2025-05-29 20:05:33] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-05-29 20:05:34] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2025-05-29 20:05:34] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:05:35] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2025-05-29 20:05:35] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2025-05-29 20:05:35] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2025-05-29 20:05:36] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2025-05-29 20:05:36] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2025-05-29 20:05:36] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:05:36] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2025-05-29 20:05:36] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2025-05-29 20:05:36] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2025-05-29 20:05:36] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2025-05-29 20:05:36] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2025-05-29 20:05:36] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2025-05-29 20:05:36] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2025-05-29 20:05:36] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2025-05-29 20:05:36] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2025-05-29 20:05:37] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2025-05-29 20:05:37] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2025-05-29 20:05:37] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2025-05-29 20:05:37] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2025-05-29 20:05:37] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:05:37] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
[2025-05-29 20:05:37] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2025-05-29 20:05:37] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2025-05-29 20:05:37] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
[2025-05-29 20:05:37] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2025-05-29 20:05:37] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2025-05-29 20:05:37] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 2 ms to minimize.
[2025-05-29 20:05:38] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2025-05-29 20:05:38] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2025-05-29 20:05:38] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2025-05-29 20:05:38] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2025-05-29 20:05:38] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2025-05-29 20:05:38] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2025-05-29 20:05:39] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2025-05-29 20:05:39] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2025-05-29 20:05:39] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2025-05-29 20:05:39] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2025-05-29 20:05:39] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2025-05-29 20:05:39] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2025-05-29 20:05:39] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:05:40] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-05-29 20:05:40] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2025-05-29 20:05:40] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
[2025-05-29 20:05:40] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 2 ms to minimize.
[2025-05-29 20:05:40] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2025-05-29 20:05:40] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2025-05-29 20:05:40] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2025-05-29 20:05:40] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2025-05-29 20:05:40] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2025-05-29 20:05:40] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2025-05-29 20:05:40] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2025-05-29 20:05:40] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2025-05-29 20:05:41] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2025-05-29 20:05:41] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-05-29 20:05:41] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-05-29 20:05:41] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2025-05-29 20:05:41] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2025-05-29 20:05:41] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2025-05-29 20:05:43] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
[2025-05-29 20:05:43] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:05:46] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
[2025-05-29 20:05:46] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2025-05-29 20:05:46] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2025-05-29 20:05:46] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-05-29 20:05:46] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2025-05-29 20:05:46] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2025-05-29 20:05:48] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 2 ms to minimize.
[2025-05-29 20:05:48] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2025-05-29 20:05:49] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2025-05-29 20:05:49] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2025-05-29 20:05:49] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2025-05-29 20:05:49] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2025-05-29 20:05:49] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2025-05-29 20:05:49] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2025-05-29 20:05:49] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2025-05-29 20:05:49] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2025-05-29 20:05:49] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2025-05-29 20:05:49] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 18/149 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:05:50] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2025-05-29 20:05:50] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2025-05-29 20:05:51] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2025-05-29 20:05:51] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-05-29 20:05:51] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2025-05-29 20:05:51] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2025-05-29 20:05:51] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2025-05-29 20:05:51] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
[2025-05-29 20:05:52] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 3 ms to minimize.
[2025-05-29 20:05:53] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2025-05-29 20:05:53] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 11/160 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:05:54] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2025-05-29 20:05:54] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 159/567 variables, and 162 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/160 constraints, ReadFeed: 0/367 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 151/151 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 151/162 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:05:55] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2025-05-29 20:05:56] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2025-05-29 20:05:58] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:06:01] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:06:03] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:06:08] [INFO ] Deduced a trap composed of 2 places in 95 ms of which 2 ms to minimize.
[2025-05-29 20:06:09] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2025-05-29 20:06:09] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2025-05-29 20:06:09] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-05-29 20:06:12] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2025-05-29 20:06:12] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 8 (OVERLAPS) 407/566 variables, 159/332 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Problem TDEAD147 is UNSAT
Problem TDEAD402 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 367/699 constraints. Problems are: Problem set: 2 solved, 395 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 395/1094 constraints. Problems are: Problem set: 2 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/567 variables, and 1094 constraints, problems are : Problem set: 2 solved, 395 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 159/160 constraints, ReadFeed: 367/367 constraints, PredecessorRefiner: 395/397 constraints, Known Traps: 162/162 constraints]
After SMT, in 60199ms problems are : Problem set: 2 solved, 395 unsolved
Search for dead transitions found 2 dead transitions in 60206ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 160/160 places, 405/407 transitions.
Graph (complete) has 726 edges and 160 vertex of which 159 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 158 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 158 transition count 403
Applied a total of 3 rules in 8 ms. Remains 158 /160 variables (removed 2) and now considering 403/405 (removed 2) transitions.
// Phase 1: matrix 403 rows 158 cols
[2025-05-29 20:06:24] [INFO ] Computed 11 invariants in 4 ms
[2025-05-29 20:06:25] [INFO ] Implicit Places using invariants in 189 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 190 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 157/160 places, 403/407 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 156 transition count 410
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 156 transition count 402
Applied a total of 10 rules in 15 ms. Remains 156 /157 variables (removed 1) and now considering 402/403 (removed 1) transitions.
// Phase 1: matrix 402 rows 156 cols
[2025-05-29 20:06:25] [INFO ] Computed 10 invariants in 2 ms
[2025-05-29 20:06:25] [INFO ] Implicit Places using invariants in 220 ms returned []
[2025-05-29 20:06:25] [INFO ] Invariant cache hit.
[2025-05-29 20:06:25] [INFO ] State equation strengthened by 355 read => feed constraints.
[2025-05-29 20:06:26] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 156/160 places, 402/407 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 63035 ms. Remains : 156/160 places, 402/407 transitions.
[2025-05-29 20:06:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20584 resets) in 2646 ms. (377 steps per ms)
BEST_FIRST walk for 1000001 steps (1852 resets) in 587 ms. (1700 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-05-29 20:06:29] [INFO ] Invariant cache hit.
[2025-05-29 20:06:29] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2025-05-29 20:06:29] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:06:29] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2025-05-29 20:06:29] [INFO ] State equation strengthened by 355 read => feed constraints.
[2025-05-29 20:06:29] [INFO ] [Real]Added 355 Read/Feed constraints in 55 ms returned sat
[2025-05-29 20:06:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:06:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-05-29 20:06:30] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:06:30] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2025-05-29 20:06:30] [INFO ] [Nat]Added 355 Read/Feed constraints in 50 ms returned sat
[2025-05-29 20:06:30] [INFO ] Computed and/alt/rep : 252/829/252 causal constraints (skipped 140 transitions) in 33 ms.
[2025-05-29 20:06:30] [INFO ] Added : 9 causal constraints over 2 iterations in 124 ms. Result :sat
Minimization took 288 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 8 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 156/156 places, 402/402 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 8 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
[2025-05-29 20:06:30] [INFO ] Invariant cache hit.
[2025-05-29 20:06:30] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-05-29 20:06:30] [INFO ] Invariant cache hit.
[2025-05-29 20:06:31] [INFO ] State equation strengthened by 355 read => feed constraints.
[2025-05-29 20:06:31] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
[2025-05-29 20:06:31] [INFO ] Redundant transitions in 5 ms returned []
Running 392 sub problems to find dead transitions.
[2025-05-29 20:06:31] [INFO ] Invariant cache hit.
[2025-05-29 20:06:31] [INFO ] State equation strengthened by 355 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 402/557 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 355/520 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2025-05-29 20:06:42] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
[2025-05-29 20:06:42] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2025-05-29 20:06:42] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 3/523 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 392 unsolved
SMT process timed out in 30188ms, After SMT, problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 30196ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31316 ms. Remains : 156/156 places, 402/402 transitions.
[2025-05-29 20:07:02] [INFO ] Flatten gal took : 18 ms
[2025-05-29 20:07:02] [INFO ] Flatten gal took : 15 ms
[2025-05-29 20:07:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7916047627485215713.gal : 4 ms
[2025-05-29 20:07:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5464911823498307069.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/ReachabilityCardinality7916047627485215713.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5464911823498307069.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/ReachabilityCardinality5464911823498307069.prop.
RANDOM walk for 40000 steps (818 resets) in 512 ms. (77 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (78 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 38
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :38 after 43
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :43 after 46
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :46 after 51
BEST_FIRST walk for 40004 steps (73 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :51 after 58
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :58 after 88
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :88 after 494
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :494 after 2056
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2056 after 4633
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4633 after 13075
Interrupted probabilistic random walk after 780492 steps, run timeout after 3001 ms. (steps per millisecond=260 ) properties seen :0 out of 2
Probabilistic random walk after 780492 steps, saw 101853 distinct states, run finished after 3007 ms. (steps per millisecond=259 ) properties seen :0
[2025-05-29 20:07:05] [INFO ] Invariant cache hit.
[2025-05-29 20:07:05] [INFO ] State equation strengthened by 355 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/37 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 153/190 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 118/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 26/217 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/225 variables, 8/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 20:07:05] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-05-29 20:07:05] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 284/509 variables, 70/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/509 variables, 231/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/509 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 49/558 variables, 43/517 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/558 variables, 6/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/558 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/558 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 523 constraints, problems are : Problem set: 1 solved, 1 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/37 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/190 variables, 26/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 118/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/217 variables, 1/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 3/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/225 variables, 8/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 8/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 2/174 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 284/509 variables, 70/244 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/509 variables, 231/475 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/509 variables, 0/475 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 49/558 variables, 43/518 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/558 variables, 6/524 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/558 variables, 0/524 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/558 variables, 0/524 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 524 constraints, problems are : Problem set: 1 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 780ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 156/156 places, 402/402 transitions.
RANDOM walk for 40000 steps (815 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (74 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :13075 after 80101
Interrupted probabilistic random walk after 1158615 steps, run timeout after 3001 ms. (steps per millisecond=386 ) properties seen :0 out of 1
Probabilistic random walk after 1158615 steps, saw 147717 distinct states, run finished after 3001 ms. (steps per millisecond=386 ) properties seen :0
[2025-05-29 20:07:09] [INFO ] Invariant cache hit.
[2025-05-29 20:07:09] [INFO ] State equation strengthened by 355 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/37 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/190 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 118/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/217 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/225 variables, 8/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 284/509 variables, 70/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/509 variables, 231/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/509 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 49/558 variables, 43/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/558 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/558 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/558 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/37 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/190 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 118/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/217 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/225 variables, 8/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:07:09] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2025-05-29 20:07:09] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 284/509 variables, 70/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/509 variables, 231/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/509 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 49/558 variables, 43/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/558 variables, 6/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/558 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/558 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 524 constraints, problems are : Problem set: 0 solved, 1 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 648ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 156/156 places, 402/402 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 9 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
[2025-05-29 20:07:09] [INFO ] Invariant cache hit.
[2025-05-29 20:07:10] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-05-29 20:07:10] [INFO ] Invariant cache hit.
[2025-05-29 20:07:10] [INFO ] State equation strengthened by 355 read => feed constraints.
[2025-05-29 20:07:10] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
[2025-05-29 20:07:10] [INFO ] Redundant transitions in 3 ms returned []
Running 392 sub problems to find dead transitions.
[2025-05-29 20:07:10] [INFO ] Invariant cache hit.
[2025-05-29 20:07:10] [INFO ] State equation strengthened by 355 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 402/557 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 355/520 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2025-05-29 20:07:19] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2025-05-29 20:07:20] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2025-05-29 20:07:20] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 3/523 constraints. Problems are: Problem set: 0 solved, 392 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :80101 after 4.09139e+06
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 392 unsolved
SMT process timed out in 30130ms, After SMT, problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 30135ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31058 ms. Remains : 156/156 places, 402/402 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 328 edges and 156 vertex of which 116 / 156 are part of one of the 3 SCC in 1 ms
Free SCC test removed 113 places
Drop transitions (Empty/Sink Transition effects.) removed 269 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 349 transitions.
Graph (complete) has 106 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 40 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 2 transition count 3
Applied a total of 51 rules in 8 ms. Remains 2 /156 variables (removed 154) and now considering 3/402 (removed 399) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2025-05-29 20:07:40] [INFO ] Computed 0 invariants in 0 ms
[2025-05-29 20:07:40] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:07:40] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-05-29 20:07:40] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 20:07:40] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:07:40] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:07:40] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:07:40] [INFO ] Flatten gal took : 1 ms
[2025-05-29 20:07:40] [INFO ] Flatten gal took : 0 ms
[2025-05-29 20:07:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6267762909673115942.gal : 1 ms
[2025-05-29 20:07:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9282154526489280633.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/ReachabilityCardinality6267762909673115942.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9282154526489280633.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/ReachabilityCardinality9282154526489280633.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
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,9,0.002899,3480,2,7,7,42,6,0,13,34,0
Total reachable state count : 9

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

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,2,0.003246,3856,2,3,7,42,7,0,16,34,0
Over-approximation ignoring read arcs solved 0 properties in 80 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-29 20:07:41] [INFO ] Flatten gal took : 8 ms
[2025-05-29 20:07:41] [INFO ] Applying decomposition
[2025-05-29 20:07:41] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6679898860251317190.txt' '-o' '/tmp/graph6679898860251317190.bin' '-w' '/tmp/graph6679898860251317190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6679898860251317190.bin' '-l' '-1' '-v' '-w' '/tmp/graph6679898860251317190.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:07:41] [INFO ] Decomposing Gal with order
[2025-05-29 20:07:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:07:41] [INFO ] Removed a total of 327 redundant transitions.
[2025-05-29 20:07:41] [INFO ] Flatten gal took : 24 ms
[2025-05-29 20:07:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 262 labels/synchronizations in 6 ms.
[2025-05-29 20:07:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11431552470558683151.gal : 4 ms
[2025-05-29 20:07:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5530021062497232944.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/ReachabilityCardinality11431552470558683151.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5530021062497232944.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/ReachabilityCardinality5530021062497232944.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 77
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :77 after 78
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :78 after 82
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :82 after 84
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :84 after 89
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :89 after 251
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :251 after 15087
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :15087 after 541144
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :541144 after 4.15943e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.2341e+08 after 3.69057e+08
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-11 in 193482 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-14
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 410 rows 163 cols
[2025-05-29 20:08:31] [INFO ] Computed 11 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (182 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (16 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-05-29 20:08:31] [INFO ] Invariant cache hit.
[2025-05-29 20:08:31] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-05-29 20:08:31] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2025-05-29 20:08:31] [INFO ] State equation strengthened by 358 read => feed constraints.
[2025-05-29 20:08:31] [INFO ] [Real]Added 358 Read/Feed constraints in 37 ms returned sat
[2025-05-29 20:08:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:08:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-05-29 20:08:31] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2025-05-29 20:08:31] [INFO ] [Nat]Added 358 Read/Feed constraints in 70 ms returned sat
[2025-05-29 20:08:31] [INFO ] Computed and/alt/rep : 285/943/285 causal constraints (skipped 115 transitions) in 48 ms.
[2025-05-29 20:08:31] [INFO ] Added : 9 causal constraints over 2 iterations in 182 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 410/410 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 160 transition count 407
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 160 transition count 406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 159 transition count 406
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 159 transition count 406
Applied a total of 12 rules in 27 ms. Remains 159 /163 variables (removed 4) and now considering 406/410 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 159/163 places, 406/410 transitions.
// Phase 1: matrix 406 rows 159 cols
[2025-05-29 20:08:32] [INFO ] Computed 11 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (18779 resets) in 2369 ms. (421 steps per ms)
BEST_FIRST walk for 1000001 steps (1740 resets) in 575 ms. (1736 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-05-29 20:08:35] [INFO ] Invariant cache hit.
[2025-05-29 20:08:35] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-05-29 20:08:35] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2025-05-29 20:08:35] [INFO ] State equation strengthened by 368 read => feed constraints.
[2025-05-29 20:08:35] [INFO ] [Real]Added 368 Read/Feed constraints in 58 ms returned sat
[2025-05-29 20:08:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:08:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2025-05-29 20:08:35] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2025-05-29 20:08:36] [INFO ] [Nat]Added 368 Read/Feed constraints in 67 ms returned sat
[2025-05-29 20:08:36] [INFO ] Computed and/alt/rep : 283/979/283 causal constraints (skipped 113 transitions) in 48 ms.
[2025-05-29 20:08:36] [INFO ] Added : 7 causal constraints over 2 iterations in 173 ms. Result :sat
Minimization took 553 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 406/406 transitions.
Applied a total of 0 rules in 7 ms. Remains 159 /159 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 159/159 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 406/406 transitions.
Applied a total of 0 rules in 6 ms. Remains 159 /159 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2025-05-29 20:08:36] [INFO ] Invariant cache hit.
[2025-05-29 20:08:37] [INFO ] Implicit Places using invariants in 324 ms returned []
[2025-05-29 20:08:37] [INFO ] Invariant cache hit.
[2025-05-29 20:08:37] [INFO ] State equation strengthened by 368 read => feed constraints.
[2025-05-29 20:08:38] [INFO ] Implicit Places using invariants and state equation in 1254 ms returned []
Implicit Place search using SMT with State Equation took 1585 ms to find 0 implicit places.
[2025-05-29 20:08:38] [INFO ] Redundant transitions in 5 ms returned []
Running 396 sub problems to find dead transitions.
[2025-05-29 20:08:38] [INFO ] Invariant cache hit.
[2025-05-29 20:08:38] [INFO ] State equation strengthened by 368 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 20:08:41] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 2 ms to minimize.
[2025-05-29 20:08:41] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-05-29 20:08:41] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2025-05-29 20:08:41] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2025-05-29 20:08:41] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 2 ms to minimize.
[2025-05-29 20:08:41] [INFO ] Deduced a trap composed of 2 places in 160 ms of which 3 ms to minimize.
[2025-05-29 20:08:41] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2025-05-29 20:08:41] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2025-05-29 20:08:41] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2025-05-29 20:08:41] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-05-29 20:08:41] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2025-05-29 20:08:41] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2025-05-29 20:08:42] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2025-05-29 20:08:42] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 3 ms to minimize.
[2025-05-29 20:08:42] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2025-05-29 20:08:42] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2025-05-29 20:08:42] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
[2025-05-29 20:08:42] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2025-05-29 20:08:42] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2025-05-29 20:08:42] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 20:08:42] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 3 ms to minimize.
[2025-05-29 20:08:42] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2025-05-29 20:08:43] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2025-05-29 20:08:43] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2025-05-29 20:08:43] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
[2025-05-29 20:08:43] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2025-05-29 20:08:43] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2025-05-29 20:08:43] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2025-05-29 20:08:43] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2025-05-29 20:08:43] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2025-05-29 20:08:43] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2025-05-29 20:08:43] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2025-05-29 20:08:43] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2025-05-29 20:08:44] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2025-05-29 20:08:45] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 3 ms to minimize.
[2025-05-29 20:08:45] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 2 ms to minimize.
[2025-05-29 20:08:45] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2025-05-29 20:08:45] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2025-05-29 20:08:45] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 2 ms to minimize.
[2025-05-29 20:08:45] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 20:08:46] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2025-05-29 20:08:46] [INFO ] Deduced a trap composed of 2 places in 159 ms of which 2 ms to minimize.
[2025-05-29 20:08:46] [INFO ] Deduced a trap composed of 2 places in 119 ms of which 2 ms to minimize.
[2025-05-29 20:08:46] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2025-05-29 20:08:46] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2025-05-29 20:08:46] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2025-05-29 20:08:47] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2025-05-29 20:08:47] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2025-05-29 20:08:48] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2025-05-29 20:08:48] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2025-05-29 20:08:48] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2025-05-29 20:08:48] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2025-05-29 20:08:48] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 2 ms to minimize.
[2025-05-29 20:08:48] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 2 ms to minimize.
[2025-05-29 20:08:48] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2025-05-29 20:08:48] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2025-05-29 20:08:49] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2025-05-29 20:08:49] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2025-05-29 20:08:49] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2025-05-29 20:08:49] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 20:08:52] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2025-05-29 20:08:52] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2025-05-29 20:08:52] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2025-05-29 20:08:52] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
[2025-05-29 20:08:53] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2025-05-29 20:08:53] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2025-05-29 20:08:53] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 2 ms to minimize.
[2025-05-29 20:08:53] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2025-05-29 20:08:53] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
[2025-05-29 20:08:53] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2025-05-29 20:08:53] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2025-05-29 20:08:53] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 3 ms to minimize.
[2025-05-29 20:08:53] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2025-05-29 20:08:54] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2025-05-29 20:08:54] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2025-05-29 20:08:54] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2025-05-29 20:08:54] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2025-05-29 20:08:54] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2025-05-29 20:08:54] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2025-05-29 20:08:55] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 20:08:55] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2025-05-29 20:08:55] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2025-05-29 20:08:55] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 2 ms to minimize.
[2025-05-29 20:08:55] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2025-05-29 20:08:55] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
[2025-05-29 20:08:55] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2025-05-29 20:08:56] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2025-05-29 20:08:56] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2025-05-29 20:08:56] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2025-05-29 20:08:56] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2025-05-29 20:08:56] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2025-05-29 20:08:56] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:08:56] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-05-29 20:08:56] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-05-29 20:08:56] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2025-05-29 20:08:57] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2025-05-29 20:08:57] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2025-05-29 20:08:57] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-05-29 20:08:58] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 3 ms to minimize.
[2025-05-29 20:08:58] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 20:08:59] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
[2025-05-29 20:09:01] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 3 ms to minimize.
[2025-05-29 20:09:01] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2025-05-29 20:09:01] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2025-05-29 20:09:01] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2025-05-29 20:09:01] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2025-05-29 20:09:02] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2025-05-29 20:09:02] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2025-05-29 20:09:02] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2025-05-29 20:09:02] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2025-05-29 20:09:02] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2025-05-29 20:09:02] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2025-05-29 20:09:02] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2025-05-29 20:09:02] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2025-05-29 20:09:02] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2025-05-29 20:09:02] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2025-05-29 20:09:02] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2025-05-29 20:09:02] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 3 ms to minimize.
[2025-05-29 20:09:03] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 3 ms to minimize.
[2025-05-29 20:09:03] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 20:09:08] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2025-05-29 20:09:08] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2025-05-29 20:09:08] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/565 variables, and 134 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/159 constraints, ReadFeed: 0/368 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 123/123 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 123/134 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 20:09:09] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2025-05-29 20:09:09] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2025-05-29 20:09:09] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2025-05-29 20:09:10] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-05-29 20:09:10] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2025-05-29 20:09:11] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2025-05-29 20:09:11] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 7/141 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 20:09:12] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2025-05-29 20:09:12] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:09:12] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2025-05-29 20:09:12] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-29 20:09:13] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 2 ms to minimize.
[2025-05-29 20:09:13] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2025-05-29 20:09:13] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2025-05-29 20:09:14] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2025-05-29 20:09:14] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2025-05-29 20:09:14] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 20:09:16] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2025-05-29 20:09:17] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2025-05-29 20:09:17] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2025-05-29 20:09:17] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2025-05-29 20:09:17] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2025-05-29 20:09:17] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2025-05-29 20:09:17] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2025-05-29 20:09:17] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2025-05-29 20:09:17] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2025-05-29 20:09:17] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2025-05-29 20:09:17] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2025-05-29 20:09:17] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2025-05-29 20:09:18] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 13/164 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 20:09:18] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2025-05-29 20:09:18] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-05-29 20:09:19] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2025-05-29 20:09:19] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-05-29 20:09:19] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-05-29 20:09:19] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2025-05-29 20:09:21] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2025-05-29 20:09:21] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2025-05-29 20:09:21] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 9/173 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2025-05-29 20:09:22] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2025-05-29 20:09:24] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2025-05-29 20:09:24] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2025-05-29 20:09:25] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 3 ms to minimize.
[2025-05-29 20:09:25] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 11 ms to minimize.
[2025-05-29 20:09:25] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 6/179 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (OVERLAPS) 406/564 variables, 158/337 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Problem TDEAD144 is UNSAT
Problem TDEAD402 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/564 variables, 368/705 constraints. Problems are: Problem set: 2 solved, 394 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 394/1099 constraints. Problems are: Problem set: 2 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/565 variables, and 1099 constraints, problems are : Problem set: 2 solved, 394 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 158/159 constraints, ReadFeed: 368/368 constraints, PredecessorRefiner: 394/396 constraints, Known Traps: 168/168 constraints]
After SMT, in 60221ms problems are : Problem set: 2 solved, 394 unsolved
Search for dead transitions found 2 dead transitions in 60228ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 159/159 places, 404/406 transitions.
Graph (complete) has 726 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 157 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 402
Applied a total of 3 rules in 8 ms. Remains 157 /159 variables (removed 2) and now considering 402/404 (removed 2) transitions.
// Phase 1: matrix 402 rows 157 cols
[2025-05-29 20:09:38] [INFO ] Computed 11 invariants in 2 ms
[2025-05-29 20:09:38] [INFO ] Implicit Places using invariants in 193 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 209 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 156/159 places, 402/406 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 155 transition count 409
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 155 transition count 401
Applied a total of 10 rules in 15 ms. Remains 155 /156 variables (removed 1) and now considering 401/402 (removed 1) transitions.
// Phase 1: matrix 401 rows 155 cols
[2025-05-29 20:09:38] [INFO ] Computed 10 invariants in 1 ms
[2025-05-29 20:09:39] [INFO ] Implicit Places using invariants in 192 ms returned []
[2025-05-29 20:09:39] [INFO ] Invariant cache hit.
[2025-05-29 20:09:39] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-29 20:09:40] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1160 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 155/159 places, 401/406 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 63227 ms. Remains : 155/159 places, 401/406 transitions.
[2025-05-29 20:09:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20611 resets) in 3287 ms. (304 steps per ms)
BEST_FIRST walk for 1000001 steps (1849 resets) in 573 ms. (1742 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-05-29 20:09:43] [INFO ] Invariant cache hit.
[2025-05-29 20:09:44] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2025-05-29 20:09:44] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:09:44] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2025-05-29 20:09:44] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-29 20:09:44] [INFO ] [Real]Added 356 Read/Feed constraints in 63 ms returned sat
[2025-05-29 20:09:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:09:44] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2025-05-29 20:09:44] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:09:44] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2025-05-29 20:09:44] [INFO ] [Nat]Added 356 Read/Feed constraints in 81 ms returned sat
[2025-05-29 20:09:44] [INFO ] Computed and/alt/rep : 251/833/251 causal constraints (skipped 140 transitions) in 46 ms.
[2025-05-29 20:09:44] [INFO ] Added : 10 causal constraints over 3 iterations in 214 ms. Result :sat
Minimization took 363 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 9 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 155/155 places, 401/401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 7 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2025-05-29 20:09:45] [INFO ] Invariant cache hit.
[2025-05-29 20:09:45] [INFO ] Implicit Places using invariants in 310 ms returned []
[2025-05-29 20:09:45] [INFO ] Invariant cache hit.
[2025-05-29 20:09:45] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-29 20:09:46] [INFO ] Implicit Places using invariants and state equation in 821 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
[2025-05-29 20:09:46] [INFO ] Redundant transitions in 3 ms returned []
Running 391 sub problems to find dead transitions.
[2025-05-29 20:09:46] [INFO ] Invariant cache hit.
[2025-05-29 20:09:46] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/555 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 356/520 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2025-05-29 20:09:56] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 3 ms to minimize.
[2025-05-29 20:09:56] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 2/522 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (OVERLAPS) 1/556 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 556/556 variables, and 523 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 401/555 variables, 154/166 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 356/522 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 391/913 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 8 (OVERLAPS) 1/556 variables, 1/914 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 556/556 variables, and 914 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 2/2 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61344 ms. Remains : 155/155 places, 401/401 transitions.
[2025-05-29 20:10:46] [INFO ] Flatten gal took : 15 ms
[2025-05-29 20:10:46] [INFO ] Flatten gal took : 13 ms
[2025-05-29 20:10:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10697504566049359763.gal : 4 ms
[2025-05-29 20:10:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14763173996512141566.prop : 12 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/ReachabilityCardinality10697504566049359763.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14763173996512141566.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
RANDOM walk for 40000 steps (814 resets) in 319 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (71 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality14763173996512141566.prop.
BEST_FIRST walk for 40004 steps (72 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 29
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :29 after 31
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :31 after 32
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :32 after 45
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :45 after 47
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :47 after 64
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :64 after 87
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :87 after 502
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :502 after 2069
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2069 after 4691
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4691 after 25146
Interrupted probabilistic random walk after 704661 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :0 out of 2
Probabilistic random walk after 704661 steps, saw 91034 distinct states, run finished after 3001 ms. (steps per millisecond=234 ) properties seen :0
[2025-05-29 20:10:49] [INFO ] Invariant cache hit.
[2025-05-29 20:10:49] [INFO ] State equation strengthened by 356 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 50/55 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 150/205 variables, 30/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 112/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 26/231 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 8/239 variables, 8/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 8/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 281/520 variables, 73/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 234/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 19 (OVERLAPS) 36/556 variables, 36/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/556 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/556 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/55 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 150/205 variables, 30/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 112/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/231 variables, 1/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 3/162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/239 variables, 8/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 8/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 1/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 20:10:50] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2025-05-29 20:10:50] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/239 variables, 2/181 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/239 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 281/520 variables, 73/254 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 234/488 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/520 variables, 0/488 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 36/556 variables, 36/524 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/556 variables, 0/524 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/556 variables, 0/524 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 524 constraints, problems are : Problem set: 1 solved, 1 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 845ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 5 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 155/155 places, 401/401 transitions.
RANDOM walk for 40000 steps (818 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (77 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :25146 after 71573
Interrupted probabilistic random walk after 1058431 steps, run timeout after 3001 ms. (steps per millisecond=352 ) properties seen :0 out of 1
Probabilistic random walk after 1058431 steps, saw 135492 distinct states, run finished after 3003 ms. (steps per millisecond=352 ) properties seen :0
[2025-05-29 20:10:53] [INFO ] Invariant cache hit.
[2025-05-29 20:10:53] [INFO ] State equation strengthened by 356 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/55 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 150/205 variables, 30/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 112/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/231 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/239 variables, 8/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 8/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 281/520 variables, 73/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 234/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 36/556 variables, 36/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/556 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/556 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/55 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 150/205 variables, 30/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 112/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/231 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/239 variables, 8/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 8/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:10:54] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2025-05-29 20:10:54] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/239 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/239 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 281/520 variables, 73/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 234/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/520 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 36/556 variables, 36/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/556 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/556 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 524 constraints, problems are : Problem set: 0 solved, 1 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 657ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 16 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 155/155 places, 401/401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2025-05-29 20:10:54] [INFO ] Invariant cache hit.
[2025-05-29 20:10:54] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-05-29 20:10:54] [INFO ] Invariant cache hit.
[2025-05-29 20:10:54] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-29 20:10:55] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 941 ms to find 0 implicit places.
[2025-05-29 20:10:55] [INFO ] Redundant transitions in 5 ms returned []
Running 391 sub problems to find dead transitions.
[2025-05-29 20:10:55] [INFO ] Invariant cache hit.
[2025-05-29 20:10:55] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :71573 after 1.4353e+06
At refinement iteration 3 (OVERLAPS) 401/555 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 356/520 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2025-05-29 20:11:05] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 3 ms to minimize.
[2025-05-29 20:11:05] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 2/522 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 391 unsolved
SMT process timed out in 30187ms, After SMT, problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 30195ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31154 ms. Remains : 155/155 places, 401/401 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 327 edges and 155 vertex of which 115 / 155 are part of one of the 3 SCC in 1 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 268 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 348 transitions.
Graph (complete) has 106 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 40 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 2 transition count 3
Applied a total of 51 rules in 19 ms. Remains 2 /155 variables (removed 153) and now considering 3/401 (removed 398) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2025-05-29 20:11:25] [INFO ] Computed 0 invariants in 4 ms
[2025-05-29 20:11:25] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 20:11:25] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:11:25] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:11:25] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:11:25] [INFO ] Flatten gal took : 1 ms
[2025-05-29 20:11:25] [INFO ] Flatten gal took : 0 ms
[2025-05-29 20:11:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7964999574436462550.gal : 1 ms
[2025-05-29 20:11:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13479058654116641403.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/ReachabilityCardinality7964999574436462550.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13479058654116641403.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/ReachabilityCardinality13479058654116641403.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
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,9,0.003038,3480,2,7,7,42,6,0,13,34,0
Total reachable state count : 9

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

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,2,0.003356,3856,2,3,7,42,7,0,16,34,0
Over-approximation ignoring read arcs solved 0 properties in 127 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-29 20:11:25] [INFO ] Flatten gal took : 14 ms
[2025-05-29 20:11:25] [INFO ] Applying decomposition
[2025-05-29 20:11:25] [INFO ] Flatten gal took : 16 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/graph15462662805608112935.txt' '-o' '/tmp/graph15462662805608112935.bin' '-w' '/tmp/graph15462662805608112935.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15462662805608112935.bin' '-l' '-1' '-v' '-w' '/tmp/graph15462662805608112935.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:11:25] [INFO ] Decomposing Gal with order
[2025-05-29 20:11:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:11:25] [INFO ] Removed a total of 328 redundant transitions.
[2025-05-29 20:11:25] [INFO ] Flatten gal took : 23 ms
[2025-05-29 20:11:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 5 ms.
[2025-05-29 20:11:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12958516976228816855.gal : 5 ms
[2025-05-29 20:11:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8382537963376946729.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/ReachabilityCardinality12958516976228816855.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8382537963376946729.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/ReachabilityCardinality8382537963376946729.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 23
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :23 after 23
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :23 after 23
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :23 after 23
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 23
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :23 after 244
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :244 after 8622
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8622 after 96691
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :96691 after 2.50677e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6.51215e+08 after 6.60503e+08
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-14 in 224788 ms.
[2025-05-29 20:12:15] [INFO ] Flatten gal took : 10 ms
[2025-05-29 20:12:15] [INFO ] Applying decomposition
[2025-05-29 20:12:16] [INFO ] Flatten gal took : 8 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/graph9185566435077244846.txt' '-o' '/tmp/graph9185566435077244846.bin' '-w' '/tmp/graph9185566435077244846.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9185566435077244846.bin' '-l' '-1' '-v' '-w' '/tmp/graph9185566435077244846.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:12:16] [INFO ] Decomposing Gal with order
[2025-05-29 20:12:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:12:16] [INFO ] Removed a total of 320 redundant transitions.
[2025-05-29 20:12:16] [INFO ] Flatten gal took : 23 ms
[2025-05-29 20:12:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 270 labels/synchronizations in 6 ms.
[2025-05-29 20:12:16] [INFO ] Time to serialize gal into /tmp/UpperBounds6019327605777787739.gal : 4 ms
[2025-05-29 20:12:16] [INFO ] Time to serialize properties into /tmp/UpperBounds8802075085442996285.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/UpperBounds6019327605777787739.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8802075085442996285.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 ...283
Loading property file /tmp/UpperBounds8802075085442996285.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\_mod\_flat,1.71667e+09,71.9561,879412,29262,6567,1.42323e+06,30553,930,2.48834e+06,345,399503,0
Total reachable state count : 1716665390

Verifying 7 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-02 :0 <= i4.u3.Node6requestsent1 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-02,0,80.4895,879412,1,0,1.42323e+06,30553,1051,2.48834e+06,373,399503,1499
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-07 :0 <= i1.u1.Node0requestsent8 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-07,0,80.5323,879412,1,0,1.42323e+06,30553,1078,2.48834e+06,378,399503,1933
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-08 :0 <= i10.u19.Node2GiveAnswer9 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-08,0,81.2568,879412,1,0,1.42323e+06,30553,1108,2.48834e+06,378,399503,2136
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-09 :0 <= i5.u12.Node5GiveAnswer4 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-09,0,81.7364,879412,1,0,1.42323e+06,30553,1132,2.48834e+06,378,399503,2449
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-10 :0 <= i7.u14.Node6GiveAnswer3 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-10,0,82.3399,879412,1,0,1.42323e+06,30553,1154,2.48834e+06,378,399503,2590
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-11 :0 <= i4.u3.Node1GiveAnswer3 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-11 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-11,0,82.3497,879412,1,0,1.42323e+06,30553,1175,2.48834e+06,383,399503,2995
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-14 :0 <= i4.u7.Node3requestsent2 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-14,0,82.3588,879412,1,0,1.42323e+06,30553,1198,2.48834e+06,383,399503,3381
Total runtime 1726382 ms.

BK_STOP 1748549618639

--------------------
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="CANInsertWithFailure-PT-010"
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 CANInsertWithFailure-PT-010, 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 r041-smll-174853822500033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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