Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r476-tall-171620505200117.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is CANInsertWithFailure-PT-030, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505200117
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 5.6M May 18 16:42 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

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

=== Now, execution of the tool begins

BK_START 1717187607122

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-030
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:33:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 20:33:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:33:28] [INFO ] Load time of PNML (sax parser for PT used): 270 ms
[2024-05-31 20:33:28] [INFO ] Transformed 2164 places.
[2024-05-31 20:33:28] [INFO ] Transformed 5580 transitions.
[2024-05-31 20:33:28] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 407 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 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 5580 rows 2164 cols
[2024-05-31 20:33:29] [INFO ] Computed 33 invariants in 283 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:[30, 30, 30, 30, 30, 1, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
RANDOM walk for 10000 steps (13 resets) in 88 ms. (112 steps per ms)
FORMULA CANInsertWithFailure-PT-030-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150015 steps (30 resets) in 173 ms. (862 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
[2024-05-31 20:33:29] [INFO ] Invariant cache hit.
[2024-05-31 20:33:29] [INFO ] [Real]Absence check using 31 positive place invariants in 50 ms returned sat
[2024-05-31 20:33:29] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 17 ms returned sat
[2024-05-31 20:33:31] [INFO ] [Real]Absence check using state equation in 1329 ms returned sat
[2024-05-31 20:33:31] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:33:31] [INFO ] [Real]Added 1770 Read/Feed constraints in 181 ms returned sat
[2024-05-31 20:33:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:31] [INFO ] [Nat]Absence check using 31 positive place invariants in 38 ms returned sat
[2024-05-31 20:33:31] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-31 20:33:33] [INFO ] [Nat]Absence check using state equation in 1260 ms returned sat
[2024-05-31 20:33:33] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 20:33:34] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1121 ms returned unknown
[2024-05-31 20:33:34] [INFO ] [Real]Absence check using 31 positive place invariants in 36 ms returned sat
[2024-05-31 20:33:34] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-31 20:33:36] [INFO ] [Real]Absence check using state equation in 1370 ms returned sat
[2024-05-31 20:33:36] [INFO ] [Real]Added 1770 Read/Feed constraints in 167 ms returned sat
[2024-05-31 20:33:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:36] [INFO ] [Nat]Absence check using 31 positive place invariants in 38 ms returned sat
[2024-05-31 20:33:36] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Nat]Absence check using state equation in 1362 ms returned sat
[2024-05-31 20:33:38] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 20:33:39] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1015 ms returned sat
[2024-05-31 20:33:39] [INFO ] Computed and/alt/rep : 5460/8970/5460 causal constraints (skipped 90 transitions) in 310 ms.
[2024-05-31 20:33:40] [INFO ] Added : 10 causal constraints over 2 iterations in 1097 ms. Result :sat
Minimization took 1060 ms.
[2024-05-31 20:33:41] [INFO ] [Real]Absence check using 31 positive place invariants in 33 ms returned sat
[2024-05-31 20:33:41] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-31 20:33:43] [INFO ] [Real]Absence check using state equation in 1578 ms returned sat
[2024-05-31 20:33:43] [INFO ] [Real]Added 1770 Read/Feed constraints in 217 ms returned sat
[2024-05-31 20:33:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:44] [INFO ] [Nat]Absence check using 31 positive place invariants in 34 ms returned sat
[2024-05-31 20:33:44] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 16 ms returned sat
[2024-05-31 20:33:45] [INFO ] [Nat]Absence check using state equation in 1558 ms returned sat
[2024-05-31 20:33:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 20:33:46] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1092 ms returned unknown
[2024-05-31 20:33:46] [INFO ] [Real]Absence check using 31 positive place invariants in 32 ms returned sat
[2024-05-31 20:33:46] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-31 20:33:48] [INFO ] [Real]Absence check using state equation in 1450 ms returned sat
[2024-05-31 20:33:48] [INFO ] [Real]Added 1770 Read/Feed constraints in 172 ms returned sat
[2024-05-31 20:33:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:49] [INFO ] [Nat]Absence check using 31 positive place invariants in 32 ms returned sat
[2024-05-31 20:33:49] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 24 ms returned sat
[2024-05-31 20:33:50] [INFO ] [Nat]Absence check using state equation in 1450 ms returned sat
[2024-05-31 20:33:51] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 20:33:51] [INFO ] [Nat]Added 1770 Read/Feed constraints in 995 ms returned sat
[2024-05-31 20:33:51] [INFO ] Computed and/alt/rep : 5460/8970/5460 causal constraints (skipped 90 transitions) in 277 ms.
[2024-05-31 20:33:52] [INFO ] Added : 11 causal constraints over 3 iterations in 1153 ms. Result :sat
Minimization took 1021 ms.
[2024-05-31 20:33:54] [INFO ] [Real]Absence check using 31 positive place invariants in 42 ms returned sat
[2024-05-31 20:33:54] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-31 20:33:55] [INFO ] [Real]Absence check using state equation in 1242 ms returned sat
[2024-05-31 20:33:55] [INFO ] [Real]Added 1770 Read/Feed constraints in 210 ms returned sat
[2024-05-31 20:33:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:56] [INFO ] [Nat]Absence check using 31 positive place invariants in 33 ms returned sat
[2024-05-31 20:33:56] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-31 20:33:57] [INFO ] [Nat]Absence check using state equation in 1192 ms returned sat
[2024-05-31 20:33:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 20:33:58] [INFO ] [Nat]Added 1770 Read/Feed constraints in 852 ms returned sat
[2024-05-31 20:33:58] [INFO ] Computed and/alt/rep : 5460/8970/5460 causal constraints (skipped 90 transitions) in 258 ms.
[2024-05-31 20:33:59] [INFO ] Added : 11 causal constraints over 3 iterations in 1116 ms. Result :sat
Minimization took 1462 ms.
[2024-05-31 20:34:01] [INFO ] [Real]Absence check using 31 positive place invariants in 33 ms returned sat
[2024-05-31 20:34:01] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-31 20:34:02] [INFO ] [Real]Absence check using state equation in 1262 ms returned sat
[2024-05-31 20:34:02] [INFO ] [Real]Added 1770 Read/Feed constraints in 238 ms returned sat
[2024-05-31 20:34:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:34:03] [INFO ] [Nat]Absence check using 31 positive place invariants in 33 ms returned sat
[2024-05-31 20:34:03] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 17 ms returned sat
[2024-05-31 20:34:04] [INFO ] [Nat]Absence check using state equation in 1229 ms returned sat
[2024-05-31 20:34:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 20:34:05] [INFO ] [Nat]Added 1770 Read/Feed constraints in 812 ms returned sat
[2024-05-31 20:34:05] [INFO ] Computed and/alt/rep : 5460/8970/5460 causal constraints (skipped 90 transitions) in 253 ms.
[2024-05-31 20:34:06] [INFO ] Added : 10 causal constraints over 2 iterations in 966 ms. Result :sat
Minimization took 1600 ms.
[2024-05-31 20:34:08] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-31 20:34:08] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-31 20:34:09] [INFO ] [Real]Absence check using state equation in 1446 ms returned sat
[2024-05-31 20:34:09] [INFO ] [Real]Added 1770 Read/Feed constraints in 225 ms returned sat
[2024-05-31 20:34:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:34:10] [INFO ] [Nat]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-31 20:34:10] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-31 20:34:11] [INFO ] [Nat]Absence check using state equation in 1434 ms returned sat
[2024-05-31 20:34:12] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 20:34:12] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1089 ms returned unknown
[2024-05-31 20:34:13] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-31 20:34:13] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-31 20:34:14] [INFO ] [Real]Absence check using state equation in 1510 ms returned sat
[2024-05-31 20:34:14] [INFO ] [Real]Added 1770 Read/Feed constraints in 207 ms returned sat
[2024-05-31 20:34:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:34:15] [INFO ] [Nat]Absence check using 31 positive place invariants in 33 ms returned sat
[2024-05-31 20:34:15] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-31 20:34:16] [INFO ] [Nat]Absence check using state equation in 1572 ms returned sat
[2024-05-31 20:34:17] [INFO ] [Nat]Added 1770 Read/Feed constraints in 515 ms returned sat
[2024-05-31 20:34:17] [INFO ] Computed and/alt/rep : 5460/8970/5460 causal constraints (skipped 90 transitions) in 270 ms.
[2024-05-31 20:34:18] [INFO ] Added : 11 causal constraints over 3 iterations in 1144 ms. Result :sat
Minimization took 1358 ms.
[2024-05-31 20:34:20] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-31 20:34:20] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-31 20:34:21] [INFO ] [Real]Absence check using state equation in 1336 ms returned sat
[2024-05-31 20:34:21] [INFO ] [Real]Added 1770 Read/Feed constraints in 168 ms returned sat
[2024-05-31 20:34:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:34:22] [INFO ] [Nat]Absence check using 31 positive place invariants in 32 ms returned sat
[2024-05-31 20:34:22] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-31 20:34:23] [INFO ] [Nat]Absence check using state equation in 1383 ms returned sat
[2024-05-31 20:34:24] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 20:34:24] [INFO ] [Nat]Added 1770 Read/Feed constraints in 834 ms returned sat
[2024-05-31 20:34:24] [INFO ] Computed and/alt/rep : 5460/8970/5460 causal constraints (skipped 90 transitions) in 266 ms.
[2024-05-31 20:34:25] [INFO ] Added : 10 causal constraints over 2 iterations in 955 ms. Result :sat
Minimization took 1433 ms.
[2024-05-31 20:34:27] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-31 20:34:27] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-31 20:34:29] [INFO ] [Real]Absence check using state equation in 1784 ms returned sat
[2024-05-31 20:34:29] [INFO ] [Real]Added 1770 Read/Feed constraints in 192 ms returned sat
[2024-05-31 20:34:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:34:29] [INFO ] [Nat]Absence check using 31 positive place invariants in 34 ms returned sat
[2024-05-31 20:34:29] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-31 20:34:31] [INFO ] [Nat]Absence check using state equation in 1765 ms returned sat
[2024-05-31 20:34:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 20:34:32] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1089 ms returned unknown
[2024-05-31 20:34:32] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-31 20:34:32] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-31 20:34:34] [INFO ] [Real]Absence check using state equation in 1606 ms returned sat
[2024-05-31 20:34:35] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 20:34:35] [INFO ] [Real]Added 1770 Read/Feed constraints in 639 ms returned sat
[2024-05-31 20:34:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:34:35] [INFO ] [Nat]Absence check using 31 positive place invariants in 34 ms returned sat
[2024-05-31 20:34:35] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-31 20:34:37] [INFO ] [Nat]Absence check using state equation in 1719 ms returned sat
[2024-05-31 20:34:37] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 20:34:38] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1086 ms returned unknown
[2024-05-31 20:34:38] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-31 20:34:38] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 16 ms returned sat
[2024-05-31 20:34:40] [INFO ] [Real]Absence check using state equation in 1578 ms returned sat
[2024-05-31 20:34:40] [INFO ] [Real]Added 1770 Read/Feed constraints in 381 ms returned sat
[2024-05-31 20:34:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:34:41] [INFO ] [Nat]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-31 20:34:41] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-31 20:34:42] [INFO ] [Nat]Absence check using state equation in 1558 ms returned sat
[2024-05-31 20:34:43] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 20:34:43] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1096 ms returned unknown
[2024-05-31 20:34:43] [INFO ] [Real]Absence check using 31 positive place invariants in 32 ms returned sat
[2024-05-31 20:34:43] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-31 20:34:45] [INFO ] [Real]Absence check using state equation in 1535 ms returned sat
[2024-05-31 20:34:46] [INFO ] [Real]Added 1770 Read/Feed constraints in 475 ms returned sat
[2024-05-31 20:34:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:34:46] [INFO ] [Nat]Absence check using 31 positive place invariants in 33 ms returned sat
[2024-05-31 20:34:46] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-31 20:34:48] [INFO ] [Nat]Absence check using state equation in 1661 ms returned sat
[2024-05-31 20:34:48] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 20:34:49] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1085 ms returned unknown
[2024-05-31 20:34:49] [INFO ] [Real]Absence check using 31 positive place invariants in 32 ms returned sat
[2024-05-31 20:34:49] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 16 ms returned sat
[2024-05-31 20:34:51] [INFO ] [Real]Absence check using state equation in 1842 ms returned sat
[2024-05-31 20:34:51] [INFO ] [Real]Added 1770 Read/Feed constraints in 284 ms returned sat
[2024-05-31 20:34:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:34:52] [INFO ] [Nat]Absence check using 31 positive place invariants in 32 ms returned sat
[2024-05-31 20:34:52] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-31 20:34:53] [INFO ] [Nat]Absence check using state equation in 1845 ms returned sat
[2024-05-31 20:34:54] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 20:34:54] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1091 ms returned unknown
[2024-05-31 20:34:55] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-31 20:34:55] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-31 20:34:56] [INFO ] [Real]Absence check using state equation in 1682 ms returned sat
[2024-05-31 20:34:57] [INFO ] [Real]Added 1770 Read/Feed constraints in 305 ms returned sat
[2024-05-31 20:34:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:34:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 36 ms returned sat
[2024-05-31 20:34:57] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-31 20:34:59] [INFO ] [Nat]Absence check using state equation in 1733 ms returned sat
[2024-05-31 20:34:59] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 20:35:00] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1084 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Support contains 15 out of 2164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Graph (complete) has 7651 edges and 2164 vertex of which 2163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 211 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 421 place count 1953 transition count 5370
Performed 863 Post agglomeration using F-continuation condition.Transition count delta: 863
Deduced a syphon composed of 863 places in 2 ms
Reduce places removed 863 places and 0 transitions.
Iterating global reduction 2 with 1726 rules applied. Total rules applied 2147 place count 1090 transition count 4507
Drop transitions (Redundant composition of simpler transitions.) removed 805 transitions
Redundant transition composition rules discarded 805 transitions
Iterating global reduction 2 with 805 rules applied. Total rules applied 2952 place count 1090 transition count 3702
Partial Free-agglomeration rule applied 950 times.
Drop transitions (Partial Free agglomeration) removed 950 transitions
Iterating global reduction 2 with 950 rules applied. Total rules applied 3902 place count 1090 transition count 3702
Applied a total of 3902 rules in 1016 ms. Remains 1090 /2164 variables (removed 1074) and now considering 3702/5580 (removed 1878) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1034 ms. Remains : 1090/2164 places, 3702/5580 transitions.
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-31 20:35:01] [INFO ] Computed 32 invariants in 73 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
RANDOM walk for 1000000 steps (7129 resets) in 7822 ms. (127 steps per ms)
BEST_FIRST walk for 15000015 steps (3073 resets) in 15539 ms. (965 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
[2024-05-31 20:35:24] [INFO ] Invariant cache hit.
[2024-05-31 20:35:25] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:35:25] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:35:25] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2024-05-31 20:35:25] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-31 20:35:26] [INFO ] [Real]Added 3582 Read/Feed constraints in 276 ms returned sat
[2024-05-31 20:35:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:26] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:35:26] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:35:27] [INFO ] [Nat]Absence check using state equation in 654 ms returned sat
[2024-05-31 20:35:27] [INFO ] [Nat]Added 3582 Read/Feed constraints in 277 ms returned sat
[2024-05-31 20:35:27] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 198 ms.
[2024-05-31 20:35:27] [INFO ] Added : 5 causal constraints over 1 iterations in 569 ms. Result :sat
Minimization took 4740 ms.
[2024-05-31 20:35:32] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:35:32] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2024-05-31 20:35:33] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2024-05-31 20:35:33] [INFO ] [Real]Added 3582 Read/Feed constraints in 250 ms returned sat
[2024-05-31 20:35:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:33] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:35:34] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:35:34] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2024-05-31 20:35:34] [INFO ] [Nat]Added 3582 Read/Feed constraints in 274 ms returned sat
[2024-05-31 20:35:35] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 186 ms.
[2024-05-31 20:35:35] [INFO ] Added : 6 causal constraints over 2 iterations in 648 ms. Result :sat
Minimization took 4642 ms.
[2024-05-31 20:35:40] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:35:40] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:35:40] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2024-05-31 20:35:41] [INFO ] [Real]Added 3582 Read/Feed constraints in 242 ms returned sat
[2024-05-31 20:35:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:41] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:35:41] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-31 20:35:42] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2024-05-31 20:35:42] [INFO ] [Nat]Added 3582 Read/Feed constraints in 264 ms returned sat
[2024-05-31 20:35:42] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 187 ms.
[2024-05-31 20:35:43] [INFO ] Added : 6 causal constraints over 2 iterations in 651 ms. Result :sat
Minimization took 4643 ms.
[2024-05-31 20:35:47] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-31 20:35:47] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2024-05-31 20:35:48] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2024-05-31 20:35:48] [INFO ] [Real]Added 3582 Read/Feed constraints in 258 ms returned sat
[2024-05-31 20:35:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:48] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-31 20:35:49] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:35:49] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2024-05-31 20:35:49] [INFO ] [Nat]Added 3582 Read/Feed constraints in 319 ms returned sat
[2024-05-31 20:35:50] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 185 ms.
[2024-05-31 20:35:50] [INFO ] Added : 8 causal constraints over 2 iterations in 665 ms. Result :sat
Minimization took 4675 ms.
[2024-05-31 20:35:55] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:35:55] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:35:56] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2024-05-31 20:35:56] [INFO ] [Real]Added 3582 Read/Feed constraints in 252 ms returned sat
[2024-05-31 20:35:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:56] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-31 20:35:56] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:35:57] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2024-05-31 20:35:57] [INFO ] [Nat]Added 3582 Read/Feed constraints in 298 ms returned sat
[2024-05-31 20:35:57] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 180 ms.
[2024-05-31 20:35:58] [INFO ] Added : 13 causal constraints over 3 iterations in 770 ms. Result :sat
Minimization took 4638 ms.
[2024-05-31 20:36:03] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-31 20:36:03] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-31 20:36:03] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2024-05-31 20:36:03] [INFO ] [Real]Added 3582 Read/Feed constraints in 242 ms returned sat
[2024-05-31 20:36:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:36:04] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:36:04] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:36:04] [INFO ] [Nat]Absence check using state equation in 568 ms returned sat
[2024-05-31 20:36:05] [INFO ] [Nat]Added 3582 Read/Feed constraints in 289 ms returned sat
[2024-05-31 20:36:05] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 183 ms.
[2024-05-31 20:36:05] [INFO ] Added : 7 causal constraints over 2 iterations in 641 ms. Result :sat
Minimization took 4594 ms.
[2024-05-31 20:36:10] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:36:10] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:36:11] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2024-05-31 20:36:11] [INFO ] [Real]Added 3582 Read/Feed constraints in 263 ms returned sat
[2024-05-31 20:36:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:36:11] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:36:11] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:36:12] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2024-05-31 20:36:12] [INFO ] [Nat]Added 3582 Read/Feed constraints in 249 ms returned sat
[2024-05-31 20:36:12] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 177 ms.
[2024-05-31 20:36:13] [INFO ] Added : 4 causal constraints over 1 iterations in 547 ms. Result :sat
Minimization took 4654 ms.
[2024-05-31 20:36:17] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-31 20:36:17] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:36:18] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2024-05-31 20:36:18] [INFO ] [Real]Added 3582 Read/Feed constraints in 265 ms returned sat
[2024-05-31 20:36:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:36:19] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-31 20:36:19] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:36:19] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2024-05-31 20:36:19] [INFO ] [Nat]Added 3582 Read/Feed constraints in 329 ms returned sat
[2024-05-31 20:36:20] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 173 ms.
[2024-05-31 20:36:20] [INFO ] Added : 10 causal constraints over 2 iterations in 659 ms. Result :sat
Minimization took 4616 ms.
[2024-05-31 20:36:25] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:36:25] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:36:26] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2024-05-31 20:36:26] [INFO ] [Real]Added 3582 Read/Feed constraints in 253 ms returned sat
[2024-05-31 20:36:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:36:26] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:36:26] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:36:27] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2024-05-31 20:36:27] [INFO ] [Nat]Added 3582 Read/Feed constraints in 275 ms returned sat
[2024-05-31 20:36:27] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 165 ms.
[2024-05-31 20:36:28] [INFO ] Added : 4 causal constraints over 1 iterations in 521 ms. Result :sat
Minimization took 4534 ms.
[2024-05-31 20:36:32] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:36:32] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:36:33] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2024-05-31 20:36:33] [INFO ] [Real]Added 3582 Read/Feed constraints in 259 ms returned sat
[2024-05-31 20:36:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:36:33] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:36:33] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:36:34] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2024-05-31 20:36:34] [INFO ] [Nat]Added 3582 Read/Feed constraints in 388 ms returned sat
[2024-05-31 20:36:35] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 160 ms.
[2024-05-31 20:36:35] [INFO ] Added : 10 causal constraints over 2 iterations in 627 ms. Result :sat
Minimization took 4509 ms.
[2024-05-31 20:36:40] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:36:40] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:36:40] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2024-05-31 20:36:41] [INFO ] [Real]Added 3582 Read/Feed constraints in 257 ms returned sat
[2024-05-31 20:36:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:36:41] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:36:41] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:36:41] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2024-05-31 20:36:42] [INFO ] [Nat]Added 3582 Read/Feed constraints in 306 ms returned sat
[2024-05-31 20:36:42] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 172 ms.
[2024-05-31 20:36:42] [INFO ] Added : 9 causal constraints over 2 iterations in 634 ms. Result :sat
Minimization took 4509 ms.
[2024-05-31 20:36:47] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:36:47] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-31 20:36:48] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2024-05-31 20:36:48] [INFO ] [Real]Added 3582 Read/Feed constraints in 260 ms returned sat
[2024-05-31 20:36:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:36:48] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:36:48] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:36:49] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2024-05-31 20:36:49] [INFO ] [Nat]Added 3582 Read/Feed constraints in 304 ms returned sat
[2024-05-31 20:36:49] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 166 ms.
[2024-05-31 20:36:50] [INFO ] Added : 10 causal constraints over 2 iterations in 639 ms. Result :sat
Minimization took 4526 ms.
[2024-05-31 20:36:55] [INFO ] [Real]Absence check using 30 positive place invariants in 25 ms returned sat
[2024-05-31 20:36:55] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:36:55] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2024-05-31 20:36:55] [INFO ] [Real]Added 3582 Read/Feed constraints in 253 ms returned sat
[2024-05-31 20:36:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:36:56] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:36:56] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:36:56] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2024-05-31 20:36:56] [INFO ] [Nat]Added 3582 Read/Feed constraints in 262 ms returned sat
[2024-05-31 20:36:57] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 172 ms.
[2024-05-31 20:36:57] [INFO ] Added : 8 causal constraints over 2 iterations in 631 ms. Result :sat
Minimization took 4502 ms.
[2024-05-31 20:37:02] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:37:02] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2024-05-31 20:37:02] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2024-05-31 20:37:03] [INFO ] [Real]Added 3582 Read/Feed constraints in 278 ms returned sat
[2024-05-31 20:37:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:37:03] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:37:03] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:37:04] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2024-05-31 20:37:04] [INFO ] [Nat]Added 3582 Read/Feed constraints in 359 ms returned sat
[2024-05-31 20:37:04] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 169 ms.
[2024-05-31 20:37:05] [INFO ] Added : 9 causal constraints over 2 iterations in 641 ms. Result :sat
Minimization took 4517 ms.
[2024-05-31 20:37:09] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:37:09] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:37:10] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2024-05-31 20:37:10] [INFO ] [Real]Added 3582 Read/Feed constraints in 262 ms returned sat
[2024-05-31 20:37:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:37:10] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:37:10] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:37:11] [INFO ] [Nat]Absence check using state equation in 590 ms returned sat
[2024-05-31 20:37:11] [INFO ] [Nat]Added 3582 Read/Feed constraints in 278 ms returned sat
[2024-05-31 20:37:12] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 171 ms.
[2024-05-31 20:37:12] [INFO ] Added : 9 causal constraints over 2 iterations in 643 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Support contains 15 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Applied a total of 0 rules in 91 ms. Remains 1090 /1090 variables (removed 0) and now considering 3702/3702 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 1090/1090 places, 3702/3702 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Applied a total of 0 rules in 95 ms. Remains 1090 /1090 variables (removed 0) and now considering 3702/3702 (removed 0) transitions.
[2024-05-31 20:37:17] [INFO ] Invariant cache hit.
[2024-05-31 20:37:18] [INFO ] Implicit Places using invariants in 992 ms returned []
[2024-05-31 20:37:18] [INFO ] Invariant cache hit.
[2024-05-31 20:37:19] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-31 20:37:37] [INFO ] Implicit Places using invariants and state equation in 19231 ms returned []
Implicit Place search using SMT with State Equation took 20227 ms to find 0 implicit places.
[2024-05-31 20:37:37] [INFO ] Redundant transitions in 192 ms returned []
Running 3672 sub problems to find dead transitions.
[2024-05-31 20:37:37] [INFO ] Invariant cache hit.
[2024-05-31 20:37:37] [INFO ] State equation strengthened by 3582 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1089 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3672 unsolved
SMT process timed out in 32676ms, After SMT, problems are : Problem set: 0 solved, 3672 unsolved
Search for dead transitions found 0 dead transitions in 32732ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53282 ms. Remains : 1090/1090 places, 3702/3702 transitions.
[2024-05-31 20:38:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
RANDOM walk for 1000000 steps (7140 resets) in 7697 ms. (129 steps per ms)
BEST_FIRST walk for 15000015 steps (3043 resets) in 15028 ms. (998 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
[2024-05-31 20:38:33] [INFO ] Invariant cache hit.
[2024-05-31 20:38:33] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:38:33] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:38:33] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2024-05-31 20:38:34] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-31 20:38:34] [INFO ] [Real]Added 3582 Read/Feed constraints in 263 ms returned sat
[2024-05-31 20:38:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:34] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:38:34] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:38:35] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2024-05-31 20:38:35] [INFO ] [Nat]Added 3582 Read/Feed constraints in 265 ms returned sat
[2024-05-31 20:38:35] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 173 ms.
[2024-05-31 20:38:35] [INFO ] Added : 5 causal constraints over 1 iterations in 527 ms. Result :sat
Minimization took 4525 ms.
[2024-05-31 20:38:40] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:38:40] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:38:41] [INFO ] [Real]Absence check using state equation in 583 ms returned sat
[2024-05-31 20:38:41] [INFO ] [Real]Added 3582 Read/Feed constraints in 236 ms returned sat
[2024-05-31 20:38:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:41] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:38:41] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-31 20:38:42] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2024-05-31 20:38:42] [INFO ] [Nat]Added 3582 Read/Feed constraints in 269 ms returned sat
[2024-05-31 20:38:42] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 168 ms.
[2024-05-31 20:38:43] [INFO ] Added : 6 causal constraints over 2 iterations in 628 ms. Result :sat
Minimization took 4501 ms.
[2024-05-31 20:38:47] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-31 20:38:47] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:38:48] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2024-05-31 20:38:48] [INFO ] [Real]Added 3582 Read/Feed constraints in 241 ms returned sat
[2024-05-31 20:38:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:49] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-31 20:38:49] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:38:49] [INFO ] [Nat]Absence check using state equation in 590 ms returned sat
[2024-05-31 20:38:49] [INFO ] [Nat]Added 3582 Read/Feed constraints in 262 ms returned sat
[2024-05-31 20:38:50] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 170 ms.
[2024-05-31 20:38:50] [INFO ] Added : 6 causal constraints over 2 iterations in 631 ms. Result :sat
Minimization took 4502 ms.
[2024-05-31 20:38:55] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:38:55] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-31 20:38:55] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2024-05-31 20:38:56] [INFO ] [Real]Added 3582 Read/Feed constraints in 253 ms returned sat
[2024-05-31 20:38:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:56] [INFO ] [Nat]Absence check using 30 positive place invariants in 34 ms returned sat
[2024-05-31 20:38:56] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:38:56] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2024-05-31 20:38:57] [INFO ] [Nat]Added 3582 Read/Feed constraints in 313 ms returned sat
[2024-05-31 20:38:57] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 180 ms.
[2024-05-31 20:38:57] [INFO ] Added : 8 causal constraints over 2 iterations in 651 ms. Result :sat
Minimization took 4514 ms.
[2024-05-31 20:39:02] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:39:02] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:39:03] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2024-05-31 20:39:03] [INFO ] [Real]Added 3582 Read/Feed constraints in 250 ms returned sat
[2024-05-31 20:39:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:39:03] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:39:03] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:39:04] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2024-05-31 20:39:04] [INFO ] [Nat]Added 3582 Read/Feed constraints in 301 ms returned sat
[2024-05-31 20:39:04] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 168 ms.
[2024-05-31 20:39:05] [INFO ] Added : 13 causal constraints over 3 iterations in 747 ms. Result :sat
Minimization took 4531 ms.
[2024-05-31 20:39:10] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:39:10] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:39:10] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2024-05-31 20:39:11] [INFO ] [Real]Added 3582 Read/Feed constraints in 234 ms returned sat
[2024-05-31 20:39:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:39:11] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:39:11] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:39:11] [INFO ] [Nat]Absence check using state equation in 577 ms returned sat
[2024-05-31 20:39:12] [INFO ] [Nat]Added 3582 Read/Feed constraints in 280 ms returned sat
[2024-05-31 20:39:12] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 167 ms.
[2024-05-31 20:39:12] [INFO ] Added : 7 causal constraints over 2 iterations in 624 ms. Result :sat
Minimization took 4514 ms.
[2024-05-31 20:39:17] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:39:17] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:39:18] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2024-05-31 20:39:18] [INFO ] [Real]Added 3582 Read/Feed constraints in 267 ms returned sat
[2024-05-31 20:39:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:39:18] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:39:18] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:39:19] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2024-05-31 20:39:19] [INFO ] [Nat]Added 3582 Read/Feed constraints in 254 ms returned sat
[2024-05-31 20:39:19] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 169 ms.
[2024-05-31 20:39:20] [INFO ] Added : 4 causal constraints over 1 iterations in 524 ms. Result :sat
Minimization took 4523 ms.
[2024-05-31 20:39:24] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:39:24] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:39:25] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2024-05-31 20:39:25] [INFO ] [Real]Added 3582 Read/Feed constraints in 252 ms returned sat
[2024-05-31 20:39:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:39:25] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:39:25] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:39:26] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2024-05-31 20:39:26] [INFO ] [Nat]Added 3582 Read/Feed constraints in 318 ms returned sat
[2024-05-31 20:39:26] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 166 ms.
[2024-05-31 20:39:27] [INFO ] Added : 10 causal constraints over 2 iterations in 641 ms. Result :sat
Minimization took 4504 ms.
[2024-05-31 20:39:32] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:39:32] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:39:32] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2024-05-31 20:39:33] [INFO ] [Real]Added 3582 Read/Feed constraints in 272 ms returned sat
[2024-05-31 20:39:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:39:33] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:39:33] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:39:33] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2024-05-31 20:39:34] [INFO ] [Nat]Added 3582 Read/Feed constraints in 279 ms returned sat
[2024-05-31 20:39:34] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 171 ms.
[2024-05-31 20:39:34] [INFO ] Added : 4 causal constraints over 1 iterations in 518 ms. Result :sat
Minimization took 4517 ms.
[2024-05-31 20:39:39] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:39:39] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2024-05-31 20:39:40] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2024-05-31 20:39:40] [INFO ] [Real]Added 3582 Read/Feed constraints in 277 ms returned sat
[2024-05-31 20:39:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:39:40] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:39:40] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:39:41] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2024-05-31 20:39:41] [INFO ] [Nat]Added 3582 Read/Feed constraints in 410 ms returned sat
[2024-05-31 20:39:41] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 197 ms.
[2024-05-31 20:39:42] [INFO ] Added : 10 causal constraints over 2 iterations in 676 ms. Result :sat
Minimization took 4502 ms.
[2024-05-31 20:39:47] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:39:47] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:39:47] [INFO ] [Real]Absence check using state equation in 645 ms returned sat
[2024-05-31 20:39:48] [INFO ] [Real]Added 3582 Read/Feed constraints in 262 ms returned sat
[2024-05-31 20:39:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:39:48] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:39:48] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:39:48] [INFO ] [Nat]Absence check using state equation in 610 ms returned sat
[2024-05-31 20:39:49] [INFO ] [Nat]Added 3582 Read/Feed constraints in 309 ms returned sat
[2024-05-31 20:39:49] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 197 ms.
[2024-05-31 20:39:49] [INFO ] Added : 9 causal constraints over 2 iterations in 671 ms. Result :sat
Minimization took 4512 ms.
[2024-05-31 20:39:54] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:39:54] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:39:55] [INFO ] [Real]Absence check using state equation in 645 ms returned sat
[2024-05-31 20:39:55] [INFO ] [Real]Added 3582 Read/Feed constraints in 277 ms returned sat
[2024-05-31 20:39:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:39:55] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-31 20:39:55] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:39:56] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2024-05-31 20:39:56] [INFO ] [Nat]Added 3582 Read/Feed constraints in 320 ms returned sat
[2024-05-31 20:39:57] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 197 ms.
[2024-05-31 20:39:57] [INFO ] Added : 10 causal constraints over 2 iterations in 691 ms. Result :sat
Minimization took 4506 ms.
[2024-05-31 20:40:02] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:40:02] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:40:02] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2024-05-31 20:40:03] [INFO ] [Real]Added 3582 Read/Feed constraints in 273 ms returned sat
[2024-05-31 20:40:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:40:03] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:40:03] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:40:03] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2024-05-31 20:40:04] [INFO ] [Nat]Added 3582 Read/Feed constraints in 274 ms returned sat
[2024-05-31 20:40:04] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 170 ms.
[2024-05-31 20:40:04] [INFO ] Added : 8 causal constraints over 2 iterations in 626 ms. Result :sat
Minimization took 4507 ms.
[2024-05-31 20:40:09] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:40:09] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:40:10] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2024-05-31 20:40:10] [INFO ] [Real]Added 3582 Read/Feed constraints in 279 ms returned sat
[2024-05-31 20:40:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:40:10] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:40:10] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:40:11] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2024-05-31 20:40:11] [INFO ] [Nat]Added 3582 Read/Feed constraints in 371 ms returned sat
[2024-05-31 20:40:11] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 172 ms.
[2024-05-31 20:40:12] [INFO ] Added : 9 causal constraints over 2 iterations in 642 ms. Result :sat
Minimization took 4511 ms.
[2024-05-31 20:40:17] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:40:17] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:40:17] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2024-05-31 20:40:18] [INFO ] [Real]Added 3582 Read/Feed constraints in 254 ms returned sat
[2024-05-31 20:40:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:40:18] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-31 20:40:18] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:40:18] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2024-05-31 20:40:19] [INFO ] [Nat]Added 3582 Read/Feed constraints in 270 ms returned sat
[2024-05-31 20:40:19] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 175 ms.
[2024-05-31 20:40:19] [INFO ] Added : 9 causal constraints over 2 iterations in 633 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Support contains 15 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Applied a total of 0 rules in 72 ms. Remains 1090 /1090 variables (removed 0) and now considering 3702/3702 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1090/1090 places, 3702/3702 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Applied a total of 0 rules in 69 ms. Remains 1090 /1090 variables (removed 0) and now considering 3702/3702 (removed 0) transitions.
[2024-05-31 20:40:24] [INFO ] Invariant cache hit.
[2024-05-31 20:40:25] [INFO ] Implicit Places using invariants in 932 ms returned []
[2024-05-31 20:40:25] [INFO ] Invariant cache hit.
[2024-05-31 20:40:26] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-31 20:40:45] [INFO ] Implicit Places using invariants and state equation in 19955 ms returned []
Implicit Place search using SMT with State Equation took 20889 ms to find 0 implicit places.
[2024-05-31 20:40:45] [INFO ] Redundant transitions in 204 ms returned []
Running 3672 sub problems to find dead transitions.
[2024-05-31 20:40:45] [INFO ] Invariant cache hit.
[2024-05-31 20:40:45] [INFO ] State equation strengthened by 3582 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1089 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3672 unsolved
SMT process timed out in 32497ms, After SMT, problems are : Problem set: 0 solved, 3672 unsolved
Search for dead transitions found 0 dead transitions in 32529ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53712 ms. Remains : 1090/1090 places, 3702/3702 transitions.
RANDOM walk for 40000 steps (283 resets) in 1635 ms. (24 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 161587 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 30
Probabilistic random walk after 161587 steps, saw 30559 distinct states, run finished after 3007 ms. (steps per millisecond=53 ) properties seen :0
[2024-05-31 20:41:21] [INFO ] Invariant cache hit.
[2024-05-31 20:41:21] [INFO ] State equation strengthened by 3582 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1028 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-31 20:41:21] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 11 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-31 20:41:22] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-05-31 20:41:22] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:41:22] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:41:22] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 0 ms to minimize.
[2024-05-31 20:41:22] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:41:22] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:41:22] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:41:22] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:41:22] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:41:22] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:41:22] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:41:22] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:41:22] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 0 ms to minimize.
[2024-05-31 20:41:22] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 0 ms to minimize.
[2024-05-31 20:41:22] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:41:22] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
[2024-05-31 20:41:22] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 0 ms to minimize.
[2024-05-31 20:41:22] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:41:22] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 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
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
Problem MAX9 is UNSAT
Problem MAX10 is UNSAT
Problem MAX11 is UNSAT
Problem MAX12 is UNSAT
Problem MAX13 is UNSAT
Problem MAX14 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 20/21 constraints. Problems are: Problem set: 15 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 58/1086 variables, 29/50 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1086 variables, 0/50 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 2/1088 variables, 2/52 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1088 variables, 0/52 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 3702/4790 variables, 1088/1140 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4790 variables, 3582/4722 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4790 variables, 0/4722 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 2/4792 variables, 2/4724 constraints. Problems are: Problem set: 15 solved, 15 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 Real declared 4792/4792 variables, and 4724 constraints, problems are : Problem set: 15 solved, 15 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1090/1090 constraints, ReadFeed: 3582/3582 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 15 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1028 variables, 1/1 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 20/21 constraints. Problems are: Problem set: 15 solved, 15 unsolved
[2024-05-31 20:41:26] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-31 20:41:27] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:41:27] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:41:27] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:41:27] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-31 20:41:27] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2024-05-31 20:41:27] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:41:27] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:41:27] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 9/30 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 0/30 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 58/1086 variables, 29/59 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1086 variables, 0/59 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 2/1088 variables, 2/61 constraints. Problems are: Problem set: 15 solved, 15 unsolved
[2024-05-31 20:41:28] [INFO ] Deduced a trap composed of 42 places in 584 ms of which 6 ms to minimize.
[2024-05-31 20:41:29] [INFO ] Deduced a trap composed of 49 places in 606 ms of which 6 ms to minimize.
[2024-05-31 20:41:30] [INFO ] Deduced a trap composed of 37 places in 580 ms of which 6 ms to minimize.
[2024-05-31 20:41:30] [INFO ] Deduced a trap composed of 37 places in 571 ms of which 6 ms to minimize.
[2024-05-31 20:41:31] [INFO ] Deduced a trap composed of 39 places in 556 ms of which 6 ms to minimize.
[2024-05-31 20:41:31] [INFO ] Deduced a trap composed of 56 places in 557 ms of which 8 ms to minimize.
SMT process timed out in 10134ms, After SMT, problems are : Problem set: 15 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Applied a total of 0 rules in 70 ms. Remains 1090 /1090 variables (removed 0) and now considering 3702/3702 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 1090/1090 places, 3702/3702 transitions.
RANDOM walk for 40000 steps (280 resets) in 699 ms. (57 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 175032 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 15
Probabilistic random walk after 175032 steps, saw 32092 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2024-05-31 20:41:35] [INFO ] Invariant cache hit.
[2024-05-31 20:41:35] [INFO ] State equation strengthened by 3582 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1028 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 58/1086 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1086 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 2/1088 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1088 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 3702/4790 variables, 1088/1120 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4790 variables, 3582/4702 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4790 variables, 0/4702 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 2/4792 variables, 2/4704 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4792 variables, 0/4704 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/4792 variables, 0/4704 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4792/4792 variables, and 4704 constraints, problems are : Problem set: 0 solved, 15 unsolved in 6885 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1090/1090 constraints, ReadFeed: 3582/3582 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1028 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-31 20:41:42] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 58/1086 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1086 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 2/1088 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-31 20:41:43] [INFO ] Deduced a trap composed of 42 places in 610 ms of which 6 ms to minimize.
[2024-05-31 20:41:43] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1088 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 3702/4790 variables, 1088/1123 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4790 variables, 3582/4705 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4790 variables, 15/4720 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4790 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SMT process timed out in 51958ms, After SMT, problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1155 ms.
Support contains 15 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Applied a total of 0 rules in 85 ms. Remains 1090 /1090 variables (removed 0) and now considering 3702/3702 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 1090/1090 places, 3702/3702 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Applied a total of 0 rules in 66 ms. Remains 1090 /1090 variables (removed 0) and now considering 3702/3702 (removed 0) transitions.
[2024-05-31 20:42:28] [INFO ] Invariant cache hit.
[2024-05-31 20:42:29] [INFO ] Implicit Places using invariants in 927 ms returned []
[2024-05-31 20:42:29] [INFO ] Invariant cache hit.
[2024-05-31 20:42:30] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-31 20:42:48] [INFO ] Implicit Places using invariants and state equation in 18817 ms returned []
Implicit Place search using SMT with State Equation took 19745 ms to find 0 implicit places.
[2024-05-31 20:42:48] [INFO ] Redundant transitions in 119 ms returned []
Running 3672 sub problems to find dead transitions.
[2024-05-31 20:42:48] [INFO ] Invariant cache hit.
[2024-05-31 20:42:48] [INFO ] State equation strengthened by 3582 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1089 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3672 unsolved
SMT process timed out in 32302ms, After SMT, problems are : Problem set: 0 solved, 3672 unsolved
Search for dead transitions found 0 dead transitions in 32334ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52279 ms. Remains : 1090/1090 places, 3702/3702 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-00
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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
[2024-05-31 20:43:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 85 ms. (116 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 20:43:20] [INFO ] Invariant cache hit.
[2024-05-31 20:43:20] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:43:20] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:43:21] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2024-05-31 20:43:21] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-31 20:43:21] [INFO ] [Real]Added 3582 Read/Feed constraints in 270 ms returned sat
[2024-05-31 20:43:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:22] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:43:22] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:43:22] [INFO ] [Nat]Absence check using state equation in 643 ms returned sat
[2024-05-31 20:43:23] [INFO ] [Nat]Added 3582 Read/Feed constraints in 276 ms returned sat
[2024-05-31 20:43:23] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 200 ms.
[2024-05-31 20:43:23] [INFO ] Added : 5 causal constraints over 1 iterations in 563 ms. Result :sat
Minimization took 954 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1083 transition count 3695
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 1083 transition count 3694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 1082 transition count 3694
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 1082 transition count 3694
Applied a total of 24 rules in 250 ms. Remains 1082 /1090 variables (removed 8) and now considering 3694/3702 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 1082/1090 places, 3694/3702 transitions.
// Phase 1: matrix 3694 rows 1082 cols
[2024-05-31 20:43:25] [INFO ] Computed 32 invariants in 61 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7147 resets) in 8391 ms. (119 steps per ms)
BEST_FIRST walk for 1000001 steps (201 resets) in 1139 ms. (877 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 20:43:34] [INFO ] Invariant cache hit.
[2024-05-31 20:43:34] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:43:34] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:43:35] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2024-05-31 20:43:35] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-31 20:43:35] [INFO ] [Real]Added 3604 Read/Feed constraints in 265 ms returned sat
[2024-05-31 20:43:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:35] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:43:35] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:43:36] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2024-05-31 20:43:36] [INFO ] [Nat]Added 3604 Read/Feed constraints in 269 ms returned sat
[2024-05-31 20:43:37] [INFO ] Computed and/alt/rep : 2620/6956/2620 causal constraints (skipped 1044 transitions) in 187 ms.
[2024-05-31 20:43:37] [INFO ] Added : 5 causal constraints over 1 iterations in 551 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 79 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 66 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-31 20:43:42] [INFO ] Invariant cache hit.
[2024-05-31 20:43:43] [INFO ] Implicit Places using invariants in 922 ms returned []
[2024-05-31 20:43:43] [INFO ] Invariant cache hit.
[2024-05-31 20:43:43] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-31 20:44:03] [INFO ] Implicit Places using invariants and state equation in 20590 ms returned []
Implicit Place search using SMT with State Equation took 21513 ms to find 0 implicit places.
[2024-05-31 20:44:03] [INFO ] Redundant transitions in 117 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-31 20:44:03] [INFO ] Invariant cache hit.
[2024-05-31 20:44:03] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32334ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32363ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54076 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (284 resets) in 446 ms. (89 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 194881 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 2
Probabilistic random walk after 194881 steps, saw 33983 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2024-05-31 20:44:39] [INFO ] Invariant cache hit.
[2024-05-31 20:44:39] [INFO ] State equation strengthened by 3604 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:44:39] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 20:44:40] [INFO ] Deduced a trap composed of 43 places in 691 ms of which 7 ms to minimize.
[2024-05-31 20:44:41] [INFO ] Deduced a trap composed of 47 places in 666 ms of which 6 ms to minimize.
[2024-05-31 20:44:41] [INFO ] Deduced a trap composed of 43 places in 668 ms of which 7 ms to minimize.
[2024-05-31 20:44:42] [INFO ] Deduced a trap composed of 42 places in 668 ms of which 7 ms to minimize.
[2024-05-31 20:44:43] [INFO ] Deduced a trap composed of 45 places in 672 ms of which 7 ms to minimize.
[2024-05-31 20:44:43] [INFO ] Deduced a trap composed of 50 places in 636 ms of which 7 ms to minimize.
[2024-05-31 20:44:44] [INFO ] Deduced a trap composed of 41 places in 636 ms of which 6 ms to minimize.
SMT process timed out in 5179ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 66 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (282 resets) in 411 ms. (97 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 205894 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 1
Probabilistic random walk after 205894 steps, saw 35426 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-05-31 20:44:47] [INFO ] Invariant cache hit.
[2024-05-31 20:44:47] [INFO ] State equation strengthened by 3604 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:44:47] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:44:48] [INFO ] Deduced a trap composed of 43 places in 603 ms of which 6 ms to minimize.
[2024-05-31 20:44:49] [INFO ] Deduced a trap composed of 40 places in 628 ms of which 6 ms to minimize.
[2024-05-31 20:44:49] [INFO ] Deduced a trap composed of 70 places in 618 ms of which 6 ms to minimize.
[2024-05-31 20:44:50] [INFO ] Deduced a trap composed of 39 places in 556 ms of which 6 ms to minimize.
[2024-05-31 20:44:51] [INFO ] Deduced a trap composed of 44 places in 537 ms of which 5 ms to minimize.
[2024-05-31 20:44:51] [INFO ] Deduced a trap composed of 35 places in 518 ms of which 5 ms to minimize.
[2024-05-31 20:44:52] [INFO ] Deduced a trap composed of 47 places in 488 ms of which 6 ms to minimize.
[2024-05-31 20:44:52] [INFO ] Deduced a trap composed of 58 places in 511 ms of which 6 ms to minimize.
[2024-05-31 20:44:53] [INFO ] Deduced a trap composed of 35 places in 526 ms of which 5 ms to minimize.
[2024-05-31 20:44:53] [INFO ] Deduced a trap composed of 41 places in 490 ms of which 9 ms to minimize.
[2024-05-31 20:44:54] [INFO ] Deduced a trap composed of 44 places in 430 ms of which 5 ms to minimize.
[2024-05-31 20:44:54] [INFO ] Deduced a trap composed of 48 places in 458 ms of which 5 ms to minimize.
[2024-05-31 20:44:55] [INFO ] Deduced a trap composed of 48 places in 408 ms of which 5 ms to minimize.
[2024-05-31 20:44:55] [INFO ] Deduced a trap composed of 48 places in 458 ms of which 5 ms to minimize.
[2024-05-31 20:44:55] [INFO ] Deduced a trap composed of 48 places in 433 ms of which 5 ms to minimize.
[2024-05-31 20:44:56] [INFO ] Deduced a trap composed of 44 places in 409 ms of which 5 ms to minimize.
[2024-05-31 20:44:56] [INFO ] Deduced a trap composed of 35 places in 418 ms of which 5 ms to minimize.
[2024-05-31 20:44:57] [INFO ] Deduced a trap composed of 47 places in 410 ms of which 5 ms to minimize.
[2024-05-31 20:44:57] [INFO ] Deduced a trap composed of 47 places in 393 ms of which 5 ms to minimize.
[2024-05-31 20:44:58] [INFO ] Deduced a trap composed of 47 places in 386 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:44:58] [INFO ] Deduced a trap composed of 38 places in 395 ms of which 4 ms to minimize.
[2024-05-31 20:44:58] [INFO ] Deduced a trap composed of 37 places in 394 ms of which 5 ms to minimize.
[2024-05-31 20:44:59] [INFO ] Deduced a trap composed of 37 places in 404 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3694/4774 variables, 1080/1136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 3604/4740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4774 variables, 0/4740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4776 variables, 2/4742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4776 variables, 0/4742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4742 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12885 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 24/24 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:45:00] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:45:01] [INFO ] Deduced a trap composed of 44 places in 631 ms of which 6 ms to minimize.
[2024-05-31 20:45:02] [INFO ] Deduced a trap composed of 50 places in 634 ms of which 6 ms to minimize.
[2024-05-31 20:45:02] [INFO ] Deduced a trap composed of 37 places in 601 ms of which 6 ms to minimize.
[2024-05-31 20:45:02] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:45:02] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3694/4774 variables, 1080/1142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4774 variables, 3604/4746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4774 variables, 1/4747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4774 variables, 0/4747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4776 variables, 2/4749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4776 variables, 0/4749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4776 variables, 0/4749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4749 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4126 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 30/30 constraints]
After SMT, in 17050ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 65 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 64 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-31 20:45:04] [INFO ] Invariant cache hit.
[2024-05-31 20:45:05] [INFO ] Implicit Places using invariants in 865 ms returned []
[2024-05-31 20:45:05] [INFO ] Invariant cache hit.
[2024-05-31 20:45:06] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-31 20:45:28] [INFO ] Implicit Places using invariants and state equation in 22432 ms returned []
Implicit Place search using SMT with State Equation took 23300 ms to find 0 implicit places.
[2024-05-31 20:45:28] [INFO ] Redundant transitions in 110 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-31 20:45:28] [INFO ] Invariant cache hit.
[2024-05-31 20:45:28] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32249ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32276ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55767 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3511 edges and 1082 vertex of which 958 / 1082 are part of one of the 2 SCC in 11 ms
Free SCC test removed 956 places
Drop transitions (Empty/Sink Transition effects.) removed 2643 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3565 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.0 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 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 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 42 ms. Remains 4 /1082 variables (removed 1078) and now considering 5/3694 (removed 3689) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-31 20:46:00] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 20:46:00] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:46:00] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:46:00] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:46:00] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 149 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-00 in 160116 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-31 20:46:00] [INFO ] Computed 32 invariants in 55 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (70 resets) in 78 ms. (126 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 20:46:00] [INFO ] Invariant cache hit.
[2024-05-31 20:46:01] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:46:01] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:46:01] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2024-05-31 20:46:01] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-31 20:46:02] [INFO ] [Real]Added 3582 Read/Feed constraints in 237 ms returned sat
[2024-05-31 20:46:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:46:02] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:46:02] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:46:02] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2024-05-31 20:46:03] [INFO ] [Nat]Added 3582 Read/Feed constraints in 266 ms returned sat
[2024-05-31 20:46:03] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 173 ms.
[2024-05-31 20:46:03] [INFO ] Added : 6 causal constraints over 2 iterations in 622 ms. Result :sat
Minimization took 960 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1083 transition count 3695
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 1083 transition count 3694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 1082 transition count 3694
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 1082 transition count 3694
Applied a total of 24 rules in 300 ms. Remains 1082 /1090 variables (removed 8) and now considering 3694/3702 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 1082/1090 places, 3694/3702 transitions.
// Phase 1: matrix 3694 rows 1082 cols
[2024-05-31 20:46:05] [INFO ] Computed 32 invariants in 48 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7140 resets) in 7278 ms. (137 steps per ms)
BEST_FIRST walk for 1000001 steps (205 resets) in 1015 ms. (984 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 20:46:13] [INFO ] Invariant cache hit.
[2024-05-31 20:46:13] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:46:13] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:46:14] [INFO ] [Real]Absence check using state equation in 643 ms returned sat
[2024-05-31 20:46:14] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-31 20:46:14] [INFO ] [Real]Added 3604 Read/Feed constraints in 284 ms returned sat
[2024-05-31 20:46:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:46:14] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-31 20:46:14] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:46:15] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2024-05-31 20:46:15] [INFO ] [Nat]Added 3604 Read/Feed constraints in 270 ms returned sat
[2024-05-31 20:46:15] [INFO ] Computed and/alt/rep : 2620/6956/2620 causal constraints (skipped 1044 transitions) in 167 ms.
[2024-05-31 20:46:16] [INFO ] Added : 7 causal constraints over 2 iterations in 648 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 92 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 72 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-31 20:46:21] [INFO ] Invariant cache hit.
[2024-05-31 20:46:21] [INFO ] Implicit Places using invariants in 904 ms returned []
[2024-05-31 20:46:21] [INFO ] Invariant cache hit.
[2024-05-31 20:46:22] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-31 20:46:44] [INFO ] Implicit Places using invariants and state equation in 22108 ms returned []
Implicit Place search using SMT with State Equation took 23014 ms to find 0 implicit places.
[2024-05-31 20:46:44] [INFO ] Redundant transitions in 110 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-31 20:46:44] [INFO ] Invariant cache hit.
[2024-05-31 20:46:44] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32258ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32290ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55511 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (283 resets) in 420 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 183642 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 183642 steps, saw 32717 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-31 20:47:19] [INFO ] Invariant cache hit.
[2024-05-31 20:47:19] [INFO ] State equation strengthened by 3604 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:47:19] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 20:47:20] [INFO ] Deduced a trap composed of 39 places in 658 ms of which 7 ms to minimize.
[2024-05-31 20:47:21] [INFO ] Deduced a trap composed of 40 places in 622 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 2/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3694/4774 variables, 1080/1115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3604/4719 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 0/4719 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4776 variables, 2/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4721 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3069 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 20:47:23] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 2/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 20:47:23] [INFO ] Deduced a trap composed of 37 places in 659 ms of which 7 ms to minimize.
[2024-05-31 20:47:24] [INFO ] Deduced a trap composed of 49 places in 687 ms of which 7 ms to minimize.
[2024-05-31 20:47:24] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 3/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3694/4774 variables, 1080/1119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4774/4776 variables, and 4723 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3477 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1080/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 6592ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 70 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (285 resets) in 458 ms. (87 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 202246 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 1
Probabilistic random walk after 202246 steps, saw 34981 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-31 20:47:29] [INFO ] Invariant cache hit.
[2024-05-31 20:47:29] [INFO ] State equation strengthened by 3604 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:47:29] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:47:30] [INFO ] Deduced a trap composed of 38 places in 658 ms of which 6 ms to minimize.
[2024-05-31 20:47:30] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3694/4774 variables, 1080/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3604/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 0/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4776 variables, 2/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4721 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2192 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:47:31] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:47:32] [INFO ] Deduced a trap composed of 37 places in 650 ms of which 7 ms to minimize.
[2024-05-31 20:47:33] [INFO ] Deduced a trap composed of 49 places in 664 ms of which 7 ms to minimize.
[2024-05-31 20:47:34] [INFO ] Deduced a trap composed of 49 places in 594 ms of which 6 ms to minimize.
[2024-05-31 20:47:34] [INFO ] Deduced a trap composed of 36 places in 583 ms of which 6 ms to minimize.
[2024-05-31 20:47:35] [INFO ] Deduced a trap composed of 43 places in 571 ms of which 6 ms to minimize.
[2024-05-31 20:47:35] [INFO ] Deduced a trap composed of 36 places in 585 ms of which 6 ms to minimize.
[2024-05-31 20:47:36] [INFO ] Deduced a trap composed of 37 places in 549 ms of which 6 ms to minimize.
[2024-05-31 20:47:37] [INFO ] Deduced a trap composed of 36 places in 589 ms of which 6 ms to minimize.
[2024-05-31 20:47:37] [INFO ] Deduced a trap composed of 35 places in 590 ms of which 7 ms to minimize.
[2024-05-31 20:47:38] [INFO ] Deduced a trap composed of 38 places in 599 ms of which 6 ms to minimize.
[2024-05-31 20:47:38] [INFO ] Deduced a trap composed of 36 places in 580 ms of which 6 ms to minimize.
[2024-05-31 20:47:39] [INFO ] Deduced a trap composed of 36 places in 535 ms of which 6 ms to minimize.
[2024-05-31 20:47:40] [INFO ] Deduced a trap composed of 36 places in 596 ms of which 6 ms to minimize.
[2024-05-31 20:47:40] [INFO ] Deduced a trap composed of 36 places in 580 ms of which 6 ms to minimize.
[2024-05-31 20:47:41] [INFO ] Deduced a trap composed of 35 places in 567 ms of which 6 ms to minimize.
[2024-05-31 20:47:41] [INFO ] Deduced a trap composed of 40 places in 549 ms of which 6 ms to minimize.
[2024-05-31 20:47:42] [INFO ] Deduced a trap composed of 41 places in 553 ms of which 6 ms to minimize.
[2024-05-31 20:47:42] [INFO ] Deduced a trap composed of 43 places in 550 ms of which 6 ms to minimize.
[2024-05-31 20:47:43] [INFO ] Deduced a trap composed of 48 places in 527 ms of which 6 ms to minimize.
[2024-05-31 20:47:43] [INFO ] Deduced a trap composed of 38 places in 441 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:47:44] [INFO ] Deduced a trap composed of 46 places in 455 ms of which 6 ms to minimize.
[2024-05-31 20:47:44] [INFO ] Deduced a trap composed of 38 places in 438 ms of which 5 ms to minimize.
[2024-05-31 20:47:45] [INFO ] Deduced a trap composed of 43 places in 470 ms of which 5 ms to minimize.
[2024-05-31 20:47:45] [INFO ] Deduced a trap composed of 41 places in 415 ms of which 5 ms to minimize.
[2024-05-31 20:47:46] [INFO ] Deduced a trap composed of 44 places in 448 ms of which 5 ms to minimize.
[2024-05-31 20:47:46] [INFO ] Deduced a trap composed of 36 places in 386 ms of which 5 ms to minimize.
[2024-05-31 20:47:47] [INFO ] Deduced a trap composed of 39 places in 377 ms of which 4 ms to minimize.
[2024-05-31 20:47:47] [INFO ] Deduced a trap composed of 37 places in 398 ms of which 5 ms to minimize.
[2024-05-31 20:47:47] [INFO ] Deduced a trap composed of 37 places in 391 ms of which 5 ms to minimize.
[2024-05-31 20:47:48] [INFO ] Deduced a trap composed of 43 places in 363 ms of which 5 ms to minimize.
[2024-05-31 20:47:48] [INFO ] Deduced a trap composed of 43 places in 375 ms of which 5 ms to minimize.
[2024-05-31 20:47:49] [INFO ] Deduced a trap composed of 42 places in 382 ms of which 5 ms to minimize.
[2024-05-31 20:47:49] [INFO ] Deduced a trap composed of 44 places in 395 ms of which 5 ms to minimize.
[2024-05-31 20:47:49] [INFO ] Deduced a trap composed of 45 places in 389 ms of which 5 ms to minimize.
[2024-05-31 20:47:50] [INFO ] Deduced a trap composed of 39 places in 426 ms of which 5 ms to minimize.
[2024-05-31 20:47:50] [INFO ] Deduced a trap composed of 38 places in 407 ms of which 5 ms to minimize.
[2024-05-31 20:47:51] [INFO ] Deduced a trap composed of 38 places in 410 ms of which 4 ms to minimize.
[2024-05-31 20:47:51] [INFO ] Deduced a trap composed of 41 places in 420 ms of which 5 ms to minimize.
[2024-05-31 20:47:52] [INFO ] Deduced a trap composed of 40 places in 453 ms of which 5 ms to minimize.
[2024-05-31 20:47:52] [INFO ] Deduced a trap composed of 51 places in 465 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:47:53] [INFO ] Deduced a trap composed of 49 places in 426 ms of which 5 ms to minimize.
[2024-05-31 20:47:53] [INFO ] Deduced a trap composed of 49 places in 383 ms of which 4 ms to minimize.
[2024-05-31 20:47:53] [INFO ] Deduced a trap composed of 37 places in 427 ms of which 5 ms to minimize.
[2024-05-31 20:47:54] [INFO ] Deduced a trap composed of 41 places in 361 ms of which 5 ms to minimize.
[2024-05-31 20:47:54] [INFO ] Deduced a trap composed of 41 places in 329 ms of which 4 ms to minimize.
[2024-05-31 20:47:54] [INFO ] Deduced a trap composed of 40 places in 291 ms of which 3 ms to minimize.
[2024-05-31 20:47:55] [INFO ] Deduced a trap composed of 43 places in 308 ms of which 3 ms to minimize.
[2024-05-31 20:47:55] [INFO ] Deduced a trap composed of 39 places in 344 ms of which 4 ms to minimize.
[2024-05-31 20:47:55] [INFO ] Deduced a trap composed of 41 places in 352 ms of which 4 ms to minimize.
[2024-05-31 20:47:56] [INFO ] Deduced a trap composed of 42 places in 300 ms of which 4 ms to minimize.
[2024-05-31 20:47:56] [INFO ] Deduced a trap composed of 42 places in 297 ms of which 4 ms to minimize.
[2024-05-31 20:47:56] [INFO ] Deduced a trap composed of 37 places in 277 ms of which 4 ms to minimize.
[2024-05-31 20:47:57] [INFO ] Deduced a trap composed of 46 places in 282 ms of which 4 ms to minimize.
[2024-05-31 20:47:57] [INFO ] Deduced a trap composed of 39 places in 306 ms of which 4 ms to minimize.
[2024-05-31 20:47:57] [INFO ] Deduced a trap composed of 39 places in 314 ms of which 5 ms to minimize.
[2024-05-31 20:47:58] [INFO ] Deduced a trap composed of 35 places in 280 ms of which 5 ms to minimize.
[2024-05-31 20:47:58] [INFO ] Deduced a trap composed of 36 places in 266 ms of which 3 ms to minimize.
[2024-05-31 20:47:58] [INFO ] Deduced a trap composed of 39 places in 274 ms of which 3 ms to minimize.
[2024-05-31 20:47:59] [INFO ] Deduced a trap composed of 37 places in 252 ms of which 4 ms to minimize.
[2024-05-31 20:47:59] [INFO ] Deduced a trap composed of 36 places in 278 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:47:59] [INFO ] Deduced a trap composed of 40 places in 255 ms of which 3 ms to minimize.
[2024-05-31 20:47:59] [INFO ] Deduced a trap composed of 38 places in 245 ms of which 3 ms to minimize.
[2024-05-31 20:48:00] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 3 ms to minimize.
[2024-05-31 20:48:00] [INFO ] Deduced a trap composed of 52 places in 232 ms of which 4 ms to minimize.
[2024-05-31 20:48:00] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 3 ms to minimize.
[2024-05-31 20:48:00] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 3 ms to minimize.
[2024-05-31 20:48:00] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 3 ms to minimize.
[2024-05-31 20:48:01] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 3 ms to minimize.
[2024-05-31 20:48:01] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 2 ms to minimize.
[2024-05-31 20:48:01] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 3 ms to minimize.
[2024-05-31 20:48:01] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 2 ms to minimize.
[2024-05-31 20:48:01] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 3 ms to minimize.
[2024-05-31 20:48:02] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 3 ms to minimize.
[2024-05-31 20:48:02] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 2 ms to minimize.
[2024-05-31 20:48:02] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 3 ms to minimize.
[2024-05-31 20:48:02] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 2 ms to minimize.
[2024-05-31 20:48:02] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 3 ms to minimize.
[2024-05-31 20:48:02] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 3 ms to minimize.
[2024-05-31 20:48:03] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 3 ms to minimize.
[2024-05-31 20:48:03] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:48:03] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 2 ms to minimize.
[2024-05-31 20:48:03] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 3 ms to minimize.
[2024-05-31 20:48:03] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 2 ms to minimize.
[2024-05-31 20:48:04] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 4 ms to minimize.
[2024-05-31 20:48:04] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 3 ms to minimize.
[2024-05-31 20:48:04] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 2 ms to minimize.
[2024-05-31 20:48:04] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 1 ms to minimize.
[2024-05-31 20:48:04] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 2 ms to minimize.
[2024-05-31 20:48:04] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 2 ms to minimize.
[2024-05-31 20:48:05] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 3 ms to minimize.
[2024-05-31 20:48:05] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 2 ms to minimize.
[2024-05-31 20:48:05] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 3 ms to minimize.
[2024-05-31 20:48:05] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 2 ms to minimize.
[2024-05-31 20:48:05] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 2 ms to minimize.
[2024-05-31 20:48:05] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 2 ms to minimize.
[2024-05-31 20:48:06] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 2 ms to minimize.
[2024-05-31 20:48:06] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-31 20:48:06] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 2 ms to minimize.
[2024-05-31 20:48:06] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 2 ms to minimize.
[2024-05-31 20:48:06] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1080 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:48:07] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 3 ms to minimize.
[2024-05-31 20:48:07] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 3 ms to minimize.
[2024-05-31 20:48:07] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 3 ms to minimize.
[2024-05-31 20:48:07] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 3 ms to minimize.
[2024-05-31 20:48:07] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 2 ms to minimize.
[2024-05-31 20:48:07] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 2 ms to minimize.
[2024-05-31 20:48:07] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1080 variables, 9/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1080 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3694/4774 variables, 1080/1225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4774 variables, 3604/4829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4774 variables, 1/4830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4774 variables, 0/4830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/4776 variables, 2/4832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4776 variables, 0/4832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/4776 variables, 0/4832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4832 constraints, problems are : Problem set: 0 solved, 1 unsolved in 39413 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 113/113 constraints]
After SMT, in 41642ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 71 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 67 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-31 20:48:11] [INFO ] Invariant cache hit.
[2024-05-31 20:48:12] [INFO ] Implicit Places using invariants in 916 ms returned []
[2024-05-31 20:48:12] [INFO ] Invariant cache hit.
[2024-05-31 20:48:13] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-31 20:48:35] [INFO ] Implicit Places using invariants and state equation in 22917 ms returned []
Implicit Place search using SMT with State Equation took 23833 ms to find 0 implicit places.
[2024-05-31 20:48:35] [INFO ] Redundant transitions in 110 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-31 20:48:35] [INFO ] Invariant cache hit.
[2024-05-31 20:48:35] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32332ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32361ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56386 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-01 in 186891 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-31 20:49:07] [INFO ] Computed 32 invariants in 53 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (73 resets) in 88 ms. (112 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 20:49:07] [INFO ] Invariant cache hit.
[2024-05-31 20:49:07] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:49:07] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:49:08] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2024-05-31 20:49:08] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-31 20:49:08] [INFO ] [Real]Added 3582 Read/Feed constraints in 250 ms returned sat
[2024-05-31 20:49:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:49:09] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:49:09] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:49:09] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2024-05-31 20:49:10] [INFO ] [Nat]Added 3582 Read/Feed constraints in 266 ms returned sat
[2024-05-31 20:49:10] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 167 ms.
[2024-05-31 20:49:10] [INFO ] Added : 6 causal constraints over 2 iterations in 635 ms. Result :sat
Minimization took 944 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1083 transition count 3695
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 1083 transition count 3694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 1082 transition count 3694
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 1082 transition count 3694
Applied a total of 24 rules in 259 ms. Remains 1082 /1090 variables (removed 8) and now considering 3694/3702 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 1082/1090 places, 3694/3702 transitions.
// Phase 1: matrix 3694 rows 1082 cols
[2024-05-31 20:49:11] [INFO ] Computed 32 invariants in 45 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7159 resets) in 7878 ms. (126 steps per ms)
BEST_FIRST walk for 1000001 steps (203 resets) in 994 ms. (1005 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 20:49:20] [INFO ] Invariant cache hit.
[2024-05-31 20:49:20] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:49:20] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:49:21] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2024-05-31 20:49:21] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-31 20:49:21] [INFO ] [Real]Added 3604 Read/Feed constraints in 250 ms returned sat
[2024-05-31 20:49:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:49:22] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:49:22] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:49:22] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2024-05-31 20:49:22] [INFO ] [Nat]Added 3604 Read/Feed constraints in 267 ms returned sat
[2024-05-31 20:49:23] [INFO ] Computed and/alt/rep : 2620/6956/2620 causal constraints (skipped 1044 transitions) in 175 ms.
[2024-05-31 20:49:23] [INFO ] Added : 5 causal constraints over 1 iterations in 532 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 76 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 69 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-31 20:49:28] [INFO ] Invariant cache hit.
[2024-05-31 20:49:29] [INFO ] Implicit Places using invariants in 878 ms returned []
[2024-05-31 20:49:29] [INFO ] Invariant cache hit.
[2024-05-31 20:49:29] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-31 20:49:48] [INFO ] Implicit Places using invariants and state equation in 19716 ms returned []
Implicit Place search using SMT with State Equation took 20594 ms to find 0 implicit places.
[2024-05-31 20:49:48] [INFO ] Redundant transitions in 116 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-31 20:49:49] [INFO ] Invariant cache hit.
[2024-05-31 20:49:49] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.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 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32192ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32221ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53026 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (285 resets) in 419 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 190204 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 2
Probabilistic random walk after 190204 steps, saw 33362 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-31 20:50:24] [INFO ] Invariant cache hit.
[2024-05-31 20:50:24] [INFO ] State equation strengthened by 3604 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:50:24] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 20:50:25] [INFO ] Deduced a trap composed of 47 places in 621 ms of which 6 ms to minimize.
[2024-05-31 20:50:25] [INFO ] Deduced a trap composed of 43 places in 593 ms of which 6 ms to minimize.
[2024-05-31 20:50:26] [INFO ] Deduced a trap composed of 43 places in 602 ms of which 6 ms to minimize.
[2024-05-31 20:50:27] [INFO ] Deduced a trap composed of 43 places in 612 ms of which 6 ms to minimize.
[2024-05-31 20:50:27] [INFO ] Deduced a trap composed of 46 places in 580 ms of which 7 ms to minimize.
[2024-05-31 20:50:28] [INFO ] Deduced a trap composed of 41 places in 554 ms of which 6 ms to minimize.
[2024-05-31 20:50:28] [INFO ] Deduced a trap composed of 45 places in 513 ms of which 5 ms to minimize.
[2024-05-31 20:50:29] [INFO ] Deduced a trap composed of 47 places in 520 ms of which 6 ms to minimize.
SMT process timed out in 5064ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 69 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (284 resets) in 472 ms. (84 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 205029 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 1
Probabilistic random walk after 205029 steps, saw 35318 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-05-31 20:50:32] [INFO ] Invariant cache hit.
[2024-05-31 20:50:32] [INFO ] State equation strengthened by 3604 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:50:32] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:50:33] [INFO ] Deduced a trap composed of 38 places in 630 ms of which 6 ms to minimize.
[2024-05-31 20:50:33] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3694/4774 variables, 1080/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3604/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 0/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4776 variables, 2/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4721 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2351 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:50:35] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:50:35] [INFO ] Deduced a trap composed of 36 places in 628 ms of which 6 ms to minimize.
[2024-05-31 20:50:36] [INFO ] Deduced a trap composed of 72 places in 603 ms of which 6 ms to minimize.
[2024-05-31 20:50:37] [INFO ] Deduced a trap composed of 38 places in 565 ms of which 6 ms to minimize.
[2024-05-31 20:50:37] [INFO ] Deduced a trap composed of 38 places in 532 ms of which 5 ms to minimize.
[2024-05-31 20:50:38] [INFO ] Deduced a trap composed of 38 places in 483 ms of which 5 ms to minimize.
[2024-05-31 20:50:38] [INFO ] Deduced a trap composed of 38 places in 489 ms of which 5 ms to minimize.
[2024-05-31 20:50:39] [INFO ] Deduced a trap composed of 39 places in 501 ms of which 6 ms to minimize.
[2024-05-31 20:50:39] [INFO ] Deduced a trap composed of 36 places in 485 ms of which 6 ms to minimize.
[2024-05-31 20:50:40] [INFO ] Deduced a trap composed of 37 places in 499 ms of which 5 ms to minimize.
[2024-05-31 20:50:40] [INFO ] Deduced a trap composed of 39 places in 481 ms of which 5 ms to minimize.
[2024-05-31 20:50:41] [INFO ] Deduced a trap composed of 44 places in 514 ms of which 5 ms to minimize.
[2024-05-31 20:50:41] [INFO ] Deduced a trap composed of 48 places in 490 ms of which 5 ms to minimize.
[2024-05-31 20:50:42] [INFO ] Deduced a trap composed of 47 places in 480 ms of which 5 ms to minimize.
[2024-05-31 20:50:42] [INFO ] Deduced a trap composed of 41 places in 487 ms of which 6 ms to minimize.
[2024-05-31 20:50:43] [INFO ] Deduced a trap composed of 41 places in 452 ms of which 5 ms to minimize.
[2024-05-31 20:50:43] [INFO ] Deduced a trap composed of 54 places in 469 ms of which 5 ms to minimize.
[2024-05-31 20:50:44] [INFO ] Deduced a trap composed of 41 places in 472 ms of which 5 ms to minimize.
[2024-05-31 20:50:44] [INFO ] Deduced a trap composed of 49 places in 491 ms of which 5 ms to minimize.
[2024-05-31 20:50:45] [INFO ] Deduced a trap composed of 42 places in 456 ms of which 5 ms to minimize.
[2024-05-31 20:50:45] [INFO ] Deduced a trap composed of 38 places in 433 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:50:46] [INFO ] Deduced a trap composed of 41 places in 398 ms of which 5 ms to minimize.
[2024-05-31 20:50:46] [INFO ] Deduced a trap composed of 45 places in 438 ms of which 5 ms to minimize.
[2024-05-31 20:50:46] [INFO ] Deduced a trap composed of 39 places in 409 ms of which 6 ms to minimize.
[2024-05-31 20:50:47] [INFO ] Deduced a trap composed of 37 places in 356 ms of which 4 ms to minimize.
[2024-05-31 20:50:47] [INFO ] Deduced a trap composed of 42 places in 336 ms of which 4 ms to minimize.
[2024-05-31 20:50:48] [INFO ] Deduced a trap composed of 38 places in 342 ms of which 5 ms to minimize.
[2024-05-31 20:50:48] [INFO ] Deduced a trap composed of 38 places in 319 ms of which 4 ms to minimize.
[2024-05-31 20:50:48] [INFO ] Deduced a trap composed of 37 places in 314 ms of which 4 ms to minimize.
[2024-05-31 20:50:49] [INFO ] Deduced a trap composed of 37 places in 327 ms of which 5 ms to minimize.
[2024-05-31 20:50:49] [INFO ] Deduced a trap composed of 36 places in 331 ms of which 4 ms to minimize.
[2024-05-31 20:50:49] [INFO ] Deduced a trap composed of 37 places in 328 ms of which 4 ms to minimize.
[2024-05-31 20:50:50] [INFO ] Deduced a trap composed of 35 places in 323 ms of which 4 ms to minimize.
[2024-05-31 20:50:50] [INFO ] Deduced a trap composed of 37 places in 324 ms of which 4 ms to minimize.
[2024-05-31 20:50:50] [INFO ] Deduced a trap composed of 37 places in 364 ms of which 6 ms to minimize.
[2024-05-31 20:50:51] [INFO ] Deduced a trap composed of 36 places in 327 ms of which 4 ms to minimize.
[2024-05-31 20:50:51] [INFO ] Deduced a trap composed of 37 places in 318 ms of which 4 ms to minimize.
[2024-05-31 20:50:51] [INFO ] Deduced a trap composed of 36 places in 323 ms of which 5 ms to minimize.
[2024-05-31 20:50:52] [INFO ] Deduced a trap composed of 34 places in 298 ms of which 4 ms to minimize.
[2024-05-31 20:50:52] [INFO ] Deduced a trap composed of 39 places in 317 ms of which 4 ms to minimize.
[2024-05-31 20:50:52] [INFO ] Deduced a trap composed of 38 places in 303 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:50:53] [INFO ] Deduced a trap composed of 37 places in 306 ms of which 4 ms to minimize.
[2024-05-31 20:50:53] [INFO ] Deduced a trap composed of 36 places in 298 ms of which 4 ms to minimize.
[2024-05-31 20:50:53] [INFO ] Deduced a trap composed of 37 places in 301 ms of which 4 ms to minimize.
[2024-05-31 20:50:54] [INFO ] Deduced a trap composed of 36 places in 305 ms of which 4 ms to minimize.
[2024-05-31 20:50:54] [INFO ] Deduced a trap composed of 39 places in 323 ms of which 4 ms to minimize.
[2024-05-31 20:50:54] [INFO ] Deduced a trap composed of 39 places in 312 ms of which 4 ms to minimize.
[2024-05-31 20:50:55] [INFO ] Deduced a trap composed of 42 places in 347 ms of which 6 ms to minimize.
[2024-05-31 20:50:55] [INFO ] Deduced a trap composed of 40 places in 333 ms of which 4 ms to minimize.
[2024-05-31 20:50:55] [INFO ] Deduced a trap composed of 45 places in 294 ms of which 4 ms to minimize.
[2024-05-31 20:50:56] [INFO ] Deduced a trap composed of 41 places in 303 ms of which 4 ms to minimize.
[2024-05-31 20:50:56] [INFO ] Deduced a trap composed of 40 places in 296 ms of which 4 ms to minimize.
[2024-05-31 20:50:56] [INFO ] Deduced a trap composed of 44 places in 298 ms of which 4 ms to minimize.
[2024-05-31 20:50:57] [INFO ] Deduced a trap composed of 39 places in 296 ms of which 4 ms to minimize.
[2024-05-31 20:50:57] [INFO ] Deduced a trap composed of 40 places in 307 ms of which 4 ms to minimize.
[2024-05-31 20:50:57] [INFO ] Deduced a trap composed of 43 places in 295 ms of which 4 ms to minimize.
[2024-05-31 20:50:58] [INFO ] Deduced a trap composed of 43 places in 299 ms of which 4 ms to minimize.
[2024-05-31 20:50:58] [INFO ] Deduced a trap composed of 40 places in 290 ms of which 4 ms to minimize.
[2024-05-31 20:50:58] [INFO ] Deduced a trap composed of 35 places in 273 ms of which 4 ms to minimize.
[2024-05-31 20:50:58] [INFO ] Deduced a trap composed of 40 places in 264 ms of which 4 ms to minimize.
[2024-05-31 20:50:59] [INFO ] Deduced a trap composed of 39 places in 241 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:50:59] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 3 ms to minimize.
[2024-05-31 20:50:59] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 3 ms to minimize.
[2024-05-31 20:50:59] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 3 ms to minimize.
[2024-05-31 20:51:00] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 3 ms to minimize.
[2024-05-31 20:51:00] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 3 ms to minimize.
[2024-05-31 20:51:00] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 3 ms to minimize.
[2024-05-31 20:51:00] [INFO ] Deduced a trap composed of 35 places in 216 ms of which 4 ms to minimize.
[2024-05-31 20:51:01] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 2 ms to minimize.
[2024-05-31 20:51:01] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 3 ms to minimize.
[2024-05-31 20:51:01] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 3 ms to minimize.
[2024-05-31 20:51:01] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 3 ms to minimize.
[2024-05-31 20:51:01] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 3 ms to minimize.
[2024-05-31 20:51:02] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 3 ms to minimize.
[2024-05-31 20:51:02] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 3 ms to minimize.
[2024-05-31 20:51:02] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 2 ms to minimize.
[2024-05-31 20:51:02] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 3 ms to minimize.
[2024-05-31 20:51:02] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 3 ms to minimize.
[2024-05-31 20:51:03] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 2 ms to minimize.
[2024-05-31 20:51:03] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 2 ms to minimize.
[2024-05-31 20:51:03] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:51:03] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 2 ms to minimize.
[2024-05-31 20:51:03] [INFO ] Deduced a trap composed of 56 places in 154 ms of which 3 ms to minimize.
[2024-05-31 20:51:03] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 2 ms to minimize.
[2024-05-31 20:51:04] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 3 ms to minimize.
[2024-05-31 20:51:04] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 3 ms to minimize.
[2024-05-31 20:51:04] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-05-31 20:51:04] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 2 ms to minimize.
[2024-05-31 20:51:04] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 2 ms to minimize.
[2024-05-31 20:51:04] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2024-05-31 20:51:04] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-05-31 20:51:05] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2024-05-31 20:51:05] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 1 ms to minimize.
[2024-05-31 20:51:05] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 2 ms to minimize.
[2024-05-31 20:51:05] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-05-31 20:51:05] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-31 20:51:05] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 3 ms to minimize.
[2024-05-31 20:51:05] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 2 ms to minimize.
[2024-05-31 20:51:06] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
[2024-05-31 20:51:06] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-05-31 20:51:06] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1080 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:51:06] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-05-31 20:51:06] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-31 20:51:06] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1080 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1080 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3694/4774 variables, 1080/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4774 variables, 3604/4823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4774 variables, 1/4824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4774 variables, 0/4824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/4776 variables, 2/4826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4776 variables, 0/4826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/4776 variables, 0/4826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4826 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36209 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 107/107 constraints]
After SMT, in 38595ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 175 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 65 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 64 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-31 20:51:11] [INFO ] Invariant cache hit.
[2024-05-31 20:51:12] [INFO ] Implicit Places using invariants in 899 ms returned []
[2024-05-31 20:51:12] [INFO ] Invariant cache hit.
[2024-05-31 20:51:13] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-31 20:51:32] [INFO ] Implicit Places using invariants and state equation in 20398 ms returned []
Implicit Place search using SMT with State Equation took 21298 ms to find 0 implicit places.
[2024-05-31 20:51:33] [INFO ] Redundant transitions in 111 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-31 20:51:33] [INFO ] Invariant cache hit.
[2024-05-31 20:51:33] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32177ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32207ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53697 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-02 in 177528 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-03
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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-31 20:52:05] [INFO ] Computed 32 invariants in 55 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (70 resets) in 76 ms. (129 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 20:52:05] [INFO ] Invariant cache hit.
[2024-05-31 20:52:05] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:52:05] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:52:06] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2024-05-31 20:52:06] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-31 20:52:06] [INFO ] [Real]Added 3582 Read/Feed constraints in 245 ms returned sat
[2024-05-31 20:52:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:52:06] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:52:06] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:52:07] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2024-05-31 20:52:07] [INFO ] [Nat]Added 3582 Read/Feed constraints in 301 ms returned sat
[2024-05-31 20:52:07] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 167 ms.
[2024-05-31 20:52:08] [INFO ] Added : 8 causal constraints over 2 iterations in 635 ms. Result :sat
Minimization took 945 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1084 transition count 3696
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1084 transition count 3695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1083 transition count 3695
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 1083 transition count 3695
Applied a total of 23 rules in 263 ms. Remains 1083 /1090 variables (removed 7) and now considering 3695/3702 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-31 20:52:09] [INFO ] Computed 32 invariants in 44 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7140 resets) in 7271 ms. (137 steps per ms)
BEST_FIRST walk for 1000001 steps (203 resets) in 1006 ms. (993 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 20:52:17] [INFO ] Invariant cache hit.
[2024-05-31 20:52:17] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-31 20:52:17] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:52:18] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2024-05-31 20:52:18] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 20:52:18] [INFO ] [Real]Added 3603 Read/Feed constraints in 260 ms returned sat
[2024-05-31 20:52:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:52:19] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:52:19] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:52:19] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2024-05-31 20:52:19] [INFO ] [Nat]Added 3603 Read/Feed constraints in 327 ms returned sat
[2024-05-31 20:52:20] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 175 ms.
[2024-05-31 20:52:20] [INFO ] Added : 10 causal constraints over 2 iterations in 656 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 74 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 66 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-31 20:52:25] [INFO ] Invariant cache hit.
[2024-05-31 20:52:26] [INFO ] Implicit Places using invariants in 869 ms returned []
[2024-05-31 20:52:26] [INFO ] Invariant cache hit.
[2024-05-31 20:52:26] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 20:52:45] [INFO ] Implicit Places using invariants and state equation in 19605 ms returned []
Implicit Place search using SMT with State Equation took 20475 ms to find 0 implicit places.
[2024-05-31 20:52:45] [INFO ] Redundant transitions in 117 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-31 20:52:46] [INFO ] Invariant cache hit.
[2024-05-31 20:52:46] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32191ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32221ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52903 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (282 resets) in 421 ms. (94 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 193926 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 2
Probabilistic random walk after 193926 steps, saw 33844 distinct states, run finished after 3003 ms. (steps per millisecond=64 ) properties seen :0
[2024-05-31 20:53:21] [INFO ] Invariant cache hit.
[2024-05-31 20:53:21] [INFO ] State equation strengthened by 3603 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:53:21] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 20:53:22] [INFO ] Deduced a trap composed of 52 places in 646 ms of which 6 ms to minimize.
[2024-05-31 20:53:23] [INFO ] Deduced a trap composed of 37 places in 604 ms of which 6 ms to minimize.
[2024-05-31 20:53:23] [INFO ] Deduced a trap composed of 40 places in 599 ms of which 6 ms to minimize.
[2024-05-31 20:53:24] [INFO ] Deduced a trap composed of 42 places in 587 ms of which 6 ms to minimize.
[2024-05-31 20:53:24] [INFO ] Deduced a trap composed of 42 places in 546 ms of which 6 ms to minimize.
[2024-05-31 20:53:25] [INFO ] Deduced a trap composed of 39 places in 550 ms of which 6 ms to minimize.
[2024-05-31 20:53:26] [INFO ] Deduced a trap composed of 37 places in 553 ms of which 6 ms to minimize.
[2024-05-31 20:53:26] [INFO ] Deduced a trap composed of 47 places in 543 ms of which 5 ms to minimize.
SMT process timed out in 5201ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 71 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (283 resets) in 329 ms. (121 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 207099 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 1
Probabilistic random walk after 207099 steps, saw 35553 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
[2024-05-31 20:53:29] [INFO ] Invariant cache hit.
[2024-05-31 20:53:29] [INFO ] State equation strengthened by 3603 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:53:29] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:53:30] [INFO ] Deduced a trap composed of 38 places in 580 ms of which 6 ms to minimize.
[2024-05-31 20:53:31] [INFO ] Deduced a trap composed of 39 places in 559 ms of which 6 ms to minimize.
[2024-05-31 20:53:31] [INFO ] Deduced a trap composed of 38 places in 628 ms of which 7 ms to minimize.
[2024-05-31 20:53:32] [INFO ] Deduced a trap composed of 36 places in 612 ms of which 6 ms to minimize.
[2024-05-31 20:53:33] [INFO ] Deduced a trap composed of 47 places in 601 ms of which 6 ms to minimize.
[2024-05-31 20:53:33] [INFO ] Deduced a trap composed of 44 places in 562 ms of which 6 ms to minimize.
[2024-05-31 20:53:34] [INFO ] Deduced a trap composed of 40 places in 569 ms of which 6 ms to minimize.
[2024-05-31 20:53:34] [INFO ] Deduced a trap composed of 39 places in 600 ms of which 6 ms to minimize.
[2024-05-31 20:53:35] [INFO ] Deduced a trap composed of 41 places in 576 ms of which 6 ms to minimize.
[2024-05-31 20:53:36] [INFO ] Deduced a trap composed of 43 places in 573 ms of which 6 ms to minimize.
[2024-05-31 20:53:36] [INFO ] Deduced a trap composed of 39 places in 537 ms of which 6 ms to minimize.
[2024-05-31 20:53:37] [INFO ] Deduced a trap composed of 43 places in 504 ms of which 5 ms to minimize.
[2024-05-31 20:53:37] [INFO ] Deduced a trap composed of 43 places in 496 ms of which 5 ms to minimize.
[2024-05-31 20:53:38] [INFO ] Deduced a trap composed of 41 places in 484 ms of which 5 ms to minimize.
[2024-05-31 20:53:38] [INFO ] Deduced a trap composed of 42 places in 505 ms of which 5 ms to minimize.
[2024-05-31 20:53:39] [INFO ] Deduced a trap composed of 40 places in 501 ms of which 5 ms to minimize.
[2024-05-31 20:53:39] [INFO ] Deduced a trap composed of 35 places in 438 ms of which 5 ms to minimize.
[2024-05-31 20:53:40] [INFO ] Deduced a trap composed of 37 places in 420 ms of which 5 ms to minimize.
[2024-05-31 20:53:40] [INFO ] Deduced a trap composed of 36 places in 436 ms of which 5 ms to minimize.
[2024-05-31 20:53:41] [INFO ] Deduced a trap composed of 35 places in 395 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:53:41] [INFO ] Deduced a trap composed of 46 places in 404 ms of which 5 ms to minimize.
[2024-05-31 20:53:41] [INFO ] Deduced a trap composed of 35 places in 328 ms of which 4 ms to minimize.
[2024-05-31 20:53:42] [INFO ] Deduced a trap composed of 35 places in 316 ms of which 4 ms to minimize.
[2024-05-31 20:53:42] [INFO ] Deduced a trap composed of 41 places in 288 ms of which 4 ms to minimize.
[2024-05-31 20:53:42] [INFO ] Deduced a trap composed of 40 places in 298 ms of which 3 ms to minimize.
[2024-05-31 20:53:43] [INFO ] Deduced a trap composed of 44 places in 298 ms of which 4 ms to minimize.
[2024-05-31 20:53:43] [INFO ] Deduced a trap composed of 45 places in 286 ms of which 4 ms to minimize.
[2024-05-31 20:53:43] [INFO ] Deduced a trap composed of 42 places in 288 ms of which 4 ms to minimize.
[2024-05-31 20:53:44] [INFO ] Deduced a trap composed of 43 places in 298 ms of which 4 ms to minimize.
[2024-05-31 20:53:44] [INFO ] Deduced a trap composed of 43 places in 294 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3695/4776 variables, 1081/1144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 3603/4747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 0/4747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4778 variables, 2/4749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4778 variables, 0/4749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4778 variables, 0/4749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4749 constraints, problems are : Problem set: 0 solved, 1 unsolved in 15874 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 31/31 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:53:45] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 30/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:53:46] [INFO ] Deduced a trap composed of 48 places in 632 ms of which 7 ms to minimize.
[2024-05-31 20:53:46] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2024-05-31 20:53:47] [INFO ] Deduced a trap composed of 41 places in 563 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3695/4776 variables, 1081/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 3603/4751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 1/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4778 variables, 2/4754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4778 variables, 0/4754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4778 variables, 0/4754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4778/4778 variables, and 4754 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3477 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 35/35 constraints]
After SMT, in 19387ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 66 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 64 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-31 20:53:49] [INFO ] Invariant cache hit.
[2024-05-31 20:53:50] [INFO ] Implicit Places using invariants in 859 ms returned []
[2024-05-31 20:53:50] [INFO ] Invariant cache hit.
[2024-05-31 20:53:50] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 20:54:09] [INFO ] Implicit Places using invariants and state equation in 19209 ms returned []
Implicit Place search using SMT with State Equation took 20073 ms to find 0 implicit places.
[2024-05-31 20:54:09] [INFO ] Redundant transitions in 112 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-31 20:54:09] [INFO ] Invariant cache hit.
[2024-05-31 20:54:09] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32254ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32293ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52559 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3512 edges and 1083 vertex of which 959 / 1083 are part of one of the 2 SCC in 1 ms
Free SCC test removed 957 places
Drop transitions (Empty/Sink Transition effects.) removed 2644 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3566 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.0 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 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 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 11 ms. Remains 4 /1083 variables (removed 1079) and now considering 5/3695 (removed 3690) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-31 20:54:41] [INFO ] Computed 0 invariants in 5 ms
[2024-05-31 20:54:41] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:54:41] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:54:41] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:54:41] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 66 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-03 in 156681 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-31 20:54:41] [INFO ] Computed 32 invariants in 56 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (70 resets) in 77 ms. (128 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 20:54:42] [INFO ] Invariant cache hit.
[2024-05-31 20:54:42] [INFO ] [Real]Absence check using 30 positive place invariants in 18 ms returned sat
[2024-05-31 20:54:42] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:54:42] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2024-05-31 20:54:42] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-31 20:54:43] [INFO ] [Real]Added 3582 Read/Feed constraints in 282 ms returned sat
[2024-05-31 20:54:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:54:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:54:43] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-31 20:54:44] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2024-05-31 20:54:44] [INFO ] [Nat]Added 3582 Read/Feed constraints in 318 ms returned sat
[2024-05-31 20:54:44] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 171 ms.
[2024-05-31 20:54:45] [INFO ] Added : 13 causal constraints over 3 iterations in 759 ms. Result :sat
Minimization took 948 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1084 transition count 3696
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1084 transition count 3695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1083 transition count 3695
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 1083 transition count 3695
Applied a total of 23 rules in 249 ms. Remains 1083 /1090 variables (removed 7) and now considering 3695/3702 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-31 20:54:46] [INFO ] Computed 32 invariants in 47 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7148 resets) in 7097 ms. (140 steps per ms)
BEST_FIRST walk for 1000001 steps (205 resets) in 990 ms. (1009 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 20:54:54] [INFO ] Invariant cache hit.
[2024-05-31 20:54:54] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-31 20:54:54] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:54:55] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2024-05-31 20:54:55] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 20:54:55] [INFO ] [Real]Added 3603 Read/Feed constraints in 256 ms returned sat
[2024-05-31 20:54:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:54:55] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-31 20:54:55] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:54:56] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2024-05-31 20:54:56] [INFO ] [Nat]Added 3603 Read/Feed constraints in 263 ms returned sat
[2024-05-31 20:54:56] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 176 ms.
[2024-05-31 20:54:57] [INFO ] Added : 7 causal constraints over 2 iterations in 641 ms. Result :sat
Minimization took 4510 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 74 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 68 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-31 20:55:02] [INFO ] Invariant cache hit.
[2024-05-31 20:55:02] [INFO ] Implicit Places using invariants in 883 ms returned []
[2024-05-31 20:55:02] [INFO ] Invariant cache hit.
[2024-05-31 20:55:03] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 20:55:27] [INFO ] Implicit Places using invariants and state equation in 24442 ms returned []
Implicit Place search using SMT with State Equation took 25329 ms to find 0 implicit places.
[2024-05-31 20:55:27] [INFO ] Redundant transitions in 118 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-31 20:55:27] [INFO ] Invariant cache hit.
[2024-05-31 20:55:27] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32270ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32300ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57839 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (282 resets) in 352 ms. (113 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 186068 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 2
Probabilistic random walk after 186068 steps, saw 32961 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-31 20:56:02] [INFO ] Invariant cache hit.
[2024-05-31 20:56:02] [INFO ] State equation strengthened by 3603 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:56:03] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 20:56:03] [INFO ] Deduced a trap composed of 52 places in 678 ms of which 7 ms to minimize.
[2024-05-31 20:56:04] [INFO ] Deduced a trap composed of 37 places in 635 ms of which 7 ms to minimize.
[2024-05-31 20:56:05] [INFO ] Deduced a trap composed of 40 places in 641 ms of which 6 ms to minimize.
[2024-05-31 20:56:05] [INFO ] Deduced a trap composed of 36 places in 573 ms of which 6 ms to minimize.
[2024-05-31 20:56:06] [INFO ] Deduced a trap composed of 35 places in 579 ms of which 7 ms to minimize.
[2024-05-31 20:56:07] [INFO ] Deduced a trap composed of 37 places in 551 ms of which 6 ms to minimize.
[2024-05-31 20:56:07] [INFO ] Deduced a trap composed of 37 places in 536 ms of which 5 ms to minimize.
[2024-05-31 20:56:08] [INFO ] Deduced a trap composed of 42 places in 498 ms of which 5 ms to minimize.
SMT process timed out in 5200ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 71 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (283 resets) in 339 ms. (117 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 194432 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 1
Probabilistic random walk after 194432 steps, saw 33925 distinct states, run finished after 3002 ms. (steps per millisecond=64 ) properties seen :0
[2024-05-31 20:56:11] [INFO ] Invariant cache hit.
[2024-05-31 20:56:11] [INFO ] State equation strengthened by 3603 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:56:11] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:56:12] [INFO ] Deduced a trap composed of 38 places in 627 ms of which 6 ms to minimize.
[2024-05-31 20:56:12] [INFO ] Deduced a trap composed of 39 places in 617 ms of which 6 ms to minimize.
[2024-05-31 20:56:13] [INFO ] Deduced a trap composed of 38 places in 584 ms of which 6 ms to minimize.
[2024-05-31 20:56:14] [INFO ] Deduced a trap composed of 36 places in 598 ms of which 6 ms to minimize.
[2024-05-31 20:56:14] [INFO ] Deduced a trap composed of 47 places in 503 ms of which 5 ms to minimize.
[2024-05-31 20:56:15] [INFO ] Deduced a trap composed of 44 places in 564 ms of which 6 ms to minimize.
[2024-05-31 20:56:15] [INFO ] Deduced a trap composed of 44 places in 604 ms of which 7 ms to minimize.
[2024-05-31 20:56:16] [INFO ] Deduced a trap composed of 44 places in 566 ms of which 6 ms to minimize.
[2024-05-31 20:56:17] [INFO ] Deduced a trap composed of 38 places in 613 ms of which 6 ms to minimize.
[2024-05-31 20:56:17] [INFO ] Deduced a trap composed of 40 places in 591 ms of which 6 ms to minimize.
[2024-05-31 20:56:18] [INFO ] Deduced a trap composed of 39 places in 556 ms of which 7 ms to minimize.
[2024-05-31 20:56:18] [INFO ] Deduced a trap composed of 47 places in 565 ms of which 5 ms to minimize.
[2024-05-31 20:56:19] [INFO ] Deduced a trap composed of 35 places in 503 ms of which 5 ms to minimize.
[2024-05-31 20:56:19] [INFO ] Deduced a trap composed of 48 places in 469 ms of which 6 ms to minimize.
[2024-05-31 20:56:20] [INFO ] Deduced a trap composed of 44 places in 458 ms of which 5 ms to minimize.
[2024-05-31 20:56:20] [INFO ] Deduced a trap composed of 43 places in 472 ms of which 5 ms to minimize.
[2024-05-31 20:56:21] [INFO ] Deduced a trap composed of 48 places in 478 ms of which 5 ms to minimize.
[2024-05-31 20:56:21] [INFO ] Deduced a trap composed of 47 places in 456 ms of which 5 ms to minimize.
[2024-05-31 20:56:22] [INFO ] Deduced a trap composed of 46 places in 471 ms of which 5 ms to minimize.
[2024-05-31 20:56:22] [INFO ] Deduced a trap composed of 47 places in 499 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:56:23] [INFO ] Deduced a trap composed of 46 places in 470 ms of which 5 ms to minimize.
[2024-05-31 20:56:23] [INFO ] Deduced a trap composed of 46 places in 449 ms of which 5 ms to minimize.
[2024-05-31 20:56:24] [INFO ] Deduced a trap composed of 45 places in 429 ms of which 5 ms to minimize.
[2024-05-31 20:56:24] [INFO ] Deduced a trap composed of 48 places in 472 ms of which 5 ms to minimize.
[2024-05-31 20:56:25] [INFO ] Deduced a trap composed of 48 places in 426 ms of which 4 ms to minimize.
[2024-05-31 20:56:25] [INFO ] Deduced a trap composed of 46 places in 455 ms of which 5 ms to minimize.
[2024-05-31 20:56:26] [INFO ] Deduced a trap composed of 45 places in 426 ms of which 5 ms to minimize.
[2024-05-31 20:56:26] [INFO ] Deduced a trap composed of 48 places in 395 ms of which 5 ms to minimize.
[2024-05-31 20:56:26] [INFO ] Deduced a trap composed of 45 places in 377 ms of which 4 ms to minimize.
[2024-05-31 20:56:27] [INFO ] Deduced a trap composed of 46 places in 398 ms of which 5 ms to minimize.
[2024-05-31 20:56:27] [INFO ] Deduced a trap composed of 50 places in 368 ms of which 4 ms to minimize.
[2024-05-31 20:56:28] [INFO ] Deduced a trap composed of 43 places in 367 ms of which 4 ms to minimize.
[2024-05-31 20:56:28] [INFO ] Deduced a trap composed of 44 places in 355 ms of which 4 ms to minimize.
[2024-05-31 20:56:28] [INFO ] Deduced a trap composed of 47 places in 367 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 14/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3695/4776 variables, 1081/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 3603/4751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 0/4751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4778 variables, 2/4753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4778 variables, 0/4753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4778 variables, 0/4753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4753 constraints, problems are : Problem set: 0 solved, 1 unsolved in 18709 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 35/35 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:56:30] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:56:30] [INFO ] Deduced a trap composed of 64 places in 571 ms of which 6 ms to minimize.
[2024-05-31 20:56:30] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3695/4776 variables, 1081/1151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 3603/4754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 1/4755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4778 variables, 2/4757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4778 variables, 0/4757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4778 variables, 0/4757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4778/4778 variables, and 4757 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3285 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 38/38 constraints]
After SMT, in 22039ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 67 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 67 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-31 20:56:33] [INFO ] Invariant cache hit.
[2024-05-31 20:56:34] [INFO ] Implicit Places using invariants in 866 ms returned []
[2024-05-31 20:56:34] [INFO ] Invariant cache hit.
[2024-05-31 20:56:35] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 20:56:56] [INFO ] Implicit Places using invariants and state equation in 22036 ms returned []
Implicit Place search using SMT with State Equation took 22903 ms to find 0 implicit places.
[2024-05-31 20:56:56] [INFO ] Redundant transitions in 110 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-31 20:56:56] [INFO ] Invariant cache hit.
[2024-05-31 20:56:56] [INFO ] State equation strengthened by 3603 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32217ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32247ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55344 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3512 edges and 1083 vertex of which 959 / 1083 are part of one of the 2 SCC in 1 ms
Free SCC test removed 957 places
Drop transitions (Empty/Sink Transition effects.) removed 2644 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3566 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.0 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 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 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 9 ms. Remains 4 /1083 variables (removed 1079) and now considering 5/3695 (removed 3690) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-31 20:57:28] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 20:57:28] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:57:28] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:57:28] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:57:28] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 65 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-04 in 166984 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-06
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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-31 20:57:28] [INFO ] Computed 32 invariants in 54 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (72 resets) in 86 ms. (114 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 20:57:29] [INFO ] Invariant cache hit.
[2024-05-31 20:57:29] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:57:29] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:57:29] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2024-05-31 20:57:29] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-31 20:57:30] [INFO ] [Real]Added 3582 Read/Feed constraints in 262 ms returned sat
[2024-05-31 20:57:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:57:30] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 20:57:30] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 20:57:31] [INFO ] [Nat]Absence check using state equation in 618 ms returned sat
[2024-05-31 20:57:31] [INFO ] [Nat]Added 3582 Read/Feed constraints in 294 ms returned sat
[2024-05-31 20:57:31] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 199 ms.
[2024-05-31 20:57:32] [INFO ] Added : 7 causal constraints over 2 iterations in 671 ms. Result :sat
Minimization took 936 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1083 transition count 3695
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 1083 transition count 3694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 1082 transition count 3694
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 1082 transition count 3694
Applied a total of 24 rules in 267 ms. Remains 1082 /1090 variables (removed 8) and now considering 3694/3702 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 1082/1090 places, 3694/3702 transitions.
// Phase 1: matrix 3694 rows 1082 cols
[2024-05-31 20:57:33] [INFO ] Computed 32 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7145 resets) in 8374 ms. (119 steps per ms)
BEST_FIRST walk for 1000001 steps (200 resets) in 1108 ms. (901 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 20:57:42] [INFO ] Invariant cache hit.
[2024-05-31 20:57:42] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:57:42] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:57:43] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2024-05-31 20:57:43] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-31 20:57:43] [INFO ] [Real]Added 3604 Read/Feed constraints in 272 ms returned sat
[2024-05-31 20:57:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:57:44] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 20:57:44] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 20:57:44] [INFO ] [Nat]Absence check using state equation in 621 ms returned sat
[2024-05-31 20:57:45] [INFO ] [Nat]Added 3604 Read/Feed constraints in 304 ms returned sat
[2024-05-31 20:57:45] [INFO ] Computed and/alt/rep : 2620/6956/2620 causal constraints (skipped 1044 transitions) in 204 ms.
[2024-05-31 20:57:45] [INFO ] Added : 7 causal constraints over 2 iterations in 689 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 75 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 66 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-31 20:57:50] [INFO ] Invariant cache hit.
[2024-05-31 20:57:51] [INFO ] Implicit Places using invariants in 858 ms returned []
[2024-05-31 20:57:51] [INFO ] Invariant cache hit.
[2024-05-31 20:57:52] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-31 20:58:10] [INFO ] Implicit Places using invariants and state equation in 19480 ms returned []
Implicit Place search using SMT with State Equation took 20338 ms to find 0 implicit places.
[2024-05-31 20:58:10] [INFO ] Redundant transitions in 110 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-31 20:58:11] [INFO ] Invariant cache hit.
[2024-05-31 20:58:11] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32180ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32208ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52736 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (285 resets) in 353 ms. (112 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 194734 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 2
Probabilistic random walk after 194734 steps, saw 33968 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2024-05-31 20:58:46] [INFO ] Invariant cache hit.
[2024-05-31 20:58:46] [INFO ] State equation strengthened by 3604 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:58:46] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 20:58:47] [INFO ] Deduced a trap composed of 35 places in 600 ms of which 6 ms to minimize.
[2024-05-31 20:58:47] [INFO ] Deduced a trap composed of 42 places in 587 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 2/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3694/4774 variables, 1080/1115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3604/4719 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 0/4719 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4776 variables, 2/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4721 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2613 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 20:58:49] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 2/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 20:58:49] [INFO ] Deduced a trap composed of 37 places in 619 ms of which 7 ms to minimize.
[2024-05-31 20:58:50] [INFO ] Deduced a trap composed of 35 places in 593 ms of which 6 ms to minimize.
[2024-05-31 20:58:51] [INFO ] Deduced a trap composed of 37 places in 568 ms of which 6 ms to minimize.
[2024-05-31 20:58:51] [INFO ] Deduced a trap composed of 36 places in 574 ms of which 6 ms to minimize.
[2024-05-31 20:58:52] [INFO ] Deduced a trap composed of 36 places in 526 ms of which 5 ms to minimize.
[2024-05-31 20:58:52] [INFO ] Deduced a trap composed of 49 places in 513 ms of which 6 ms to minimize.
[2024-05-31 20:58:53] [INFO ] Deduced a trap composed of 36 places in 472 ms of which 5 ms to minimize.
[2024-05-31 20:58:53] [INFO ] Deduced a trap composed of 46 places in 487 ms of which 5 ms to minimize.
[2024-05-31 20:58:54] [INFO ] Deduced a trap composed of 37 places in 416 ms of which 5 ms to minimize.
SMT process timed out in 7817ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 70 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (285 resets) in 382 ms. (104 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 207022 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 1
Probabilistic random walk after 207022 steps, saw 35549 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-05-31 20:58:57] [INFO ] Invariant cache hit.
[2024-05-31 20:58:57] [INFO ] State equation strengthened by 3604 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:58:57] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:58:58] [INFO ] Deduced a trap composed of 37 places in 612 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3694/4774 variables, 1080/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3604/4718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 0/4718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4776 variables, 2/4720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4776 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4720 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2152 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:58:59] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:59:00] [INFO ] Deduced a trap composed of 37 places in 621 ms of which 6 ms to minimize.
[2024-05-31 20:59:01] [INFO ] Deduced a trap composed of 35 places in 586 ms of which 6 ms to minimize.
[2024-05-31 20:59:01] [INFO ] Deduced a trap composed of 37 places in 562 ms of which 6 ms to minimize.
[2024-05-31 20:59:02] [INFO ] Deduced a trap composed of 36 places in 583 ms of which 6 ms to minimize.
[2024-05-31 20:59:02] [INFO ] Deduced a trap composed of 36 places in 535 ms of which 6 ms to minimize.
[2024-05-31 20:59:03] [INFO ] Deduced a trap composed of 49 places in 520 ms of which 5 ms to minimize.
[2024-05-31 20:59:03] [INFO ] Deduced a trap composed of 44 places in 491 ms of which 5 ms to minimize.
[2024-05-31 20:59:04] [INFO ] Deduced a trap composed of 42 places in 489 ms of which 5 ms to minimize.
[2024-05-31 20:59:04] [INFO ] Deduced a trap composed of 52 places in 485 ms of which 5 ms to minimize.
[2024-05-31 20:59:05] [INFO ] Deduced a trap composed of 43 places in 475 ms of which 6 ms to minimize.
[2024-05-31 20:59:05] [INFO ] Deduced a trap composed of 44 places in 457 ms of which 5 ms to minimize.
[2024-05-31 20:59:06] [INFO ] Deduced a trap composed of 37 places in 451 ms of which 5 ms to minimize.
[2024-05-31 20:59:06] [INFO ] Deduced a trap composed of 36 places in 428 ms of which 5 ms to minimize.
[2024-05-31 20:59:07] [INFO ] Deduced a trap composed of 39 places in 415 ms of which 5 ms to minimize.
[2024-05-31 20:59:07] [INFO ] Deduced a trap composed of 35 places in 417 ms of which 5 ms to minimize.
[2024-05-31 20:59:07] [INFO ] Deduced a trap composed of 36 places in 380 ms of which 4 ms to minimize.
[2024-05-31 20:59:08] [INFO ] Deduced a trap composed of 38 places in 394 ms of which 4 ms to minimize.
[2024-05-31 20:59:08] [INFO ] Deduced a trap composed of 43 places in 359 ms of which 4 ms to minimize.
[2024-05-31 20:59:09] [INFO ] Deduced a trap composed of 37 places in 315 ms of which 4 ms to minimize.
[2024-05-31 20:59:09] [INFO ] Deduced a trap composed of 40 places in 298 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:59:09] [INFO ] Deduced a trap composed of 35 places in 298 ms of which 4 ms to minimize.
[2024-05-31 20:59:10] [INFO ] Deduced a trap composed of 38 places in 302 ms of which 4 ms to minimize.
[2024-05-31 20:59:10] [INFO ] Deduced a trap composed of 36 places in 275 ms of which 3 ms to minimize.
[2024-05-31 20:59:10] [INFO ] Deduced a trap composed of 38 places in 277 ms of which 4 ms to minimize.
[2024-05-31 20:59:10] [INFO ] Deduced a trap composed of 36 places in 277 ms of which 4 ms to minimize.
[2024-05-31 20:59:11] [INFO ] Deduced a trap composed of 38 places in 264 ms of which 3 ms to minimize.
[2024-05-31 20:59:11] [INFO ] Deduced a trap composed of 39 places in 262 ms of which 4 ms to minimize.
[2024-05-31 20:59:11] [INFO ] Deduced a trap composed of 38 places in 263 ms of which 4 ms to minimize.
[2024-05-31 20:59:12] [INFO ] Deduced a trap composed of 38 places in 264 ms of which 4 ms to minimize.
[2024-05-31 20:59:12] [INFO ] Deduced a trap composed of 38 places in 261 ms of which 3 ms to minimize.
[2024-05-31 20:59:12] [INFO ] Deduced a trap composed of 39 places in 259 ms of which 4 ms to minimize.
[2024-05-31 20:59:12] [INFO ] Deduced a trap composed of 37 places in 255 ms of which 3 ms to minimize.
[2024-05-31 20:59:13] [INFO ] Deduced a trap composed of 38 places in 257 ms of which 3 ms to minimize.
[2024-05-31 20:59:13] [INFO ] Deduced a trap composed of 38 places in 260 ms of which 4 ms to minimize.
[2024-05-31 20:59:13] [INFO ] Deduced a trap composed of 38 places in 257 ms of which 4 ms to minimize.
[2024-05-31 20:59:13] [INFO ] Deduced a trap composed of 39 places in 260 ms of which 4 ms to minimize.
[2024-05-31 20:59:14] [INFO ] Deduced a trap composed of 38 places in 253 ms of which 3 ms to minimize.
[2024-05-31 20:59:14] [INFO ] Deduced a trap composed of 49 places in 244 ms of which 4 ms to minimize.
[2024-05-31 20:59:14] [INFO ] Deduced a trap composed of 45 places in 241 ms of which 4 ms to minimize.
[2024-05-31 20:59:14] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:59:15] [INFO ] Deduced a trap composed of 54 places in 230 ms of which 3 ms to minimize.
[2024-05-31 20:59:15] [INFO ] Deduced a trap composed of 42 places in 250 ms of which 3 ms to minimize.
[2024-05-31 20:59:15] [INFO ] Deduced a trap composed of 39 places in 238 ms of which 3 ms to minimize.
[2024-05-31 20:59:16] [INFO ] Deduced a trap composed of 42 places in 247 ms of which 4 ms to minimize.
[2024-05-31 20:59:16] [INFO ] Deduced a trap composed of 38 places in 247 ms of which 4 ms to minimize.
[2024-05-31 20:59:16] [INFO ] Deduced a trap composed of 35 places in 219 ms of which 3 ms to minimize.
[2024-05-31 20:59:16] [INFO ] Deduced a trap composed of 39 places in 226 ms of which 3 ms to minimize.
[2024-05-31 20:59:16] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 3 ms to minimize.
[2024-05-31 20:59:17] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 3 ms to minimize.
[2024-05-31 20:59:17] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 3 ms to minimize.
[2024-05-31 20:59:17] [INFO ] Deduced a trap composed of 36 places in 207 ms of which 2 ms to minimize.
[2024-05-31 20:59:17] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 3 ms to minimize.
[2024-05-31 20:59:18] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 3 ms to minimize.
[2024-05-31 20:59:18] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 3 ms to minimize.
[2024-05-31 20:59:18] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 3 ms to minimize.
[2024-05-31 20:59:18] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 3 ms to minimize.
[2024-05-31 20:59:19] [INFO ] Deduced a trap composed of 43 places in 191 ms of which 2 ms to minimize.
[2024-05-31 20:59:19] [INFO ] Deduced a trap composed of 52 places in 182 ms of which 3 ms to minimize.
[2024-05-31 20:59:19] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 3 ms to minimize.
[2024-05-31 20:59:19] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:59:19] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 3 ms to minimize.
[2024-05-31 20:59:19] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 2 ms to minimize.
[2024-05-31 20:59:20] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 3 ms to minimize.
[2024-05-31 20:59:20] [INFO ] Deduced a trap composed of 54 places in 185 ms of which 2 ms to minimize.
[2024-05-31 20:59:20] [INFO ] Deduced a trap composed of 46 places in 189 ms of which 3 ms to minimize.
[2024-05-31 20:59:20] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 2 ms to minimize.
[2024-05-31 20:59:20] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 3 ms to minimize.
[2024-05-31 20:59:21] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 2 ms to minimize.
[2024-05-31 20:59:21] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 2 ms to minimize.
[2024-05-31 20:59:21] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 3 ms to minimize.
[2024-05-31 20:59:21] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 2 ms to minimize.
[2024-05-31 20:59:21] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 2 ms to minimize.
[2024-05-31 20:59:21] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 2 ms to minimize.
[2024-05-31 20:59:22] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-05-31 20:59:22] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 2 ms to minimize.
[2024-05-31 20:59:22] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-05-31 20:59:22] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-05-31 20:59:22] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 3 ms to minimize.
[2024-05-31 20:59:22] [INFO ] Deduced a trap composed of 48 places in 228 ms of which 3 ms to minimize.
[2024-05-31 20:59:23] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:59:23] [INFO ] Deduced a trap composed of 48 places in 233 ms of which 3 ms to minimize.
[2024-05-31 20:59:23] [INFO ] Deduced a trap composed of 39 places in 246 ms of which 3 ms to minimize.
[2024-05-31 20:59:23] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 4 ms to minimize.
[2024-05-31 20:59:24] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 3 ms to minimize.
[2024-05-31 20:59:24] [INFO ] Deduced a trap composed of 42 places in 235 ms of which 4 ms to minimize.
[2024-05-31 20:59:24] [INFO ] Deduced a trap composed of 50 places in 226 ms of which 4 ms to minimize.
[2024-05-31 20:59:24] [INFO ] Deduced a trap composed of 44 places in 236 ms of which 4 ms to minimize.
[2024-05-31 20:59:25] [INFO ] Deduced a trap composed of 48 places in 245 ms of which 3 ms to minimize.
[2024-05-31 20:59:25] [INFO ] Deduced a trap composed of 39 places in 214 ms of which 3 ms to minimize.
[2024-05-31 20:59:25] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 3 ms to minimize.
[2024-05-31 20:59:25] [INFO ] Deduced a trap composed of 43 places in 193 ms of which 2 ms to minimize.
[2024-05-31 20:59:26] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 3 ms to minimize.
[2024-05-31 20:59:26] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 6 ms to minimize.
[2024-05-31 20:59:26] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 2 ms to minimize.
[2024-05-31 20:59:26] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 2 ms to minimize.
[2024-05-31 20:59:26] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 3 ms to minimize.
[2024-05-31 20:59:27] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 3 ms to minimize.
[2024-05-31 20:59:27] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 3 ms to minimize.
[2024-05-31 20:59:27] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 2 ms to minimize.
[2024-05-31 20:59:27] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1080 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:59:27] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 2 ms to minimize.
[2024-05-31 20:59:28] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 2 ms to minimize.
[2024-05-31 20:59:28] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-05-31 20:59:28] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-05-31 20:59:28] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 2 ms to minimize.
[2024-05-31 20:59:28] [INFO ] Deduced a trap composed of 43 places in 206 ms of which 3 ms to minimize.
[2024-05-31 20:59:29] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 3 ms to minimize.
[2024-05-31 20:59:29] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 2 ms to minimize.
[2024-05-31 20:59:29] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 4 ms to minimize.
[2024-05-31 20:59:29] [INFO ] Deduced a trap composed of 39 places in 229 ms of which 3 ms to minimize.
[2024-05-31 20:59:30] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 3 ms to minimize.
[2024-05-31 20:59:30] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 3 ms to minimize.
[2024-05-31 20:59:30] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 3 ms to minimize.
[2024-05-31 20:59:30] [INFO ] Deduced a trap composed of 37 places in 218 ms of which 3 ms to minimize.
[2024-05-31 20:59:30] [INFO ] Deduced a trap composed of 43 places in 201 ms of which 3 ms to minimize.
[2024-05-31 20:59:31] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 3 ms to minimize.
[2024-05-31 20:59:31] [INFO ] Deduced a trap composed of 40 places in 221 ms of which 3 ms to minimize.
[2024-05-31 20:59:31] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 3 ms to minimize.
[2024-05-31 20:59:31] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 3 ms to minimize.
[2024-05-31 20:59:32] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1080 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:59:32] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 3 ms to minimize.
[2024-05-31 20:59:32] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 2 ms to minimize.
[2024-05-31 20:59:32] [INFO ] Deduced a trap composed of 47 places in 207 ms of which 3 ms to minimize.
[2024-05-31 20:59:32] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 3 ms to minimize.
[2024-05-31 20:59:33] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 3 ms to minimize.
[2024-05-31 20:59:33] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 2 ms to minimize.
[2024-05-31 20:59:33] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 3 ms to minimize.
[2024-05-31 20:59:33] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 2 ms to minimize.
[2024-05-31 20:59:33] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 2 ms to minimize.
[2024-05-31 20:59:34] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
[2024-05-31 20:59:34] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 2 ms to minimize.
[2024-05-31 20:59:34] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-31 20:59:34] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1080 variables, 13/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1080 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3694/4774 variables, 1080/1248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4774 variables, 3604/4852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4774 variables, 1/4853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4774 variables, 0/4853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/4776 variables, 2/4855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4776 variables, 0/4855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/4776 variables, 0/4855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4855 constraints, problems are : Problem set: 0 solved, 1 unsolved in 38457 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 136/136 constraints]
After SMT, in 40660ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 67 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 67 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-31 20:59:38] [INFO ] Invariant cache hit.
[2024-05-31 20:59:39] [INFO ] Implicit Places using invariants in 858 ms returned []
[2024-05-31 20:59:39] [INFO ] Invariant cache hit.
[2024-05-31 20:59:39] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-31 20:59:59] [INFO ] Implicit Places using invariants and state equation in 20454 ms returned []
Implicit Place search using SMT with State Equation took 21318 ms to find 0 implicit places.
[2024-05-31 20:59:59] [INFO ] Redundant transitions in 116 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-31 20:59:59] [INFO ] Invariant cache hit.
[2024-05-31 20:59:59] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32170ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32199ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53717 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-06 in 183002 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-31 21:00:31] [INFO ] Computed 32 invariants in 53 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 79 ms. (125 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 21:00:32] [INFO ] Invariant cache hit.
[2024-05-31 21:00:32] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 21:00:32] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:00:32] [INFO ] [Real]Absence check using state equation in 576 ms returned sat
[2024-05-31 21:00:32] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-31 21:00:33] [INFO ] [Real]Added 3582 Read/Feed constraints in 255 ms returned sat
[2024-05-31 21:00:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:00:33] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 21:00:33] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 21:00:33] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2024-05-31 21:00:34] [INFO ] [Nat]Added 3582 Read/Feed constraints in 243 ms returned sat
[2024-05-31 21:00:34] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 171 ms.
[2024-05-31 21:00:34] [INFO ] Added : 4 causal constraints over 1 iterations in 511 ms. Result :sat
Minimization took 936 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1084 transition count 3696
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1084 transition count 3695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1083 transition count 3695
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 1083 transition count 3695
Applied a total of 23 rules in 259 ms. Remains 1083 /1090 variables (removed 7) and now considering 3695/3702 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-31 21:00:35] [INFO ] Computed 32 invariants in 43 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7159 resets) in 7123 ms. (140 steps per ms)
BEST_FIRST walk for 1000001 steps (202 resets) in 985 ms. (1014 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 21:00:44] [INFO ] Invariant cache hit.
[2024-05-31 21:00:44] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-31 21:00:44] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 21:00:44] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2024-05-31 21:00:44] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 21:00:45] [INFO ] [Real]Added 3603 Read/Feed constraints in 255 ms returned sat
[2024-05-31 21:00:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:00:45] [INFO ] [Nat]Absence check using 30 positive place invariants in 13 ms returned sat
[2024-05-31 21:00:45] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:00:45] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2024-05-31 21:00:46] [INFO ] [Nat]Added 3603 Read/Feed constraints in 249 ms returned sat
[2024-05-31 21:00:46] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 167 ms.
[2024-05-31 21:00:46] [INFO ] Added : 4 causal constraints over 1 iterations in 511 ms. Result :sat
Minimization took 4504 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 68 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 66 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-31 21:00:51] [INFO ] Invariant cache hit.
[2024-05-31 21:00:52] [INFO ] Implicit Places using invariants in 880 ms returned []
[2024-05-31 21:00:52] [INFO ] Invariant cache hit.
[2024-05-31 21:00:53] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 21:01:08] [INFO ] Implicit Places using invariants and state equation in 15842 ms returned []
Implicit Place search using SMT with State Equation took 16722 ms to find 0 implicit places.
[2024-05-31 21:01:08] [INFO ] Redundant transitions in 112 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-31 21:01:08] [INFO ] Invariant cache hit.
[2024-05-31 21:01:08] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32203ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32230ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49144 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (285 resets) in 365 ms. (109 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 193235 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 2
Probabilistic random walk after 193235 steps, saw 33736 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2024-05-31 21:01:43] [INFO ] Invariant cache hit.
[2024-05-31 21:01:43] [INFO ] State equation strengthened by 3603 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 21:01:43] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 21:01:44] [INFO ] Deduced a trap composed of 51 places in 674 ms of which 6 ms to minimize.
[2024-05-31 21:01:45] [INFO ] Deduced a trap composed of 38 places in 616 ms of which 6 ms to minimize.
[2024-05-31 21:01:45] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:01:45] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 0 ms to minimize.
[2024-05-31 21:01:45] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:01:45] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 6/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3695/4776 variables, 1081/1120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4776 variables, 3603/4723 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 0/4723 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4778 variables, 2/4725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4778 variables, 0/4725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4778 variables, 0/4725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4725 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2963 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 21:01:46] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 6/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 21:01:47] [INFO ] Deduced a trap composed of 40 places in 636 ms of which 6 ms to minimize.
[2024-05-31 21:01:48] [INFO ] Deduced a trap composed of 39 places in 588 ms of which 6 ms to minimize.
[2024-05-31 21:01:48] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 3/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3695/4776 variables, 1081/1124 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 3603/4727 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 1/4728 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4728 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4778/4778 variables, and 4730 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3302 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 6300ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 99 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 68 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (284 resets) in 399 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 200373 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 200373 steps, saw 34736 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-31 21:01:53] [INFO ] Invariant cache hit.
[2024-05-31 21:01:53] [INFO ] State equation strengthened by 3603 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:01:53] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:01:54] [INFO ] Deduced a trap composed of 38 places in 669 ms of which 9 ms to minimize.
[2024-05-31 21:01:54] [INFO ] Deduced a trap composed of 39 places in 658 ms of which 7 ms to minimize.
[2024-05-31 21:01:55] [INFO ] Deduced a trap composed of 38 places in 655 ms of which 7 ms to minimize.
[2024-05-31 21:01:56] [INFO ] Deduced a trap composed of 36 places in 626 ms of which 7 ms to minimize.
[2024-05-31 21:01:56] [INFO ] Deduced a trap composed of 47 places in 588 ms of which 6 ms to minimize.
[2024-05-31 21:01:57] [INFO ] Deduced a trap composed of 44 places in 586 ms of which 6 ms to minimize.
[2024-05-31 21:01:58] [INFO ] Deduced a trap composed of 44 places in 573 ms of which 6 ms to minimize.
[2024-05-31 21:01:58] [INFO ] Deduced a trap composed of 44 places in 600 ms of which 7 ms to minimize.
[2024-05-31 21:01:59] [INFO ] Deduced a trap composed of 38 places in 625 ms of which 6 ms to minimize.
[2024-05-31 21:01:59] [INFO ] Deduced a trap composed of 40 places in 539 ms of which 6 ms to minimize.
[2024-05-31 21:02:00] [INFO ] Deduced a trap composed of 39 places in 564 ms of which 6 ms to minimize.
[2024-05-31 21:02:01] [INFO ] Deduced a trap composed of 42 places in 542 ms of which 6 ms to minimize.
[2024-05-31 21:02:01] [INFO ] Deduced a trap composed of 42 places in 558 ms of which 6 ms to minimize.
[2024-05-31 21:02:02] [INFO ] Deduced a trap composed of 46 places in 536 ms of which 6 ms to minimize.
[2024-05-31 21:02:02] [INFO ] Deduced a trap composed of 41 places in 518 ms of which 5 ms to minimize.
[2024-05-31 21:02:03] [INFO ] Deduced a trap composed of 44 places in 506 ms of which 6 ms to minimize.
[2024-05-31 21:02:03] [INFO ] Deduced a trap composed of 42 places in 520 ms of which 5 ms to minimize.
[2024-05-31 21:02:04] [INFO ] Deduced a trap composed of 46 places in 521 ms of which 5 ms to minimize.
[2024-05-31 21:02:04] [INFO ] Deduced a trap composed of 45 places in 526 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3695/4776 variables, 1081/1133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4776 variables, 3603/4736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 0/4736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4778 variables, 2/4738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4778 variables, 0/4738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4778 variables, 0/4738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12838 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 20/20 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:02:06] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 19/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:02:07] [INFO ] Deduced a trap composed of 40 places in 650 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3695/4776 variables, 1081/1135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 3603/4738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 1/4739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4778 variables, 2/4741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4778 variables, 0/4741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4778 variables, 0/4741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4778/4778 variables, and 4741 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2943 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 22/22 constraints]
After SMT, in 15814ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 67 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 68 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-31 21:02:09] [INFO ] Invariant cache hit.
[2024-05-31 21:02:10] [INFO ] Implicit Places using invariants in 895 ms returned []
[2024-05-31 21:02:10] [INFO ] Invariant cache hit.
[2024-05-31 21:02:10] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 21:02:27] [INFO ] Implicit Places using invariants and state equation in 17185 ms returned []
Implicit Place search using SMT with State Equation took 18081 ms to find 0 implicit places.
[2024-05-31 21:02:27] [INFO ] Redundant transitions in 116 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-31 21:02:27] [INFO ] Invariant cache hit.
[2024-05-31 21:02:27] [INFO ] State equation strengthened by 3603 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32272ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32302ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50582 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3512 edges and 1083 vertex of which 959 / 1083 are part of one of the 2 SCC in 0 ms
Free SCC test removed 957 places
Drop transitions (Empty/Sink Transition effects.) removed 2644 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3566 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.0 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 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 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 7 ms. Remains 4 /1083 variables (removed 1079) and now considering 5/3695 (removed 3690) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-31 21:02:59] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 21:02:59] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:02:59] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:02:59] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:02:59] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 53 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-07 in 147932 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-31 21:02:59] [INFO ] Computed 32 invariants in 51 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 78 ms. (126 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 21:02:59] [INFO ] Invariant cache hit.
[2024-05-31 21:03:00] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 21:03:00] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:03:00] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2024-05-31 21:03:00] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-31 21:03:01] [INFO ] [Real]Added 3582 Read/Feed constraints in 272 ms returned sat
[2024-05-31 21:03:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:03:01] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 21:03:01] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:03:01] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2024-05-31 21:03:02] [INFO ] [Nat]Added 3582 Read/Feed constraints in 340 ms returned sat
[2024-05-31 21:03:02] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 177 ms.
[2024-05-31 21:03:03] [INFO ] Added : 10 causal constraints over 2 iterations in 652 ms. Result :sat
Minimization took 958 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1083 transition count 3695
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 21 place count 1083 transition count 3695
Applied a total of 21 rules in 180 ms. Remains 1083 /1090 variables (removed 7) and now considering 3695/3702 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-31 21:03:04] [INFO ] Computed 32 invariants in 47 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7157 resets) in 7295 ms. (137 steps per ms)
BEST_FIRST walk for 1000001 steps (207 resets) in 995 ms. (1004 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 21:03:12] [INFO ] Invariant cache hit.
[2024-05-31 21:03:12] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 21:03:12] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:03:13] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2024-05-31 21:03:13] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 21:03:13] [INFO ] [Real]Added 3603 Read/Feed constraints in 259 ms returned sat
[2024-05-31 21:03:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:03:13] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-31 21:03:13] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:03:14] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2024-05-31 21:03:14] [INFO ] [Nat]Added 3603 Read/Feed constraints in 300 ms returned sat
[2024-05-31 21:03:14] [INFO ] Computed and/alt/rep : 2621/6956/2621 causal constraints (skipped 1044 transitions) in 175 ms.
[2024-05-31 21:03:15] [INFO ] Added : 11 causal constraints over 3 iterations in 785 ms. Result :sat
Minimization took 4508 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 71 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 65 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-31 21:03:20] [INFO ] Invariant cache hit.
[2024-05-31 21:03:21] [INFO ] Implicit Places using invariants in 878 ms returned []
[2024-05-31 21:03:21] [INFO ] Invariant cache hit.
[2024-05-31 21:03:21] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 21:03:39] [INFO ] Implicit Places using invariants and state equation in 18287 ms returned []
Implicit Place search using SMT with State Equation took 19167 ms to find 0 implicit places.
[2024-05-31 21:03:39] [INFO ] Redundant transitions in 110 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-31 21:03:39] [INFO ] Invariant cache hit.
[2024-05-31 21:03:39] [INFO ] State equation strengthened by 3603 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.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 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 1.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32467ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32497ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51855 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (284 resets) in 363 ms. (109 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 185468 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 185468 steps, saw 32901 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-31 21:04:15] [INFO ] Invariant cache hit.
[2024-05-31 21:04:15] [INFO ] State equation strengthened by 3603 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 21:04:15] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 21:04:16] [INFO ] Deduced a trap composed of 52 places in 663 ms of which 6 ms to minimize.
[2024-05-31 21:04:16] [INFO ] Deduced a trap composed of 35 places in 634 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3695/4776 variables, 1081/1116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4776 variables, 3603/4719 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 0/4719 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4778 variables, 2/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4778 variables, 0/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4778 variables, 0/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4721 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3066 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 21:04:18] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 2/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 21:04:19] [INFO ] Deduced a trap composed of 40 places in 673 ms of which 6 ms to minimize.
[2024-05-31 21:04:19] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 2/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3695/4776 variables, 1081/1119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 3603/4722 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 1/4723 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4723 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4778 variables, 2/4725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4778 variables, 0/4725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4778 variables, 0/4725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4778/4778 variables, and 4725 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2662 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 5769ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 71 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (285 resets) in 345 ms. (115 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 204075 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 1
Probabilistic random walk after 204075 steps, saw 35213 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-05-31 21:04:24] [INFO ] Invariant cache hit.
[2024-05-31 21:04:24] [INFO ] State equation strengthened by 3603 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:04:24] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:04:25] [INFO ] Deduced a trap composed of 35 places in 634 ms of which 6 ms to minimize.
[2024-05-31 21:04:25] [INFO ] Deduced a trap composed of 35 places in 584 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3695/4776 variables, 1081/1116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4776 variables, 3603/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 0/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4778 variables, 2/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4778 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4778 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4721 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2779 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:04:27] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:04:27] [INFO ] Deduced a trap composed of 40 places in 594 ms of which 6 ms to minimize.
[2024-05-31 21:04:28] [INFO ] Deduced a trap composed of 35 places in 653 ms of which 6 ms to minimize.
[2024-05-31 21:04:29] [INFO ] Deduced a trap composed of 41 places in 624 ms of which 6 ms to minimize.
[2024-05-31 21:04:29] [INFO ] Deduced a trap composed of 38 places in 584 ms of which 6 ms to minimize.
[2024-05-31 21:04:30] [INFO ] Deduced a trap composed of 39 places in 602 ms of which 6 ms to minimize.
[2024-05-31 21:04:30] [INFO ] Deduced a trap composed of 38 places in 591 ms of which 6 ms to minimize.
[2024-05-31 21:04:31] [INFO ] Deduced a trap composed of 39 places in 587 ms of which 6 ms to minimize.
[2024-05-31 21:04:32] [INFO ] Deduced a trap composed of 36 places in 586 ms of which 6 ms to minimize.
[2024-05-31 21:04:32] [INFO ] Deduced a trap composed of 56 places in 564 ms of which 6 ms to minimize.
[2024-05-31 21:04:33] [INFO ] Deduced a trap composed of 45 places in 582 ms of which 6 ms to minimize.
[2024-05-31 21:04:33] [INFO ] Deduced a trap composed of 42 places in 563 ms of which 6 ms to minimize.
[2024-05-31 21:04:34] [INFO ] Deduced a trap composed of 38 places in 525 ms of which 6 ms to minimize.
[2024-05-31 21:04:35] [INFO ] Deduced a trap composed of 52 places in 497 ms of which 5 ms to minimize.
[2024-05-31 21:04:35] [INFO ] Deduced a trap composed of 43 places in 502 ms of which 7 ms to minimize.
[2024-05-31 21:04:36] [INFO ] Deduced a trap composed of 50 places in 495 ms of which 6 ms to minimize.
[2024-05-31 21:04:36] [INFO ] Deduced a trap composed of 36 places in 472 ms of which 5 ms to minimize.
[2024-05-31 21:04:36] [INFO ] Deduced a trap composed of 36 places in 425 ms of which 4 ms to minimize.
[2024-05-31 21:04:37] [INFO ] Deduced a trap composed of 36 places in 415 ms of which 4 ms to minimize.
[2024-05-31 21:04:37] [INFO ] Deduced a trap composed of 36 places in 388 ms of which 5 ms to minimize.
[2024-05-31 21:04:38] [INFO ] Deduced a trap composed of 35 places in 377 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:04:38] [INFO ] Deduced a trap composed of 37 places in 368 ms of which 4 ms to minimize.
[2024-05-31 21:04:38] [INFO ] Deduced a trap composed of 35 places in 333 ms of which 4 ms to minimize.
[2024-05-31 21:04:39] [INFO ] Deduced a trap composed of 36 places in 304 ms of which 4 ms to minimize.
[2024-05-31 21:04:39] [INFO ] Deduced a trap composed of 41 places in 282 ms of which 3 ms to minimize.
[2024-05-31 21:04:39] [INFO ] Deduced a trap composed of 36 places in 265 ms of which 3 ms to minimize.
[2024-05-31 21:04:40] [INFO ] Deduced a trap composed of 35 places in 264 ms of which 3 ms to minimize.
[2024-05-31 21:04:40] [INFO ] Deduced a trap composed of 34 places in 253 ms of which 3 ms to minimize.
[2024-05-31 21:04:40] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 4 ms to minimize.
[2024-05-31 21:04:40] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 4 ms to minimize.
[2024-05-31 21:04:41] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 3 ms to minimize.
[2024-05-31 21:04:41] [INFO ] Deduced a trap composed of 44 places in 202 ms of which 3 ms to minimize.
[2024-05-31 21:04:41] [INFO ] Deduced a trap composed of 43 places in 207 ms of which 3 ms to minimize.
[2024-05-31 21:04:41] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 3 ms to minimize.
[2024-05-31 21:04:41] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 3 ms to minimize.
[2024-05-31 21:04:42] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 3 ms to minimize.
[2024-05-31 21:04:42] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 2 ms to minimize.
[2024-05-31 21:04:42] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 3 ms to minimize.
[2024-05-31 21:04:42] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 2 ms to minimize.
[2024-05-31 21:04:42] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 3 ms to minimize.
[2024-05-31 21:04:43] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:04:43] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 2 ms to minimize.
[2024-05-31 21:04:43] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 2 ms to minimize.
[2024-05-31 21:04:43] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 2 ms to minimize.
[2024-05-31 21:04:43] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 2 ms to minimize.
[2024-05-31 21:04:43] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
[2024-05-31 21:04:44] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 2 ms to minimize.
[2024-05-31 21:04:44] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 2 ms to minimize.
[2024-05-31 21:04:44] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 2 ms to minimize.
[2024-05-31 21:04:44] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 1 ms to minimize.
[2024-05-31 21:04:44] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
[2024-05-31 21:04:44] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1081 variables, 11/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1081 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3695/4776 variables, 1081/1168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 3603/4771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4776 variables, 1/4772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4776 variables, 0/4772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/4778 variables, 2/4774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4778 variables, 0/4774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/4778 variables, 0/4774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4778/4778 variables, and 4774 constraints, problems are : Problem set: 0 solved, 1 unsolved in 19282 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 22099ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 66 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 67 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-31 21:04:46] [INFO ] Invariant cache hit.
[2024-05-31 21:04:47] [INFO ] Implicit Places using invariants in 861 ms returned []
[2024-05-31 21:04:47] [INFO ] Invariant cache hit.
[2024-05-31 21:04:47] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 21:05:05] [INFO ] Implicit Places using invariants and state equation in 18678 ms returned []
Implicit Place search using SMT with State Equation took 19558 ms to find 0 implicit places.
[2024-05-31 21:05:06] [INFO ] Redundant transitions in 117 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-31 21:05:06] [INFO ] Invariant cache hit.
[2024-05-31 21:05:06] [INFO ] State equation strengthened by 3603 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.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 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 1.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32224ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32254ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52017 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3513 edges and 1083 vertex of which 958 / 1083 are part of one of the 2 SCC in 1 ms
Free SCC test removed 956 places
Drop transitions (Empty/Sink Transition effects.) removed 2644 transitions
Ensure Unique test removed 920 transitions
Reduce isomorphic transitions removed 3564 transitions.
Graph (complete) has 314 edges and 127 vertex of which 35 are kept as prefixes of interest. Removing 92 places using SCC suffix rule.1 ms
Discarding 92 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 35 transition count 40
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 92 place count 6 transition count 11
Iterating global reduction 1 with 29 rules applied. Total rules applied 121 place count 6 transition count 11
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 123 place count 5 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 5 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 4 transition count 7
Applied a total of 126 rules in 7 ms. Remains 4 /1083 variables (removed 1079) and now considering 7/3695 (removed 3688) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 4 cols
[2024-05-31 21:05:38] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 21:05:38] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:05:38] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:05:38] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:05:38] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 52 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-08 in 158555 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-31 21:05:38] [INFO ] Computed 32 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 75 ms. (131 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 21:05:38] [INFO ] Invariant cache hit.
[2024-05-31 21:05:38] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 21:05:38] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:05:39] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2024-05-31 21:05:39] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-31 21:05:39] [INFO ] [Real]Added 3582 Read/Feed constraints in 251 ms returned sat
[2024-05-31 21:05:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:05:39] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 21:05:39] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-31 21:05:40] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2024-05-31 21:05:40] [INFO ] [Nat]Added 3582 Read/Feed constraints in 289 ms returned sat
[2024-05-31 21:05:40] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 178 ms.
[2024-05-31 21:05:41] [INFO ] Added : 4 causal constraints over 1 iterations in 539 ms. Result :sat
Minimization took 951 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1083 transition count 3695
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 1083 transition count 3694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 1082 transition count 3694
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 1082 transition count 3694
Applied a total of 24 rules in 260 ms. Remains 1082 /1090 variables (removed 8) and now considering 3694/3702 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 1082/1090 places, 3694/3702 transitions.
// Phase 1: matrix 3694 rows 1082 cols
[2024-05-31 21:05:42] [INFO ] Computed 32 invariants in 50 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7159 resets) in 7284 ms. (137 steps per ms)
BEST_FIRST walk for 1000001 steps (199 resets) in 1005 ms. (994 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 21:05:50] [INFO ] Invariant cache hit.
[2024-05-31 21:05:51] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-31 21:05:51] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:05:51] [INFO ] [Real]Absence check using state equation in 609 ms returned sat
[2024-05-31 21:05:51] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-31 21:05:52] [INFO ] [Real]Added 3604 Read/Feed constraints in 243 ms returned sat
[2024-05-31 21:05:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:05:52] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 21:05:52] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:05:52] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2024-05-31 21:05:53] [INFO ] [Nat]Added 3604 Read/Feed constraints in 260 ms returned sat
[2024-05-31 21:05:53] [INFO ] Computed and/alt/rep : 2620/6956/2620 causal constraints (skipped 1044 transitions) in 179 ms.
[2024-05-31 21:05:53] [INFO ] Added : 4 causal constraints over 1 iterations in 535 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 75 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 69 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-31 21:05:58] [INFO ] Invariant cache hit.
[2024-05-31 21:05:59] [INFO ] Implicit Places using invariants in 908 ms returned []
[2024-05-31 21:05:59] [INFO ] Invariant cache hit.
[2024-05-31 21:06:00] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-31 21:06:19] [INFO ] Implicit Places using invariants and state equation in 20382 ms returned []
Implicit Place search using SMT with State Equation took 21291 ms to find 0 implicit places.
[2024-05-31 21:06:19] [INFO ] Redundant transitions in 119 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-31 21:06:19] [INFO ] Invariant cache hit.
[2024-05-31 21:06:19] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32262ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32290ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53778 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (282 resets) in 500 ms. (79 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 187331 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 2
Probabilistic random walk after 187331 steps, saw 33089 distinct states, run finished after 3003 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-31 21:06:55] [INFO ] Invariant cache hit.
[2024-05-31 21:06:55] [INFO ] State equation strengthened by 3604 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 21:06:55] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 21:06:56] [INFO ] Deduced a trap composed of 35 places in 664 ms of which 8 ms to minimize.
[2024-05-31 21:06:56] [INFO ] Deduced a trap composed of 34 places in 611 ms of which 7 ms to minimize.
[2024-05-31 21:06:57] [INFO ] Deduced a trap composed of 52 places in 588 ms of which 7 ms to minimize.
[2024-05-31 21:06:58] [INFO ] Deduced a trap composed of 51 places in 571 ms of which 6 ms to minimize.
[2024-05-31 21:06:58] [INFO ] Deduced a trap composed of 42 places in 505 ms of which 6 ms to minimize.
[2024-05-31 21:06:59] [INFO ] Deduced a trap composed of 37 places in 523 ms of which 6 ms to minimize.
[2024-05-31 21:06:59] [INFO ] Deduced a trap composed of 37 places in 491 ms of which 6 ms to minimize.
[2024-05-31 21:07:00] [INFO ] Deduced a trap composed of 43 places in 531 ms of which 6 ms to minimize.
[2024-05-31 21:07:00] [INFO ] Deduced a trap composed of 35 places in 524 ms of which 6 ms to minimize.
SMT process timed out in 5525ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 69 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (288 resets) in 431 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 198314 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 198314 steps, saw 34459 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-31 21:07:04] [INFO ] Invariant cache hit.
[2024-05-31 21:07:04] [INFO ] State equation strengthened by 3604 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:07:04] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:07:05] [INFO ] Deduced a trap composed of 37 places in 644 ms of which 7 ms to minimize.
[2024-05-31 21:07:05] [INFO ] Deduced a trap composed of 37 places in 639 ms of which 6 ms to minimize.
[2024-05-31 21:07:06] [INFO ] Deduced a trap composed of 34 places in 627 ms of which 7 ms to minimize.
[2024-05-31 21:07:06] [INFO ] Deduced a trap composed of 42 places in 611 ms of which 6 ms to minimize.
[2024-05-31 21:07:07] [INFO ] Deduced a trap composed of 40 places in 594 ms of which 6 ms to minimize.
[2024-05-31 21:07:08] [INFO ] Deduced a trap composed of 44 places in 573 ms of which 6 ms to minimize.
[2024-05-31 21:07:08] [INFO ] Deduced a trap composed of 41 places in 585 ms of which 6 ms to minimize.
[2024-05-31 21:07:09] [INFO ] Deduced a trap composed of 44 places in 495 ms of which 5 ms to minimize.
[2024-05-31 21:07:09] [INFO ] Deduced a trap composed of 46 places in 546 ms of which 6 ms to minimize.
[2024-05-31 21:07:10] [INFO ] Deduced a trap composed of 50 places in 556 ms of which 6 ms to minimize.
[2024-05-31 21:07:11] [INFO ] Deduced a trap composed of 48 places in 554 ms of which 6 ms to minimize.
[2024-05-31 21:07:11] [INFO ] Deduced a trap composed of 35 places in 526 ms of which 6 ms to minimize.
[2024-05-31 21:07:12] [INFO ] Deduced a trap composed of 35 places in 507 ms of which 5 ms to minimize.
[2024-05-31 21:07:12] [INFO ] Deduced a trap composed of 42 places in 492 ms of which 5 ms to minimize.
[2024-05-31 21:07:13] [INFO ] Deduced a trap composed of 40 places in 492 ms of which 4 ms to minimize.
[2024-05-31 21:07:13] [INFO ] Deduced a trap composed of 46 places in 442 ms of which 5 ms to minimize.
[2024-05-31 21:07:14] [INFO ] Deduced a trap composed of 41 places in 431 ms of which 5 ms to minimize.
[2024-05-31 21:07:14] [INFO ] Deduced a trap composed of 38 places in 424 ms of which 5 ms to minimize.
[2024-05-31 21:07:14] [INFO ] Deduced a trap composed of 46 places in 402 ms of which 5 ms to minimize.
[2024-05-31 21:07:15] [INFO ] Deduced a trap composed of 45 places in 390 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:07:15] [INFO ] Deduced a trap composed of 45 places in 411 ms of which 5 ms to minimize.
[2024-05-31 21:07:16] [INFO ] Deduced a trap composed of 45 places in 412 ms of which 4 ms to minimize.
[2024-05-31 21:07:16] [INFO ] Deduced a trap composed of 38 places in 355 ms of which 5 ms to minimize.
[2024-05-31 21:07:16] [INFO ] Deduced a trap composed of 40 places in 376 ms of which 4 ms to minimize.
[2024-05-31 21:07:17] [INFO ] Deduced a trap composed of 35 places in 352 ms of which 4 ms to minimize.
[2024-05-31 21:07:17] [INFO ] Deduced a trap composed of 35 places in 330 ms of which 4 ms to minimize.
[2024-05-31 21:07:18] [INFO ] Deduced a trap composed of 41 places in 316 ms of which 4 ms to minimize.
[2024-05-31 21:07:18] [INFO ] Deduced a trap composed of 48 places in 297 ms of which 5 ms to minimize.
[2024-05-31 21:07:18] [INFO ] Deduced a trap composed of 44 places in 314 ms of which 4 ms to minimize.
[2024-05-31 21:07:19] [INFO ] Deduced a trap composed of 44 places in 312 ms of which 5 ms to minimize.
[2024-05-31 21:07:19] [INFO ] Deduced a trap composed of 37 places in 307 ms of which 4 ms to minimize.
[2024-05-31 21:07:19] [INFO ] Deduced a trap composed of 42 places in 295 ms of which 3 ms to minimize.
[2024-05-31 21:07:19] [INFO ] Deduced a trap composed of 42 places in 284 ms of which 3 ms to minimize.
[2024-05-31 21:07:20] [INFO ] Deduced a trap composed of 42 places in 286 ms of which 4 ms to minimize.
[2024-05-31 21:07:20] [INFO ] Deduced a trap composed of 46 places in 294 ms of which 4 ms to minimize.
[2024-05-31 21:07:20] [INFO ] Deduced a trap composed of 49 places in 288 ms of which 4 ms to minimize.
[2024-05-31 21:07:21] [INFO ] Deduced a trap composed of 48 places in 284 ms of which 3 ms to minimize.
[2024-05-31 21:07:21] [INFO ] Deduced a trap composed of 45 places in 289 ms of which 4 ms to minimize.
[2024-05-31 21:07:21] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 19/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3694/4774 variables, 1080/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 3604/4756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4774 variables, 0/4756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4776 variables, 2/4758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4776 variables, 0/4758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 19042 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 40/40 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:07:23] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 39/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:07:24] [INFO ] Deduced a trap composed of 45 places in 643 ms of which 7 ms to minimize.
[2024-05-31 21:07:24] [INFO ] Deduced a trap composed of 45 places in 649 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3694/4774 variables, 1080/1155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4774 variables, 3604/4759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4774 variables, 1/4760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4774 variables, 0/4760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4776 variables, 2/4762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4776 variables, 0/4762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4776 variables, 0/4762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4762 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4293 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 43/43 constraints]
After SMT, in 23373ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 64 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 75 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 69 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-31 21:07:27] [INFO ] Invariant cache hit.
[2024-05-31 21:07:28] [INFO ] Implicit Places using invariants in 895 ms returned []
[2024-05-31 21:07:28] [INFO ] Invariant cache hit.
[2024-05-31 21:07:29] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-31 21:07:48] [INFO ] Implicit Places using invariants and state equation in 20290 ms returned []
Implicit Place search using SMT with State Equation took 21186 ms to find 0 implicit places.
[2024-05-31 21:07:48] [INFO ] Redundant transitions in 120 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-31 21:07:49] [INFO ] Invariant cache hit.
[2024-05-31 21:07:49] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32521ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32556ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53947 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3511 edges and 1082 vertex of which 958 / 1082 are part of one of the 2 SCC in 1 ms
Free SCC test removed 956 places
Drop transitions (Empty/Sink Transition effects.) removed 2643 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3565 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.0 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 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 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 7 ms. Remains 4 /1082 variables (removed 1078) and now considering 5/3694 (removed 3689) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-31 21:08:21] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 21:08:21] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:08:21] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:08:21] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:08:21] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 54 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-09 in 163198 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-31 21:08:21] [INFO ] Computed 32 invariants in 51 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 94 ms. (105 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 21:08:21] [INFO ] Invariant cache hit.
[2024-05-31 21:08:21] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 21:08:21] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:08:22] [INFO ] [Real]Absence check using state equation in 659 ms returned sat
[2024-05-31 21:08:22] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-31 21:08:22] [INFO ] [Real]Added 3582 Read/Feed constraints in 302 ms returned sat
[2024-05-31 21:08:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:23] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 21:08:23] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:08:23] [INFO ] [Nat]Absence check using state equation in 644 ms returned sat
[2024-05-31 21:08:24] [INFO ] [Nat]Added 3582 Read/Feed constraints in 423 ms returned sat
[2024-05-31 21:08:24] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 204 ms.
[2024-05-31 21:08:25] [INFO ] Added : 10 causal constraints over 2 iterations in 699 ms. Result :sat
Minimization took 933 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1083 transition count 3695
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 1083 transition count 3694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 1082 transition count 3694
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 1082 transition count 3694
Applied a total of 24 rules in 268 ms. Remains 1082 /1090 variables (removed 8) and now considering 3694/3702 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 1082/1090 places, 3694/3702 transitions.
// Phase 1: matrix 3694 rows 1082 cols
[2024-05-31 21:08:26] [INFO ] Computed 32 invariants in 48 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7159 resets) in 8436 ms. (118 steps per ms)
BEST_FIRST walk for 1000001 steps (203 resets) in 1116 ms. (895 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 21:08:35] [INFO ] Invariant cache hit.
[2024-05-31 21:08:36] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 21:08:36] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:08:36] [INFO ] [Real]Absence check using state equation in 645 ms returned sat
[2024-05-31 21:08:36] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-31 21:08:37] [INFO ] [Real]Added 3604 Read/Feed constraints in 266 ms returned sat
[2024-05-31 21:08:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:37] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 21:08:37] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:08:37] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2024-05-31 21:08:38] [INFO ] [Nat]Added 3604 Read/Feed constraints in 339 ms returned sat
[2024-05-31 21:08:38] [INFO ] Computed and/alt/rep : 2620/6956/2620 causal constraints (skipped 1044 transitions) in 178 ms.
[2024-05-31 21:08:38] [INFO ] Added : 8 causal constraints over 2 iterations in 649 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 73 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 66 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-31 21:08:43] [INFO ] Invariant cache hit.
[2024-05-31 21:08:44] [INFO ] Implicit Places using invariants in 896 ms returned []
[2024-05-31 21:08:44] [INFO ] Invariant cache hit.
[2024-05-31 21:08:45] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-31 21:09:02] [INFO ] Implicit Places using invariants and state equation in 17874 ms returned []
Implicit Place search using SMT with State Equation took 18772 ms to find 0 implicit places.
[2024-05-31 21:09:02] [INFO ] Redundant transitions in 118 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-31 21:09:02] [INFO ] Invariant cache hit.
[2024-05-31 21:09:02] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32176ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32206ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51176 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (287 resets) in 365 ms. (109 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 193814 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 2
Probabilistic random walk after 193814 steps, saw 33829 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2024-05-31 21:09:37] [INFO ] Invariant cache hit.
[2024-05-31 21:09:37] [INFO ] State equation strengthened by 3604 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 21:09:38] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 21:09:38] [INFO ] Deduced a trap composed of 52 places in 594 ms of which 6 ms to minimize.
[2024-05-31 21:09:39] [INFO ] Deduced a trap composed of 52 places in 641 ms of which 7 ms to minimize.
[2024-05-31 21:09:40] [INFO ] Deduced a trap composed of 38 places in 605 ms of which 6 ms to minimize.
[2024-05-31 21:09:40] [INFO ] Deduced a trap composed of 42 places in 613 ms of which 6 ms to minimize.
[2024-05-31 21:09:41] [INFO ] Deduced a trap composed of 56 places in 569 ms of which 6 ms to minimize.
[2024-05-31 21:09:41] [INFO ] Deduced a trap composed of 42 places in 559 ms of which 6 ms to minimize.
[2024-05-31 21:09:42] [INFO ] Deduced a trap composed of 47 places in 573 ms of which 6 ms to minimize.
[2024-05-31 21:09:42] [INFO ] Deduced a trap composed of 36 places in 529 ms of which 6 ms to minimize.
SMT process timed out in 5146ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 68 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (285 resets) in 369 ms. (108 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 200105 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 200105 steps, saw 34695 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-31 21:09:46] [INFO ] Invariant cache hit.
[2024-05-31 21:09:46] [INFO ] State equation strengthened by 3604 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:09:46] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:09:47] [INFO ] Deduced a trap composed of 38 places in 657 ms of which 6 ms to minimize.
[2024-05-31 21:09:47] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3694/4774 variables, 1080/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3604/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 0/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4776 variables, 2/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4721 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2262 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:09:48] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:09:49] [INFO ] Deduced a trap composed of 38 places in 643 ms of which 6 ms to minimize.
[2024-05-31 21:09:50] [INFO ] Deduced a trap composed of 36 places in 619 ms of which 6 ms to minimize.
[2024-05-31 21:09:50] [INFO ] Deduced a trap composed of 53 places in 610 ms of which 6 ms to minimize.
[2024-05-31 21:09:51] [INFO ] Deduced a trap composed of 37 places in 528 ms of which 6 ms to minimize.
[2024-05-31 21:09:51] [INFO ] Deduced a trap composed of 38 places in 538 ms of which 5 ms to minimize.
[2024-05-31 21:09:52] [INFO ] Deduced a trap composed of 38 places in 505 ms of which 5 ms to minimize.
[2024-05-31 21:09:52] [INFO ] Deduced a trap composed of 37 places in 518 ms of which 6 ms to minimize.
[2024-05-31 21:09:53] [INFO ] Deduced a trap composed of 45 places in 498 ms of which 5 ms to minimize.
[2024-05-31 21:09:53] [INFO ] Deduced a trap composed of 42 places in 526 ms of which 5 ms to minimize.
[2024-05-31 21:09:54] [INFO ] Deduced a trap composed of 42 places in 488 ms of which 5 ms to minimize.
[2024-05-31 21:09:54] [INFO ] Deduced a trap composed of 39 places in 462 ms of which 5 ms to minimize.
[2024-05-31 21:09:55] [INFO ] Deduced a trap composed of 37 places in 452 ms of which 5 ms to minimize.
[2024-05-31 21:09:55] [INFO ] Deduced a trap composed of 43 places in 397 ms of which 4 ms to minimize.
[2024-05-31 21:09:56] [INFO ] Deduced a trap composed of 37 places in 435 ms of which 5 ms to minimize.
[2024-05-31 21:09:56] [INFO ] Deduced a trap composed of 39 places in 422 ms of which 4 ms to minimize.
[2024-05-31 21:09:57] [INFO ] Deduced a trap composed of 35 places in 399 ms of which 5 ms to minimize.
[2024-05-31 21:09:57] [INFO ] Deduced a trap composed of 45 places in 384 ms of which 4 ms to minimize.
[2024-05-31 21:09:57] [INFO ] Deduced a trap composed of 41 places in 364 ms of which 5 ms to minimize.
[2024-05-31 21:09:58] [INFO ] Deduced a trap composed of 42 places in 349 ms of which 4 ms to minimize.
[2024-05-31 21:09:58] [INFO ] Deduced a trap composed of 51 places in 366 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:09:58] [INFO ] Deduced a trap composed of 52 places in 366 ms of which 4 ms to minimize.
[2024-05-31 21:09:59] [INFO ] Deduced a trap composed of 40 places in 305 ms of which 5 ms to minimize.
[2024-05-31 21:09:59] [INFO ] Deduced a trap composed of 40 places in 303 ms of which 4 ms to minimize.
[2024-05-31 21:09:59] [INFO ] Deduced a trap composed of 39 places in 286 ms of which 4 ms to minimize.
[2024-05-31 21:10:00] [INFO ] Deduced a trap composed of 48 places in 294 ms of which 4 ms to minimize.
[2024-05-31 21:10:00] [INFO ] Deduced a trap composed of 44 places in 275 ms of which 3 ms to minimize.
[2024-05-31 21:10:00] [INFO ] Deduced a trap composed of 38 places in 265 ms of which 3 ms to minimize.
[2024-05-31 21:10:01] [INFO ] Deduced a trap composed of 42 places in 266 ms of which 3 ms to minimize.
[2024-05-31 21:10:01] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 3 ms to minimize.
[2024-05-31 21:10:01] [INFO ] Deduced a trap composed of 37 places in 240 ms of which 3 ms to minimize.
[2024-05-31 21:10:01] [INFO ] Deduced a trap composed of 35 places in 246 ms of which 4 ms to minimize.
[2024-05-31 21:10:02] [INFO ] Deduced a trap composed of 40 places in 248 ms of which 4 ms to minimize.
[2024-05-31 21:10:02] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 3 ms to minimize.
[2024-05-31 21:10:02] [INFO ] Deduced a trap composed of 40 places in 213 ms of which 3 ms to minimize.
[2024-05-31 21:10:02] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 3 ms to minimize.
[2024-05-31 21:10:02] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 3 ms to minimize.
[2024-05-31 21:10:03] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 2 ms to minimize.
[2024-05-31 21:10:03] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 3 ms to minimize.
[2024-05-31 21:10:03] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 2 ms to minimize.
[2024-05-31 21:10:03] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:10:03] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 2 ms to minimize.
[2024-05-31 21:10:04] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 2 ms to minimize.
[2024-05-31 21:10:04] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 3 ms to minimize.
[2024-05-31 21:10:04] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 2 ms to minimize.
[2024-05-31 21:10:04] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 2 ms to minimize.
[2024-05-31 21:10:04] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
[2024-05-31 21:10:04] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 2 ms to minimize.
[2024-05-31 21:10:05] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-05-31 21:10:05] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2024-05-31 21:10:05] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 1 ms to minimize.
[2024-05-31 21:10:05] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 2 ms to minimize.
[2024-05-31 21:10:05] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-31 21:10:05] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-05-31 21:10:05] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2024-05-31 21:10:05] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2024-05-31 21:10:06] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-05-31 21:10:06] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2024-05-31 21:10:06] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-31 21:10:06] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-05-31 21:10:06] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:10:06] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 1 ms to minimize.
[2024-05-31 21:10:06] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-31 21:10:06] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-05-31 21:10:06] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 1 ms to minimize.
[2024-05-31 21:10:07] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 2 ms to minimize.
[2024-05-31 21:10:07] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 2 ms to minimize.
[2024-05-31 21:10:07] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
[2024-05-31 21:10:07] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2024-05-31 21:10:07] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-05-31 21:10:07] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2024-05-31 21:10:07] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 2 ms to minimize.
[2024-05-31 21:10:08] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 2 ms to minimize.
[2024-05-31 21:10:08] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 1 ms to minimize.
[2024-05-31 21:10:08] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-31 21:10:08] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 1 ms to minimize.
[2024-05-31 21:10:08] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-05-31 21:10:08] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 2 ms to minimize.
[2024-05-31 21:10:08] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 3 ms to minimize.
[2024-05-31 21:10:08] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 2 ms to minimize.
[2024-05-31 21:10:09] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:10:09] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
[2024-05-31 21:10:09] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2024-05-31 21:10:09] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 2 ms to minimize.
[2024-05-31 21:10:09] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 2 ms to minimize.
[2024-05-31 21:10:09] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 2 ms to minimize.
[2024-05-31 21:10:10] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 2 ms to minimize.
[2024-05-31 21:10:10] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 2 ms to minimize.
[2024-05-31 21:10:10] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 2 ms to minimize.
[2024-05-31 21:10:10] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 2 ms to minimize.
[2024-05-31 21:10:10] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 3 ms to minimize.
[2024-05-31 21:10:10] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 2 ms to minimize.
[2024-05-31 21:10:11] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2024-05-31 21:10:11] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2024-05-31 21:10:11] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 2 ms to minimize.
[2024-05-31 21:10:11] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-05-31 21:10:11] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2024-05-31 21:10:11] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 2 ms to minimize.
[2024-05-31 21:10:12] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 2 ms to minimize.
[2024-05-31 21:10:12] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 1 ms to minimize.
[2024-05-31 21:10:12] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1080 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:10:12] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 2 ms to minimize.
[2024-05-31 21:10:12] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 2 ms to minimize.
[2024-05-31 21:10:12] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-31 21:10:12] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 1 ms to minimize.
[2024-05-31 21:10:13] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 2 ms to minimize.
[2024-05-31 21:10:13] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 2 ms to minimize.
[2024-05-31 21:10:13] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 3 ms to minimize.
[2024-05-31 21:10:13] [INFO ] Deduced a trap composed of 48 places in 146 ms of which 2 ms to minimize.
[2024-05-31 21:10:13] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 2 ms to minimize.
[2024-05-31 21:10:14] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 3 ms to minimize.
[2024-05-31 21:10:14] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 2 ms to minimize.
[2024-05-31 21:10:14] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1080 variables, 12/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1080 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3694/4774 variables, 1080/1228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4774 variables, 3604/4832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4774 variables, 1/4833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4774 variables, 0/4833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/4776 variables, 2/4835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4776 variables, 0/4835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/4776 variables, 0/4835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4835 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27902 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 116/116 constraints]
After SMT, in 30199ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 68 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 68 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-31 21:10:16] [INFO ] Invariant cache hit.
[2024-05-31 21:10:17] [INFO ] Implicit Places using invariants in 895 ms returned []
[2024-05-31 21:10:17] [INFO ] Invariant cache hit.
[2024-05-31 21:10:18] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-31 21:10:36] [INFO ] Implicit Places using invariants and state equation in 18850 ms returned []
Implicit Place search using SMT with State Equation took 19747 ms to find 0 implicit places.
[2024-05-31 21:10:36] [INFO ] Redundant transitions in 115 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-31 21:10:36] [INFO ] Invariant cache hit.
[2024-05-31 21:10:36] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32253ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32284ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52229 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3511 edges and 1082 vertex of which 958 / 1082 are part of one of the 2 SCC in 0 ms
Free SCC test removed 956 places
Drop transitions (Empty/Sink Transition effects.) removed 2643 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3565 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.0 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 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 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 7 ms. Remains 4 /1082 variables (removed 1078) and now considering 5/3694 (removed 3689) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-31 21:11:08] [INFO ] Computed 0 invariants in 3 ms
[2024-05-31 21:11:08] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:11:08] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:11:08] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:11:08] [INFO ] After 17ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 64 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-10 in 167166 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-31 21:11:08] [INFO ] Computed 32 invariants in 51 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 83 ms. (119 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 21:11:08] [INFO ] Invariant cache hit.
[2024-05-31 21:11:09] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 21:11:09] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:11:09] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2024-05-31 21:11:09] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-31 21:11:10] [INFO ] [Real]Added 3582 Read/Feed constraints in 257 ms returned sat
[2024-05-31 21:11:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:11:10] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 21:11:10] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 21:11:10] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2024-05-31 21:11:11] [INFO ] [Nat]Added 3582 Read/Feed constraints in 303 ms returned sat
[2024-05-31 21:11:11] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 177 ms.
[2024-05-31 21:11:11] [INFO ] Added : 9 causal constraints over 2 iterations in 645 ms. Result :sat
Minimization took 975 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1084 transition count 3696
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1084 transition count 3695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1083 transition count 3695
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 1083 transition count 3695
Applied a total of 23 rules in 258 ms. Remains 1083 /1090 variables (removed 7) and now considering 3695/3702 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-31 21:11:13] [INFO ] Computed 32 invariants in 44 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7148 resets) in 7360 ms. (135 steps per ms)
BEST_FIRST walk for 1000001 steps (207 resets) in 1025 ms. (974 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 21:11:21] [INFO ] Invariant cache hit.
[2024-05-31 21:11:21] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-31 21:11:21] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:11:22] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2024-05-31 21:11:22] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 21:11:22] [INFO ] [Real]Added 3603 Read/Feed constraints in 259 ms returned sat
[2024-05-31 21:11:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:11:22] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 21:11:22] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-31 21:11:23] [INFO ] [Nat]Absence check using state equation in 617 ms returned sat
[2024-05-31 21:11:23] [INFO ] [Nat]Added 3603 Read/Feed constraints in 266 ms returned sat
[2024-05-31 21:11:23] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 176 ms.
[2024-05-31 21:11:24] [INFO ] Added : 7 causal constraints over 2 iterations in 654 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 78 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 69 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-31 21:11:29] [INFO ] Invariant cache hit.
[2024-05-31 21:11:29] [INFO ] Implicit Places using invariants in 875 ms returned []
[2024-05-31 21:11:29] [INFO ] Invariant cache hit.
[2024-05-31 21:11:30] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 21:11:49] [INFO ] Implicit Places using invariants and state equation in 19043 ms returned []
Implicit Place search using SMT with State Equation took 19919 ms to find 0 implicit places.
[2024-05-31 21:11:49] [INFO ] Redundant transitions in 117 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-31 21:11:49] [INFO ] Invariant cache hit.
[2024-05-31 21:11:49] [INFO ] State equation strengthened by 3603 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.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 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 timeout
0.0)
(s227 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32238ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32270ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52393 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (282 resets) in 416 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 194369 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 2
Probabilistic random walk after 194369 steps, saw 33917 distinct states, run finished after 3002 ms. (steps per millisecond=64 ) properties seen :0
[2024-05-31 21:12:24] [INFO ] Invariant cache hit.
[2024-05-31 21:12:24] [INFO ] State equation strengthened by 3603 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 21:12:24] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 21:12:25] [INFO ] Deduced a trap composed of 52 places in 670 ms of which 7 ms to minimize.
[2024-05-31 21:12:26] [INFO ] Deduced a trap composed of 39 places in 621 ms of which 7 ms to minimize.
[2024-05-31 21:12:26] [INFO ] Deduced a trap composed of 40 places in 567 ms of which 6 ms to minimize.
[2024-05-31 21:12:27] [INFO ] Deduced a trap composed of 37 places in 617 ms of which 6 ms to minimize.
[2024-05-31 21:12:28] [INFO ] Deduced a trap composed of 44 places in 580 ms of which 6 ms to minimize.
[2024-05-31 21:12:28] [INFO ] Deduced a trap composed of 37 places in 583 ms of which 6 ms to minimize.
[2024-05-31 21:12:29] [INFO ] Deduced a trap composed of 35 places in 580 ms of which 5 ms to minimize.
[2024-05-31 21:12:29] [INFO ] Deduced a trap composed of 38 places in 546 ms of which 6 ms to minimize.
SMT process timed out in 5222ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 69 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (285 resets) in 422 ms. (94 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 203747 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 1
Probabilistic random walk after 203747 steps, saw 35168 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-31 21:12:33] [INFO ] Invariant cache hit.
[2024-05-31 21:12:33] [INFO ] State equation strengthened by 3603 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:12:33] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:12:34] [INFO ] Deduced a trap composed of 38 places in 646 ms of which 7 ms to minimize.
[2024-05-31 21:12:34] [INFO ] Deduced a trap composed of 39 places in 598 ms of which 7 ms to minimize.
[2024-05-31 21:12:35] [INFO ] Deduced a trap composed of 38 places in 634 ms of which 6 ms to minimize.
[2024-05-31 21:12:35] [INFO ] Deduced a trap composed of 36 places in 604 ms of which 6 ms to minimize.
[2024-05-31 21:12:36] [INFO ] Deduced a trap composed of 47 places in 588 ms of which 6 ms to minimize.
[2024-05-31 21:12:37] [INFO ] Deduced a trap composed of 44 places in 577 ms of which 6 ms to minimize.
[2024-05-31 21:12:37] [INFO ] Deduced a trap composed of 44 places in 592 ms of which 6 ms to minimize.
[2024-05-31 21:12:38] [INFO ] Deduced a trap composed of 44 places in 581 ms of which 6 ms to minimize.
[2024-05-31 21:12:38] [INFO ] Deduced a trap composed of 38 places in 599 ms of which 7 ms to minimize.
[2024-05-31 21:12:39] [INFO ] Deduced a trap composed of 40 places in 586 ms of which 6 ms to minimize.
[2024-05-31 21:12:40] [INFO ] Deduced a trap composed of 39 places in 555 ms of which 6 ms to minimize.
[2024-05-31 21:12:40] [INFO ] Deduced a trap composed of 47 places in 538 ms of which 6 ms to minimize.
[2024-05-31 21:12:41] [INFO ] Deduced a trap composed of 35 places in 503 ms of which 5 ms to minimize.
[2024-05-31 21:12:41] [INFO ] Deduced a trap composed of 48 places in 506 ms of which 6 ms to minimize.
[2024-05-31 21:12:42] [INFO ] Deduced a trap composed of 44 places in 501 ms of which 6 ms to minimize.
[2024-05-31 21:12:42] [INFO ] Deduced a trap composed of 43 places in 511 ms of which 6 ms to minimize.
[2024-05-31 21:12:43] [INFO ] Deduced a trap composed of 45 places in 489 ms of which 5 ms to minimize.
[2024-05-31 21:12:43] [INFO ] Deduced a trap composed of 45 places in 489 ms of which 6 ms to minimize.
[2024-05-31 21:12:44] [INFO ] Deduced a trap composed of 48 places in 458 ms of which 4 ms to minimize.
[2024-05-31 21:12:44] [INFO ] Deduced a trap composed of 44 places in 461 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:12:45] [INFO ] Deduced a trap composed of 46 places in 456 ms of which 5 ms to minimize.
[2024-05-31 21:12:45] [INFO ] Deduced a trap composed of 46 places in 467 ms of which 5 ms to minimize.
[2024-05-31 21:12:46] [INFO ] Deduced a trap composed of 47 places in 446 ms of which 5 ms to minimize.
[2024-05-31 21:12:46] [INFO ] Deduced a trap composed of 45 places in 451 ms of which 5 ms to minimize.
[2024-05-31 21:12:47] [INFO ] Deduced a trap composed of 46 places in 446 ms of which 4 ms to minimize.
[2024-05-31 21:12:47] [INFO ] Deduced a trap composed of 45 places in 441 ms of which 4 ms to minimize.
[2024-05-31 21:12:48] [INFO ] Deduced a trap composed of 48 places in 439 ms of which 4 ms to minimize.
[2024-05-31 21:12:48] [INFO ] Deduced a trap composed of 45 places in 433 ms of which 5 ms to minimize.
[2024-05-31 21:12:48] [INFO ] Deduced a trap composed of 45 places in 408 ms of which 5 ms to minimize.
[2024-05-31 21:12:49] [INFO ] Deduced a trap composed of 45 places in 408 ms of which 5 ms to minimize.
[2024-05-31 21:12:49] [INFO ] Deduced a trap composed of 43 places in 423 ms of which 5 ms to minimize.
[2024-05-31 21:12:50] [INFO ] Deduced a trap composed of 45 places in 399 ms of which 4 ms to minimize.
[2024-05-31 21:12:50] [INFO ] Deduced a trap composed of 35 places in 360 ms of which 4 ms to minimize.
[2024-05-31 21:12:50] [INFO ] Deduced a trap composed of 43 places in 340 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 14/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3695/4776 variables, 1081/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 3603/4751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 0/4751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4778 variables, 2/4753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4778 variables, 0/4753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4778 variables, 0/4753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4753 constraints, problems are : Problem set: 0 solved, 1 unsolved in 19070 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 35/35 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:12:52] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:12:52] [INFO ] Deduced a trap composed of 35 places in 377 ms of which 4 ms to minimize.
[2024-05-31 21:12:53] [INFO ] Deduced a trap composed of 44 places in 348 ms of which 5 ms to minimize.
[2024-05-31 21:12:53] [INFO ] Deduced a trap composed of 35 places in 301 ms of which 4 ms to minimize.
[2024-05-31 21:12:53] [INFO ] Deduced a trap composed of 37 places in 300 ms of which 4 ms to minimize.
[2024-05-31 21:12:54] [INFO ] Deduced a trap composed of 41 places in 275 ms of which 3 ms to minimize.
[2024-05-31 21:12:54] [INFO ] Deduced a trap composed of 49 places in 272 ms of which 3 ms to minimize.
[2024-05-31 21:12:54] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 4 ms to minimize.
[2024-05-31 21:12:54] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 3 ms to minimize.
[2024-05-31 21:12:55] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 3 ms to minimize.
[2024-05-31 21:12:55] [INFO ] Deduced a trap composed of 46 places in 218 ms of which 3 ms to minimize.
[2024-05-31 21:12:55] [INFO ] Deduced a trap composed of 39 places in 215 ms of which 3 ms to minimize.
[2024-05-31 21:12:55] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 3 ms to minimize.
[2024-05-31 21:12:56] [INFO ] Deduced a trap composed of 45 places in 207 ms of which 3 ms to minimize.
[2024-05-31 21:12:56] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 3 ms to minimize.
[2024-05-31 21:12:56] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 3 ms to minimize.
[2024-05-31 21:12:56] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 2 ms to minimize.
[2024-05-31 21:12:56] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 2 ms to minimize.
[2024-05-31 21:12:56] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 1 ms to minimize.
[2024-05-31 21:12:57] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-05-31 21:12:57] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:12:57] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-05-31 21:12:57] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-05-31 21:12:57] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-05-31 21:12:57] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-05-31 21:12:57] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2024-05-31 21:12:57] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-05-31 21:12:57] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 7/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1081 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3695/4776 variables, 1081/1176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 3603/4779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 1/4780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4776 variables, 0/4780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/4778 variables, 2/4782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4778 variables, 0/4782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/4778 variables, 0/4782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4778/4778 variables, and 4782 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8203 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 63/63 constraints]
After SMT, in 27318ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 68 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 68 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-31 21:13:00] [INFO ] Invariant cache hit.
[2024-05-31 21:13:01] [INFO ] Implicit Places using invariants in 898 ms returned []
[2024-05-31 21:13:01] [INFO ] Invariant cache hit.
[2024-05-31 21:13:02] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 21:13:21] [INFO ] Implicit Places using invariants and state equation in 19744 ms returned []
Implicit Place search using SMT with State Equation took 20645 ms to find 0 implicit places.
[2024-05-31 21:13:21] [INFO ] Redundant transitions in 124 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-31 21:13:21] [INFO ] Invariant cache hit.
[2024-05-31 21:13:21] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32300ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32329ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53178 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3512 edges and 1083 vertex of which 959 / 1083 are part of one of the 2 SCC in 1 ms
Free SCC test removed 957 places
Drop transitions (Empty/Sink Transition effects.) removed 2644 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3566 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.1 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 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 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 7 ms. Remains 4 /1083 variables (removed 1079) and now considering 5/3695 (removed 3690) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-31 21:13:53] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 21:13:53] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:13:53] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:13:53] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:13:53] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 52 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-11 in 165010 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-12
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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-31 21:13:53] [INFO ] Computed 32 invariants in 51 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 80 ms. (123 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 21:13:53] [INFO ] Invariant cache hit.
[2024-05-31 21:13:54] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 21:13:54] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:13:54] [INFO ] [Real]Absence check using state equation in 645 ms returned sat
[2024-05-31 21:13:54] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-31 21:13:55] [INFO ] [Real]Added 3582 Read/Feed constraints in 281 ms returned sat
[2024-05-31 21:13:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:13:55] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 21:13:55] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:13:55] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2024-05-31 21:13:56] [INFO ] [Nat]Added 3582 Read/Feed constraints in 302 ms returned sat
[2024-05-31 21:13:56] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 178 ms.
[2024-05-31 21:13:56] [INFO ] Added : 10 causal constraints over 2 iterations in 649 ms. Result :sat
Minimization took 948 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1084 transition count 3696
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1084 transition count 3695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1083 transition count 3695
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 1083 transition count 3695
Applied a total of 23 rules in 251 ms. Remains 1083 /1090 variables (removed 7) and now considering 3695/3702 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-31 21:13:58] [INFO ] Computed 32 invariants in 44 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7150 resets) in 7144 ms. (139 steps per ms)
BEST_FIRST walk for 1000001 steps (207 resets) in 988 ms. (1011 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 21:14:06] [INFO ] Invariant cache hit.
[2024-05-31 21:14:06] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-31 21:14:06] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-31 21:14:07] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2024-05-31 21:14:07] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 21:14:07] [INFO ] [Real]Added 3603 Read/Feed constraints in 252 ms returned sat
[2024-05-31 21:14:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:14:07] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-31 21:14:07] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:14:08] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2024-05-31 21:14:08] [INFO ] [Nat]Added 3603 Read/Feed constraints in 273 ms returned sat
[2024-05-31 21:14:08] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 172 ms.
[2024-05-31 21:14:09] [INFO ] Added : 7 causal constraints over 2 iterations in 627 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 74 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 66 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-31 21:14:13] [INFO ] Invariant cache hit.
[2024-05-31 21:14:14] [INFO ] Implicit Places using invariants in 881 ms returned []
[2024-05-31 21:14:14] [INFO ] Invariant cache hit.
[2024-05-31 21:14:15] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 21:14:32] [INFO ] Implicit Places using invariants and state equation in 17447 ms returned []
Implicit Place search using SMT with State Equation took 18330 ms to find 0 implicit places.
[2024-05-31 21:14:32] [INFO ] Redundant transitions in 110 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-31 21:14:32] [INFO ] Invariant cache hit.
[2024-05-31 21:14:32] [INFO ] State equation strengthened by 3603 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.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 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 1.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 1.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 1.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 1.0)
(s529 1.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32253ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32281ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50801 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (284 resets) in 367 ms. (108 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 191126 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 2
Probabilistic random walk after 191126 steps, saw 33451 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-31 21:15:07] [INFO ] Invariant cache hit.
[2024-05-31 21:15:07] [INFO ] State equation strengthened by 3603 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 21:15:07] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 21:15:08] [INFO ] Deduced a trap composed of 47 places in 624 ms of which 6 ms to minimize.
[2024-05-31 21:15:09] [INFO ] Deduced a trap composed of 41 places in 593 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3695/4776 variables, 1081/1116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4776 variables, 3603/4719 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 0/4719 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4778 variables, 2/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4778 variables, 0/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4778 variables, 0/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4721 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2769 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 21:15:10] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 2/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 21:15:11] [INFO ] Deduced a trap composed of 41 places in 630 ms of which 6 ms to minimize.
[2024-05-31 21:15:12] [INFO ] Deduced a trap composed of 38 places in 602 ms of which 6 ms to minimize.
[2024-05-31 21:15:12] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 3/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3695/4776 variables, 1081/1120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4776/4778 variables, and 4723 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3371 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1081/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 6186ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 76 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (284 resets) in 352 ms. (113 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 206487 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 1
Probabilistic random walk after 206487 steps, saw 35487 distinct states, run finished after 3003 ms. (steps per millisecond=68 ) properties seen :0
[2024-05-31 21:15:17] [INFO ] Invariant cache hit.
[2024-05-31 21:15:17] [INFO ] State equation strengthened by 3603 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:15:17] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:15:18] [INFO ] Deduced a trap composed of 59 places in 649 ms of which 6 ms to minimize.
[2024-05-31 21:15:18] [INFO ] Deduced a trap composed of 62 places in 696 ms of which 7 ms to minimize.
[2024-05-31 21:15:19] [INFO ] Deduced a trap composed of 43 places in 663 ms of which 6 ms to minimize.
[2024-05-31 21:15:20] [INFO ] Deduced a trap composed of 44 places in 613 ms of which 6 ms to minimize.
[2024-05-31 21:15:20] [INFO ] Deduced a trap composed of 43 places in 615 ms of which 6 ms to minimize.
[2024-05-31 21:15:21] [INFO ] Deduced a trap composed of 44 places in 658 ms of which 11 ms to minimize.
[2024-05-31 21:15:21] [INFO ] Deduced a trap composed of 44 places in 568 ms of which 6 ms to minimize.
[2024-05-31 21:15:22] [INFO ] Deduced a trap composed of 45 places in 561 ms of which 6 ms to minimize.
[2024-05-31 21:15:23] [INFO ] Deduced a trap composed of 42 places in 572 ms of which 6 ms to minimize.
[2024-05-31 21:15:23] [INFO ] Deduced a trap composed of 38 places in 579 ms of which 6 ms to minimize.
[2024-05-31 21:15:24] [INFO ] Deduced a trap composed of 39 places in 570 ms of which 6 ms to minimize.
[2024-05-31 21:15:24] [INFO ] Deduced a trap composed of 47 places in 590 ms of which 6 ms to minimize.
[2024-05-31 21:15:25] [INFO ] Deduced a trap composed of 43 places in 561 ms of which 6 ms to minimize.
[2024-05-31 21:15:26] [INFO ] Deduced a trap composed of 36 places in 546 ms of which 6 ms to minimize.
[2024-05-31 21:15:26] [INFO ] Deduced a trap composed of 43 places in 559 ms of which 5 ms to minimize.
[2024-05-31 21:15:27] [INFO ] Deduced a trap composed of 35 places in 537 ms of which 6 ms to minimize.
[2024-05-31 21:15:27] [INFO ] Deduced a trap composed of 43 places in 518 ms of which 5 ms to minimize.
[2024-05-31 21:15:28] [INFO ] Deduced a trap composed of 41 places in 522 ms of which 6 ms to minimize.
[2024-05-31 21:15:28] [INFO ] Deduced a trap composed of 41 places in 464 ms of which 6 ms to minimize.
[2024-05-31 21:15:29] [INFO ] Deduced a trap composed of 40 places in 517 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:15:29] [INFO ] Deduced a trap composed of 40 places in 527 ms of which 5 ms to minimize.
[2024-05-31 21:15:30] [INFO ] Deduced a trap composed of 35 places in 445 ms of which 5 ms to minimize.
[2024-05-31 21:15:30] [INFO ] Deduced a trap composed of 52 places in 443 ms of which 5 ms to minimize.
[2024-05-31 21:15:31] [INFO ] Deduced a trap composed of 49 places in 449 ms of which 4 ms to minimize.
[2024-05-31 21:15:31] [INFO ] Deduced a trap composed of 48 places in 427 ms of which 5 ms to minimize.
[2024-05-31 21:15:32] [INFO ] Deduced a trap composed of 35 places in 392 ms of which 4 ms to minimize.
[2024-05-31 21:15:32] [INFO ] Deduced a trap composed of 46 places in 408 ms of which 5 ms to minimize.
[2024-05-31 21:15:33] [INFO ] Deduced a trap composed of 44 places in 443 ms of which 4 ms to minimize.
[2024-05-31 21:15:33] [INFO ] Deduced a trap composed of 45 places in 373 ms of which 4 ms to minimize.
[2024-05-31 21:15:33] [INFO ] Deduced a trap composed of 46 places in 361 ms of which 4 ms to minimize.
[2024-05-31 21:15:34] [INFO ] Deduced a trap composed of 48 places in 343 ms of which 4 ms to minimize.
[2024-05-31 21:15:34] [INFO ] Deduced a trap composed of 50 places in 341 ms of which 4 ms to minimize.
[2024-05-31 21:15:34] [INFO ] Deduced a trap composed of 45 places in 317 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3695/4776 variables, 1081/1147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 3603/4750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 0/4750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4778 variables, 2/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4778 variables, 0/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4778 variables, 0/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4752 constraints, problems are : Problem set: 0 solved, 1 unsolved in 18949 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 34/34 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:15:36] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 33/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:15:36] [INFO ] Deduced a trap composed of 41 places in 630 ms of which 7 ms to minimize.
[2024-05-31 21:15:37] [INFO ] Deduced a trap composed of 41 places in 611 ms of which 6 ms to minimize.
[2024-05-31 21:15:38] [INFO ] Deduced a trap composed of 38 places in 586 ms of which 6 ms to minimize.
[2024-05-31 21:15:38] [INFO ] Deduced a trap composed of 43 places in 567 ms of which 6 ms to minimize.
[2024-05-31 21:15:39] [INFO ] Deduced a trap composed of 34 places in 528 ms of which 5 ms to minimize.
[2024-05-31 21:15:39] [INFO ] Deduced a trap composed of 40 places in 519 ms of which 5 ms to minimize.
[2024-05-31 21:15:40] [INFO ] Deduced a trap composed of 41 places in 509 ms of which 5 ms to minimize.
[2024-05-31 21:15:40] [INFO ] Deduced a trap composed of 42 places in 485 ms of which 6 ms to minimize.
[2024-05-31 21:15:41] [INFO ] Deduced a trap composed of 42 places in 494 ms of which 5 ms to minimize.
[2024-05-31 21:15:41] [INFO ] Deduced a trap composed of 42 places in 483 ms of which 6 ms to minimize.
[2024-05-31 21:15:42] [INFO ] Deduced a trap composed of 39 places in 504 ms of which 6 ms to minimize.
[2024-05-31 21:15:42] [INFO ] Deduced a trap composed of 39 places in 480 ms of which 5 ms to minimize.
[2024-05-31 21:15:43] [INFO ] Deduced a trap composed of 41 places in 491 ms of which 5 ms to minimize.
[2024-05-31 21:15:43] [INFO ] Deduced a trap composed of 38 places in 480 ms of which 5 ms to minimize.
[2024-05-31 21:15:44] [INFO ] Deduced a trap composed of 38 places in 485 ms of which 5 ms to minimize.
[2024-05-31 21:15:44] [INFO ] Deduced a trap composed of 37 places in 472 ms of which 5 ms to minimize.
[2024-05-31 21:15:45] [INFO ] Deduced a trap composed of 42 places in 508 ms of which 5 ms to minimize.
[2024-05-31 21:15:45] [INFO ] Deduced a trap composed of 41 places in 484 ms of which 5 ms to minimize.
[2024-05-31 21:15:46] [INFO ] Deduced a trap composed of 37 places in 487 ms of which 5 ms to minimize.
[2024-05-31 21:15:47] [INFO ] Deduced a trap composed of 38 places in 504 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:15:47] [INFO ] Deduced a trap composed of 40 places in 498 ms of which 5 ms to minimize.
[2024-05-31 21:15:48] [INFO ] Deduced a trap composed of 39 places in 486 ms of which 5 ms to minimize.
[2024-05-31 21:15:48] [INFO ] Deduced a trap composed of 41 places in 497 ms of which 5 ms to minimize.
[2024-05-31 21:15:49] [INFO ] Deduced a trap composed of 37 places in 480 ms of which 5 ms to minimize.
[2024-05-31 21:15:49] [INFO ] Deduced a trap composed of 37 places in 474 ms of which 5 ms to minimize.
[2024-05-31 21:15:50] [INFO ] Deduced a trap composed of 36 places in 468 ms of which 4 ms to minimize.
[2024-05-31 21:15:50] [INFO ] Deduced a trap composed of 39 places in 468 ms of which 5 ms to minimize.
[2024-05-31 21:15:50] [INFO ] Deduced a trap composed of 38 places in 468 ms of which 5 ms to minimize.
[2024-05-31 21:15:51] [INFO ] Deduced a trap composed of 37 places in 492 ms of which 5 ms to minimize.
[2024-05-31 21:15:51] [INFO ] Deduced a trap composed of 41 places in 442 ms of which 5 ms to minimize.
[2024-05-31 21:15:52] [INFO ] Deduced a trap composed of 50 places in 455 ms of which 5 ms to minimize.
[2024-05-31 21:15:52] [INFO ] Deduced a trap composed of 45 places in 435 ms of which 5 ms to minimize.
[2024-05-31 21:15:53] [INFO ] Deduced a trap composed of 47 places in 454 ms of which 5 ms to minimize.
[2024-05-31 21:15:53] [INFO ] Deduced a trap composed of 43 places in 433 ms of which 4 ms to minimize.
[2024-05-31 21:15:54] [INFO ] Deduced a trap composed of 44 places in 486 ms of which 5 ms to minimize.
[2024-05-31 21:15:54] [INFO ] Deduced a trap composed of 46 places in 460 ms of which 5 ms to minimize.
[2024-05-31 21:15:55] [INFO ] Deduced a trap composed of 42 places in 481 ms of which 5 ms to minimize.
[2024-05-31 21:15:55] [INFO ] Deduced a trap composed of 42 places in 490 ms of which 5 ms to minimize.
[2024-05-31 21:15:56] [INFO ] Deduced a trap composed of 46 places in 472 ms of which 6 ms to minimize.
[2024-05-31 21:15:56] [INFO ] Deduced a trap composed of 47 places in 477 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:15:57] [INFO ] Deduced a trap composed of 43 places in 495 ms of which 5 ms to minimize.
[2024-05-31 21:15:57] [INFO ] Deduced a trap composed of 35 places in 473 ms of which 5 ms to minimize.
[2024-05-31 21:15:58] [INFO ] Deduced a trap composed of 35 places in 413 ms of which 5 ms to minimize.
[2024-05-31 21:15:58] [INFO ] Deduced a trap composed of 44 places in 397 ms of which 4 ms to minimize.
[2024-05-31 21:15:59] [INFO ] Deduced a trap composed of 44 places in 393 ms of which 4 ms to minimize.
[2024-05-31 21:15:59] [INFO ] Deduced a trap composed of 42 places in 402 ms of which 4 ms to minimize.
[2024-05-31 21:15:59] [INFO ] Deduced a trap composed of 38 places in 386 ms of which 5 ms to minimize.
[2024-05-31 21:16:00] [INFO ] Deduced a trap composed of 45 places in 385 ms of which 4 ms to minimize.
[2024-05-31 21:16:00] [INFO ] Deduced a trap composed of 45 places in 397 ms of which 4 ms to minimize.
[2024-05-31 21:16:01] [INFO ] Deduced a trap composed of 45 places in 401 ms of which 5 ms to minimize.
[2024-05-31 21:16:01] [INFO ] Deduced a trap composed of 43 places in 370 ms of which 4 ms to minimize.
[2024-05-31 21:16:01] [INFO ] Deduced a trap composed of 46 places in 390 ms of which 4 ms to minimize.
[2024-05-31 21:16:02] [INFO ] Deduced a trap composed of 40 places in 330 ms of which 4 ms to minimize.
[2024-05-31 21:16:02] [INFO ] Deduced a trap composed of 35 places in 334 ms of which 4 ms to minimize.
[2024-05-31 21:16:02] [INFO ] Deduced a trap composed of 35 places in 296 ms of which 4 ms to minimize.
[2024-05-31 21:16:03] [INFO ] Deduced a trap composed of 47 places in 291 ms of which 3 ms to minimize.
[2024-05-31 21:16:03] [INFO ] Deduced a trap composed of 47 places in 294 ms of which 4 ms to minimize.
[2024-05-31 21:16:03] [INFO ] Deduced a trap composed of 44 places in 285 ms of which 4 ms to minimize.
[2024-05-31 21:16:04] [INFO ] Deduced a trap composed of 47 places in 286 ms of which 3 ms to minimize.
[2024-05-31 21:16:04] [INFO ] Deduced a trap composed of 47 places in 296 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1081 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:16:04] [INFO ] Deduced a trap composed of 46 places in 290 ms of which 4 ms to minimize.
[2024-05-31 21:16:05] [INFO ] Deduced a trap composed of 44 places in 340 ms of which 4 ms to minimize.
[2024-05-31 21:16:05] [INFO ] Deduced a trap composed of 39 places in 317 ms of which 4 ms to minimize.
[2024-05-31 21:16:05] [INFO ] Deduced a trap composed of 40 places in 311 ms of which 4 ms to minimize.
[2024-05-31 21:16:06] [INFO ] Deduced a trap composed of 40 places in 299 ms of which 4 ms to minimize.
[2024-05-31 21:16:06] [INFO ] Deduced a trap composed of 40 places in 308 ms of which 4 ms to minimize.
[2024-05-31 21:16:06] [INFO ] Deduced a trap composed of 41 places in 290 ms of which 4 ms to minimize.
[2024-05-31 21:16:07] [INFO ] Deduced a trap composed of 37 places in 260 ms of which 4 ms to minimize.
[2024-05-31 21:16:07] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 3 ms to minimize.
[2024-05-31 21:16:07] [INFO ] Deduced a trap composed of 35 places in 248 ms of which 3 ms to minimize.
[2024-05-31 21:16:07] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 3 ms to minimize.
[2024-05-31 21:16:08] [INFO ] Deduced a trap composed of 44 places in 235 ms of which 4 ms to minimize.
[2024-05-31 21:16:08] [INFO ] Deduced a trap composed of 45 places in 213 ms of which 3 ms to minimize.
[2024-05-31 21:16:08] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 3 ms to minimize.
[2024-05-31 21:16:08] [INFO ] Deduced a trap composed of 45 places in 208 ms of which 3 ms to minimize.
[2024-05-31 21:16:09] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 3 ms to minimize.
[2024-05-31 21:16:09] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 4 ms to minimize.
[2024-05-31 21:16:09] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 3 ms to minimize.
[2024-05-31 21:16:09] [INFO ] Deduced a trap composed of 46 places in 179 ms of which 3 ms to minimize.
[2024-05-31 21:16:09] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1081 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:16:10] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 3 ms to minimize.
[2024-05-31 21:16:10] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 2 ms to minimize.
[2024-05-31 21:16:10] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 2 ms to minimize.
[2024-05-31 21:16:10] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 2 ms to minimize.
[2024-05-31 21:16:10] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 2 ms to minimize.
[2024-05-31 21:16:10] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 2 ms to minimize.
[2024-05-31 21:16:10] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 2 ms to minimize.
[2024-05-31 21:16:11] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
[2024-05-31 21:16:11] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2024-05-31 21:16:11] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-05-31 21:16:11] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-05-31 21:16:11] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1081 variables, 12/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1081 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3695/4776 variables, 1081/1240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4776 variables, 3603/4843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4776 variables, 1/4844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4776 variables, 0/4844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/4778 variables, 2/4846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4778 variables, 0/4846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/4778 variables, 0/4846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4778/4778 variables, and 4846 constraints, problems are : Problem set: 0 solved, 1 unsolved in 37806 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 127/127 constraints]
After SMT, in 56805ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 68 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 66 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-31 21:16:14] [INFO ] Invariant cache hit.
[2024-05-31 21:16:14] [INFO ] Implicit Places using invariants in 899 ms returned []
[2024-05-31 21:16:14] [INFO ] Invariant cache hit.
[2024-05-31 21:16:15] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 21:16:33] [INFO ] Implicit Places using invariants and state equation in 18888 ms returned []
Implicit Place search using SMT with State Equation took 19789 ms to find 0 implicit places.
[2024-05-31 21:16:33] [INFO ] Redundant transitions in 113 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-31 21:16:33] [INFO ] Invariant cache hit.
[2024-05-31 21:16:34] [INFO ] State equation strengthened by 3603 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32209ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32238ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52226 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-12 in 192421 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-31 21:17:06] [INFO ] Computed 32 invariants in 52 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (70 resets) in 81 ms. (121 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 21:17:06] [INFO ] Invariant cache hit.
[2024-05-31 21:17:06] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-31 21:17:06] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 21:17:07] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2024-05-31 21:17:07] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-31 21:17:07] [INFO ] [Real]Added 3582 Read/Feed constraints in 245 ms returned sat
[2024-05-31 21:17:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:17:07] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 21:17:07] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 21:17:08] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2024-05-31 21:17:08] [INFO ] [Nat]Added 3582 Read/Feed constraints in 259 ms returned sat
[2024-05-31 21:17:08] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 168 ms.
[2024-05-31 21:17:09] [INFO ] Added : 8 causal constraints over 2 iterations in 626 ms. Result :sat
Minimization took 932 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1084 transition count 3696
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1084 transition count 3695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1083 transition count 3695
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 1083 transition count 3695
Applied a total of 23 rules in 247 ms. Remains 1083 /1090 variables (removed 7) and now considering 3695/3702 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-31 21:17:10] [INFO ] Computed 32 invariants in 41 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7147 resets) in 7126 ms. (140 steps per ms)
BEST_FIRST walk for 1000001 steps (205 resets) in 994 ms. (1005 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 21:17:18] [INFO ] Invariant cache hit.
[2024-05-31 21:17:18] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-31 21:17:18] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:17:19] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2024-05-31 21:17:19] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 21:17:19] [INFO ] [Real]Added 3603 Read/Feed constraints in 252 ms returned sat
[2024-05-31 21:17:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:17:19] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-31 21:17:19] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:17:20] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2024-05-31 21:17:20] [INFO ] [Nat]Added 3603 Read/Feed constraints in 282 ms returned sat
[2024-05-31 21:17:20] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 181 ms.
[2024-05-31 21:17:21] [INFO ] Added : 8 causal constraints over 2 iterations in 658 ms. Result :sat
Minimization took 4511 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 67 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 65 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-31 21:17:26] [INFO ] Invariant cache hit.
[2024-05-31 21:17:26] [INFO ] Implicit Places using invariants in 865 ms returned []
[2024-05-31 21:17:26] [INFO ] Invariant cache hit.
[2024-05-31 21:17:27] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 21:17:45] [INFO ] Implicit Places using invariants and state equation in 18784 ms returned []
Implicit Place search using SMT with State Equation took 19652 ms to find 0 implicit places.
[2024-05-31 21:17:45] [INFO ] Redundant transitions in 113 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-31 21:17:45] [INFO ] Invariant cache hit.
[2024-05-31 21:17:45] [INFO ] State equation strengthened by 3603 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32194ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32223ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52068 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (286 resets) in 416 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 183267 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 183267 steps, saw 32673 distinct states, run finished after 3002 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-31 21:18:21] [INFO ] Invariant cache hit.
[2024-05-31 21:18:21] [INFO ] State equation strengthened by 3603 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 21:18:21] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 21:18:22] [INFO ] Deduced a trap composed of 52 places in 678 ms of which 7 ms to minimize.
[2024-05-31 21:18:22] [INFO ] Deduced a trap composed of 37 places in 633 ms of which 6 ms to minimize.
[2024-05-31 21:18:23] [INFO ] Deduced a trap composed of 40 places in 633 ms of which 6 ms to minimize.
[2024-05-31 21:18:24] [INFO ] Deduced a trap composed of 36 places in 596 ms of which 6 ms to minimize.
[2024-05-31 21:18:24] [INFO ] Deduced a trap composed of 35 places in 573 ms of which 6 ms to minimize.
[2024-05-31 21:18:25] [INFO ] Deduced a trap composed of 37 places in 540 ms of which 5 ms to minimize.
[2024-05-31 21:18:25] [INFO ] Deduced a trap composed of 37 places in 578 ms of which 6 ms to minimize.
[2024-05-31 21:18:26] [INFO ] Deduced a trap composed of 42 places in 553 ms of which 5 ms to minimize.
SMT process timed out in 5282ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 67 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (282 resets) in 341 ms. (116 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 197753 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 1
Probabilistic random walk after 197753 steps, saw 34390 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
[2024-05-31 21:18:29] [INFO ] Invariant cache hit.
[2024-05-31 21:18:29] [INFO ] State equation strengthened by 3603 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:18:29] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:18:30] [INFO ] Deduced a trap composed of 38 places in 630 ms of which 7 ms to minimize.
[2024-05-31 21:18:31] [INFO ] Deduced a trap composed of 39 places in 663 ms of which 6 ms to minimize.
[2024-05-31 21:18:32] [INFO ] Deduced a trap composed of 38 places in 646 ms of which 7 ms to minimize.
[2024-05-31 21:18:32] [INFO ] Deduced a trap composed of 36 places in 568 ms of which 6 ms to minimize.
[2024-05-31 21:18:33] [INFO ] Deduced a trap composed of 47 places in 580 ms of which 6 ms to minimize.
[2024-05-31 21:18:33] [INFO ] Deduced a trap composed of 44 places in 575 ms of which 6 ms to minimize.
[2024-05-31 21:18:34] [INFO ] Deduced a trap composed of 40 places in 610 ms of which 8 ms to minimize.
[2024-05-31 21:18:35] [INFO ] Deduced a trap composed of 39 places in 611 ms of which 6 ms to minimize.
[2024-05-31 21:18:35] [INFO ] Deduced a trap composed of 41 places in 600 ms of which 6 ms to minimize.
[2024-05-31 21:18:36] [INFO ] Deduced a trap composed of 43 places in 596 ms of which 6 ms to minimize.
[2024-05-31 21:18:36] [INFO ] Deduced a trap composed of 39 places in 559 ms of which 6 ms to minimize.
[2024-05-31 21:18:37] [INFO ] Deduced a trap composed of 43 places in 537 ms of which 5 ms to minimize.
[2024-05-31 21:18:38] [INFO ] Deduced a trap composed of 43 places in 529 ms of which 6 ms to minimize.
[2024-05-31 21:18:38] [INFO ] Deduced a trap composed of 41 places in 528 ms of which 6 ms to minimize.
[2024-05-31 21:18:39] [INFO ] Deduced a trap composed of 42 places in 554 ms of which 5 ms to minimize.
[2024-05-31 21:18:39] [INFO ] Deduced a trap composed of 40 places in 536 ms of which 5 ms to minimize.
[2024-05-31 21:18:40] [INFO ] Deduced a trap composed of 35 places in 478 ms of which 5 ms to minimize.
[2024-05-31 21:18:40] [INFO ] Deduced a trap composed of 37 places in 447 ms of which 5 ms to minimize.
[2024-05-31 21:18:41] [INFO ] Deduced a trap composed of 36 places in 451 ms of which 5 ms to minimize.
[2024-05-31 21:18:41] [INFO ] Deduced a trap composed of 35 places in 436 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:18:42] [INFO ] Deduced a trap composed of 46 places in 430 ms of which 5 ms to minimize.
[2024-05-31 21:18:42] [INFO ] Deduced a trap composed of 35 places in 380 ms of which 4 ms to minimize.
[2024-05-31 21:18:42] [INFO ] Deduced a trap composed of 35 places in 355 ms of which 4 ms to minimize.
[2024-05-31 21:18:43] [INFO ] Deduced a trap composed of 41 places in 332 ms of which 4 ms to minimize.
[2024-05-31 21:18:43] [INFO ] Deduced a trap composed of 40 places in 339 ms of which 4 ms to minimize.
[2024-05-31 21:18:43] [INFO ] Deduced a trap composed of 44 places in 310 ms of which 4 ms to minimize.
[2024-05-31 21:18:44] [INFO ] Deduced a trap composed of 45 places in 311 ms of which 4 ms to minimize.
[2024-05-31 21:18:44] [INFO ] Deduced a trap composed of 42 places in 307 ms of which 4 ms to minimize.
[2024-05-31 21:18:44] [INFO ] Deduced a trap composed of 43 places in 311 ms of which 4 ms to minimize.
[2024-05-31 21:18:45] [INFO ] Deduced a trap composed of 43 places in 323 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3695/4776 variables, 1081/1144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 3603/4747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 0/4747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4778 variables, 2/4749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4778 variables, 0/4749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4778 variables, 0/4749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4749 constraints, problems are : Problem set: 0 solved, 1 unsolved in 16689 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 31/31 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:18:46] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 30/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:18:47] [INFO ] Deduced a trap composed of 38 places in 624 ms of which 6 ms to minimize.
[2024-05-31 21:18:48] [INFO ] Deduced a trap composed of 37 places in 652 ms of which 6 ms to minimize.
[2024-05-31 21:18:48] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2024-05-31 21:18:48] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3695/4776 variables, 1081/1149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 3603/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 1/4753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4778 variables, 2/4755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4778 variables, 0/4755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4778 variables, 0/4755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4778/4778 variables, and 4755 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3638 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 36/36 constraints]
After SMT, in 20369ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 91 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 98 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 74 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-31 21:18:50] [INFO ] Invariant cache hit.
[2024-05-31 21:18:51] [INFO ] Implicit Places using invariants in 926 ms returned []
[2024-05-31 21:18:51] [INFO ] Invariant cache hit.
[2024-05-31 21:18:52] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 21:19:09] [INFO ] Implicit Places using invariants and state equation in 18086 ms returned []
Implicit Place search using SMT with State Equation took 19016 ms to find 0 implicit places.
[2024-05-31 21:19:09] [INFO ] Redundant transitions in 112 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-31 21:19:09] [INFO ] Invariant cache hit.
[2024-05-31 21:19:09] [INFO ] State equation strengthened by 3603 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32157ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32186ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51399 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3512 edges and 1083 vertex of which 959 / 1083 are part of one of the 2 SCC in 1 ms
Free SCC test removed 957 places
Drop transitions (Empty/Sink Transition effects.) removed 2644 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3566 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.0 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 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 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 8 ms. Remains 4 /1083 variables (removed 1079) and now considering 5/3695 (removed 3690) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-31 21:19:41] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 21:19:41] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:19:41] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:19:41] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:19:41] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 55 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-13 in 155540 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-31 21:19:41] [INFO ] Computed 32 invariants in 51 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (72 resets) in 78 ms. (126 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 21:19:41] [INFO ] Invariant cache hit.
[2024-05-31 21:19:42] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 21:19:42] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:19:42] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2024-05-31 21:19:42] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-31 21:19:42] [INFO ] [Real]Added 3582 Read/Feed constraints in 285 ms returned sat
[2024-05-31 21:19:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:19:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-31 21:19:43] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:19:43] [INFO ] [Nat]Absence check using state equation in 606 ms returned sat
[2024-05-31 21:19:44] [INFO ] [Nat]Added 3582 Read/Feed constraints in 367 ms returned sat
[2024-05-31 21:19:44] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 170 ms.
[2024-05-31 21:19:44] [INFO ] Added : 9 causal constraints over 2 iterations in 642 ms. Result :sat
Minimization took 957 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1083 transition count 3695
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 1083 transition count 3694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 1082 transition count 3694
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 1082 transition count 3694
Applied a total of 24 rules in 252 ms. Remains 1082 /1090 variables (removed 8) and now considering 3694/3702 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 1082/1090 places, 3694/3702 transitions.
// Phase 1: matrix 3694 rows 1082 cols
[2024-05-31 21:19:46] [INFO ] Computed 32 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7140 resets) in 7126 ms. (140 steps per ms)
BEST_FIRST walk for 1000001 steps (206 resets) in 980 ms. (1019 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 21:19:54] [INFO ] Invariant cache hit.
[2024-05-31 21:19:54] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 21:19:54] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:19:55] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2024-05-31 21:19:55] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-31 21:19:55] [INFO ] [Real]Added 3604 Read/Feed constraints in 238 ms returned sat
[2024-05-31 21:19:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:19:55] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 21:19:55] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:19:56] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2024-05-31 21:19:56] [INFO ] [Nat]Added 3604 Read/Feed constraints in 365 ms returned sat
[2024-05-31 21:19:56] [INFO ] Computed and/alt/rep : 2620/6956/2620 causal constraints (skipped 1044 transitions) in 177 ms.
[2024-05-31 21:19:57] [INFO ] Added : 13 causal constraints over 3 iterations in 775 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 73 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 66 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-31 21:20:02] [INFO ] Invariant cache hit.
[2024-05-31 21:20:02] [INFO ] Implicit Places using invariants in 872 ms returned []
[2024-05-31 21:20:02] [INFO ] Invariant cache hit.
[2024-05-31 21:20:03] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-31 21:20:20] [INFO ] Implicit Places using invariants and state equation in 17386 ms returned []
Implicit Place search using SMT with State Equation took 18261 ms to find 0 implicit places.
[2024-05-31 21:20:20] [INFO ] Redundant transitions in 112 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-31 21:20:20] [INFO ] Invariant cache hit.
[2024-05-31 21:20:20] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32155ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32184ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50637 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (287 resets) in 387 ms. (103 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 194191 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 2
Probabilistic random walk after 194191 steps, saw 33891 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2024-05-31 21:20:55] [INFO ] Invariant cache hit.
[2024-05-31 21:20:55] [INFO ] State equation strengthened by 3604 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 21:20:55] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 21:20:56] [INFO ] Deduced a trap composed of 37 places in 619 ms of which 7 ms to minimize.
[2024-05-31 21:20:57] [INFO ] Deduced a trap composed of 38 places in 596 ms of which 6 ms to minimize.
[2024-05-31 21:20:57] [INFO ] Deduced a trap composed of 38 places in 595 ms of which 6 ms to minimize.
[2024-05-31 21:20:58] [INFO ] Deduced a trap composed of 46 places in 574 ms of which 6 ms to minimize.
[2024-05-31 21:20:59] [INFO ] Deduced a trap composed of 45 places in 578 ms of which 6 ms to minimize.
[2024-05-31 21:20:59] [INFO ] Deduced a trap composed of 49 places in 579 ms of which 6 ms to minimize.
[2024-05-31 21:21:00] [INFO ] Deduced a trap composed of 70 places in 581 ms of which 6 ms to minimize.
[2024-05-31 21:21:00] [INFO ] Deduced a trap composed of 52 places in 533 ms of which 5 ms to minimize.
SMT process timed out in 5144ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 68 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (284 resets) in 358 ms. (111 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 207158 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 1
Probabilistic random walk after 207158 steps, saw 35560 distinct states, run finished after 3002 ms. (steps per millisecond=69 ) properties seen :0
[2024-05-31 21:21:04] [INFO ] Invariant cache hit.
[2024-05-31 21:21:04] [INFO ] State equation strengthened by 3604 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:21:04] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:21:05] [INFO ] Deduced a trap composed of 38 places in 661 ms of which 7 ms to minimize.
[2024-05-31 21:21:05] [INFO ] Deduced a trap composed of 37 places in 645 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3694/4774 variables, 1080/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3604/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 0/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4776 variables, 2/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4721 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2681 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:21:07] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:21:07] [INFO ] Deduced a trap composed of 41 places in 632 ms of which 6 ms to minimize.
[2024-05-31 21:21:08] [INFO ] Deduced a trap composed of 43 places in 616 ms of which 7 ms to minimize.
[2024-05-31 21:21:09] [INFO ] Deduced a trap composed of 40 places in 631 ms of which 6 ms to minimize.
[2024-05-31 21:21:09] [INFO ] Deduced a trap composed of 46 places in 634 ms of which 7 ms to minimize.
[2024-05-31 21:21:10] [INFO ] Deduced a trap composed of 38 places in 647 ms of which 6 ms to minimize.
[2024-05-31 21:21:10] [INFO ] Deduced a trap composed of 52 places in 600 ms of which 7 ms to minimize.
[2024-05-31 21:21:11] [INFO ] Deduced a trap composed of 43 places in 568 ms of which 6 ms to minimize.
[2024-05-31 21:21:12] [INFO ] Deduced a trap composed of 45 places in 570 ms of which 6 ms to minimize.
[2024-05-31 21:21:12] [INFO ] Deduced a trap composed of 43 places in 570 ms of which 6 ms to minimize.
[2024-05-31 21:21:13] [INFO ] Deduced a trap composed of 44 places in 556 ms of which 6 ms to minimize.
[2024-05-31 21:21:13] [INFO ] Deduced a trap composed of 42 places in 553 ms of which 5 ms to minimize.
[2024-05-31 21:21:14] [INFO ] Deduced a trap composed of 43 places in 551 ms of which 5 ms to minimize.
[2024-05-31 21:21:15] [INFO ] Deduced a trap composed of 46 places in 562 ms of which 6 ms to minimize.
[2024-05-31 21:21:15] [INFO ] Deduced a trap composed of 45 places in 568 ms of which 6 ms to minimize.
[2024-05-31 21:21:16] [INFO ] Deduced a trap composed of 44 places in 558 ms of which 6 ms to minimize.
[2024-05-31 21:21:16] [INFO ] Deduced a trap composed of 42 places in 568 ms of which 6 ms to minimize.
[2024-05-31 21:21:17] [INFO ] Deduced a trap composed of 42 places in 505 ms of which 5 ms to minimize.
[2024-05-31 21:21:17] [INFO ] Deduced a trap composed of 39 places in 573 ms of which 6 ms to minimize.
[2024-05-31 21:21:18] [INFO ] Deduced a trap composed of 48 places in 530 ms of which 5 ms to minimize.
[2024-05-31 21:21:19] [INFO ] Deduced a trap composed of 46 places in 532 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:21:19] [INFO ] Deduced a trap composed of 46 places in 526 ms of which 6 ms to minimize.
[2024-05-31 21:21:20] [INFO ] Deduced a trap composed of 45 places in 501 ms of which 6 ms to minimize.
[2024-05-31 21:21:20] [INFO ] Deduced a trap composed of 45 places in 469 ms of which 5 ms to minimize.
[2024-05-31 21:21:21] [INFO ] Deduced a trap composed of 42 places in 473 ms of which 5 ms to minimize.
[2024-05-31 21:21:21] [INFO ] Deduced a trap composed of 47 places in 477 ms of which 5 ms to minimize.
[2024-05-31 21:21:22] [INFO ] Deduced a trap composed of 46 places in 472 ms of which 5 ms to minimize.
[2024-05-31 21:21:22] [INFO ] Deduced a trap composed of 47 places in 424 ms of which 5 ms to minimize.
[2024-05-31 21:21:22] [INFO ] Deduced a trap composed of 46 places in 446 ms of which 5 ms to minimize.
[2024-05-31 21:21:23] [INFO ] Deduced a trap composed of 47 places in 448 ms of which 5 ms to minimize.
[2024-05-31 21:21:23] [INFO ] Deduced a trap composed of 45 places in 438 ms of which 4 ms to minimize.
[2024-05-31 21:21:24] [INFO ] Deduced a trap composed of 41 places in 441 ms of which 6 ms to minimize.
[2024-05-31 21:21:24] [INFO ] Deduced a trap composed of 40 places in 445 ms of which 5 ms to minimize.
[2024-05-31 21:21:25] [INFO ] Deduced a trap composed of 45 places in 449 ms of which 5 ms to minimize.
[2024-05-31 21:21:25] [INFO ] Deduced a trap composed of 45 places in 444 ms of which 5 ms to minimize.
[2024-05-31 21:21:26] [INFO ] Deduced a trap composed of 45 places in 457 ms of which 5 ms to minimize.
[2024-05-31 21:21:26] [INFO ] Deduced a trap composed of 45 places in 454 ms of which 5 ms to minimize.
[2024-05-31 21:21:27] [INFO ] Deduced a trap composed of 35 places in 407 ms of which 4 ms to minimize.
[2024-05-31 21:21:27] [INFO ] Deduced a trap composed of 44 places in 380 ms of which 5 ms to minimize.
[2024-05-31 21:21:27] [INFO ] Deduced a trap composed of 39 places in 384 ms of which 4 ms to minimize.
[2024-05-31 21:21:28] [INFO ] Deduced a trap composed of 41 places in 329 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:21:28] [INFO ] Deduced a trap composed of 56 places in 341 ms of which 4 ms to minimize.
[2024-05-31 21:21:28] [INFO ] Deduced a trap composed of 41 places in 307 ms of which 4 ms to minimize.
[2024-05-31 21:21:29] [INFO ] Deduced a trap composed of 38 places in 311 ms of which 4 ms to minimize.
[2024-05-31 21:21:29] [INFO ] Deduced a trap composed of 39 places in 325 ms of which 4 ms to minimize.
[2024-05-31 21:21:29] [INFO ] Deduced a trap composed of 41 places in 328 ms of which 4 ms to minimize.
[2024-05-31 21:21:30] [INFO ] Deduced a trap composed of 42 places in 329 ms of which 3 ms to minimize.
[2024-05-31 21:21:30] [INFO ] Deduced a trap composed of 43 places in 295 ms of which 4 ms to minimize.
[2024-05-31 21:21:30] [INFO ] Deduced a trap composed of 39 places in 273 ms of which 4 ms to minimize.
[2024-05-31 21:21:31] [INFO ] Deduced a trap composed of 39 places in 307 ms of which 4 ms to minimize.
[2024-05-31 21:21:31] [INFO ] Deduced a trap composed of 39 places in 290 ms of which 4 ms to minimize.
[2024-05-31 21:21:31] [INFO ] Deduced a trap composed of 38 places in 285 ms of which 4 ms to minimize.
[2024-05-31 21:21:32] [INFO ] Deduced a trap composed of 38 places in 289 ms of which 4 ms to minimize.
[2024-05-31 21:21:32] [INFO ] Deduced a trap composed of 40 places in 291 ms of which 4 ms to minimize.
[2024-05-31 21:21:32] [INFO ] Deduced a trap composed of 40 places in 290 ms of which 4 ms to minimize.
[2024-05-31 21:21:33] [INFO ] Deduced a trap composed of 40 places in 265 ms of which 4 ms to minimize.
[2024-05-31 21:21:33] [INFO ] Deduced a trap composed of 39 places in 246 ms of which 4 ms to minimize.
[2024-05-31 21:21:33] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 3 ms to minimize.
[2024-05-31 21:21:33] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 3 ms to minimize.
[2024-05-31 21:21:34] [INFO ] Deduced a trap composed of 48 places in 230 ms of which 3 ms to minimize.
[2024-05-31 21:21:34] [INFO ] Deduced a trap composed of 48 places in 231 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:21:34] [INFO ] Deduced a trap composed of 45 places in 210 ms of which 3 ms to minimize.
[2024-05-31 21:21:34] [INFO ] Deduced a trap composed of 45 places in 224 ms of which 3 ms to minimize.
[2024-05-31 21:21:35] [INFO ] Deduced a trap composed of 41 places in 207 ms of which 3 ms to minimize.
[2024-05-31 21:21:35] [INFO ] Deduced a trap composed of 36 places in 246 ms of which 3 ms to minimize.
[2024-05-31 21:21:35] [INFO ] Deduced a trap composed of 44 places in 216 ms of which 3 ms to minimize.
[2024-05-31 21:21:35] [INFO ] Deduced a trap composed of 42 places in 215 ms of which 2 ms to minimize.
[2024-05-31 21:21:36] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 3 ms to minimize.
[2024-05-31 21:21:36] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 2 ms to minimize.
[2024-05-31 21:21:36] [INFO ] Deduced a trap composed of 48 places in 176 ms of which 3 ms to minimize.
[2024-05-31 21:21:36] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 2 ms to minimize.
[2024-05-31 21:21:36] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 3 ms to minimize.
[2024-05-31 21:21:37] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 3 ms to minimize.
[2024-05-31 21:21:37] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 2 ms to minimize.
[2024-05-31 21:21:37] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 2 ms to minimize.
[2024-05-31 21:21:37] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 2 ms to minimize.
[2024-05-31 21:21:37] [INFO ] Deduced a trap composed of 50 places in 130 ms of which 2 ms to minimize.
[2024-05-31 21:21:37] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 2 ms to minimize.
[2024-05-31 21:21:37] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 2 ms to minimize.
[2024-05-31 21:21:38] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 2 ms to minimize.
[2024-05-31 21:21:38] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:21:38] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2024-05-31 21:21:38] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2024-05-31 21:21:38] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 1 ms to minimize.
[2024-05-31 21:21:38] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 2 ms to minimize.
[2024-05-31 21:21:38] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 2 ms to minimize.
[2024-05-31 21:21:38] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1080 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1080 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3694/4774 variables, 1080/1202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4774 variables, 3604/4806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4774 variables, 1/4807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4774 variables, 0/4807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/4776 variables, 2/4809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4776 variables, 0/4809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/4776 variables, 0/4809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4809 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33799 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 90/90 constraints]
After SMT, in 36513ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 68 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 64 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-31 21:21:40] [INFO ] Invariant cache hit.
[2024-05-31 21:21:41] [INFO ] Implicit Places using invariants in 862 ms returned []
[2024-05-31 21:21:41] [INFO ] Invariant cache hit.
[2024-05-31 21:21:42] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-31 21:21:59] [INFO ] Implicit Places using invariants and state equation in 18014 ms returned []
Implicit Place search using SMT with State Equation took 18877 ms to find 0 implicit places.
[2024-05-31 21:21:59] [INFO ] Redundant transitions in 109 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-31 21:21:59] [INFO ] Invariant cache hit.
[2024-05-31 21:21:59] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32157ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32183ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51247 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3511 edges and 1082 vertex of which 958 / 1082 are part of one of the 2 SCC in 1 ms
Free SCC test removed 956 places
Drop transitions (Empty/Sink Transition effects.) removed 2643 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3565 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.0 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 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 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 15 ms. Remains 4 /1082 variables (removed 1078) and now considering 5/3694 (removed 3689) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-31 21:22:31] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 21:22:31] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:22:32] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:22:32] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:22:32] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 80 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-14 in 170298 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-31 21:22:32] [INFO ] Computed 32 invariants in 54 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 77 ms. (128 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 21:22:32] [INFO ] Invariant cache hit.
[2024-05-31 21:22:32] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-31 21:22:32] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:22:32] [INFO ] [Real]Absence check using state equation in 657 ms returned sat
[2024-05-31 21:22:33] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-31 21:22:33] [INFO ] [Real]Added 3582 Read/Feed constraints in 310 ms returned sat
[2024-05-31 21:22:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:22:33] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-31 21:22:33] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 21:22:34] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2024-05-31 21:22:34] [INFO ] [Nat]Added 3582 Read/Feed constraints in 273 ms returned sat
[2024-05-31 21:22:34] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 175 ms.
[2024-05-31 21:22:35] [INFO ] Added : 9 causal constraints over 2 iterations in 634 ms. Result :sat
Minimization took 937 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1084 transition count 3696
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1084 transition count 3695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1083 transition count 3695
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 1083 transition count 3695
Applied a total of 23 rules in 248 ms. Remains 1083 /1090 variables (removed 7) and now considering 3695/3702 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-31 21:22:36] [INFO ] Computed 32 invariants in 51 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7142 resets) in 7071 ms. (141 steps per ms)
BEST_FIRST walk for 1000001 steps (202 resets) in 989 ms. (1010 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-31 21:22:44] [INFO ] Invariant cache hit.
[2024-05-31 21:22:44] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-31 21:22:44] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:22:45] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2024-05-31 21:22:45] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 21:22:45] [INFO ] [Real]Added 3603 Read/Feed constraints in 293 ms returned sat
[2024-05-31 21:22:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:22:45] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-31 21:22:45] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:22:46] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2024-05-31 21:22:46] [INFO ] [Nat]Added 3603 Read/Feed constraints in 325 ms returned sat
[2024-05-31 21:22:47] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 188 ms.
[2024-05-31 21:22:47] [INFO ] Added : 8 causal constraints over 2 iterations in 687 ms. Result :sat
Minimization took 4503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 70 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 66 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-31 21:22:52] [INFO ] Invariant cache hit.
[2024-05-31 21:22:53] [INFO ] Implicit Places using invariants in 875 ms returned []
[2024-05-31 21:22:53] [INFO ] Invariant cache hit.
[2024-05-31 21:22:53] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 21:23:12] [INFO ] Implicit Places using invariants and state equation in 19268 ms returned []
Implicit Place search using SMT with State Equation took 20145 ms to find 0 implicit places.
[2024-05-31 21:23:12] [INFO ] Redundant transitions in 113 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-31 21:23:12] [INFO ] Invariant cache hit.
[2024-05-31 21:23:12] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32402ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32429ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52768 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (282 resets) in 351 ms. (113 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 186697 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 2
Probabilistic random walk after 186697 steps, saw 33325 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-31 21:23:48] [INFO ] Invariant cache hit.
[2024-05-31 21:23:48] [INFO ] State equation strengthened by 3603 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 21:23:48] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 21:23:49] [INFO ] Deduced a trap composed of 52 places in 661 ms of which 7 ms to minimize.
[2024-05-31 21:23:49] [INFO ] Deduced a trap composed of 37 places in 632 ms of which 6 ms to minimize.
[2024-05-31 21:23:50] [INFO ] Deduced a trap composed of 40 places in 638 ms of which 7 ms to minimize.
[2024-05-31 21:23:51] [INFO ] Deduced a trap composed of 42 places in 581 ms of which 6 ms to minimize.
[2024-05-31 21:23:51] [INFO ] Deduced a trap composed of 42 places in 542 ms of which 5 ms to minimize.
[2024-05-31 21:23:52] [INFO ] Deduced a trap composed of 39 places in 539 ms of which 6 ms to minimize.
[2024-05-31 21:23:52] [INFO ] Deduced a trap composed of 37 places in 512 ms of which 5 ms to minimize.
[2024-05-31 21:23:53] [INFO ] Deduced a trap composed of 47 places in 526 ms of which 6 ms to minimize.
SMT process timed out in 5142ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 75 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (284 resets) in 345 ms. (115 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 201060 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 201060 steps, saw 35123 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-31 21:23:56] [INFO ] Invariant cache hit.
[2024-05-31 21:23:56] [INFO ] State equation strengthened by 3603 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:23:56] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:23:57] [INFO ] Deduced a trap composed of 35 places in 627 ms of which 9 ms to minimize.
[2024-05-31 21:23:58] [INFO ] Deduced a trap composed of 34 places in 583 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3695/4776 variables, 1081/1116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4776 variables, 3603/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 0/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4778 variables, 2/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4778 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4778 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4721 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2820 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:23:59] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:24:00] [INFO ] Deduced a trap composed of 60 places in 635 ms of which 7 ms to minimize.
[2024-05-31 21:24:00] [INFO ] Deduced a trap composed of 37 places in 588 ms of which 6 ms to minimize.
[2024-05-31 21:24:00] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3695/4776 variables, 1081/1120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 3603/4723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 1/4724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4778 variables, 2/4726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4778 variables, 0/4726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4778 variables, 0/4726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4778/4778 variables, and 4726 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3840 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 6705ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 66 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 66 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-31 21:24:03] [INFO ] Invariant cache hit.
[2024-05-31 21:24:04] [INFO ] Implicit Places using invariants in 867 ms returned []
[2024-05-31 21:24:04] [INFO ] Invariant cache hit.
[2024-05-31 21:24:04] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-31 21:24:22] [INFO ] Implicit Places using invariants and state equation in 17958 ms returned []
Implicit Place search using SMT with State Equation took 18827 ms to find 0 implicit places.
[2024-05-31 21:24:22] [INFO ] Redundant transitions in 110 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-31 21:24:22] [INFO ] Invariant cache hit.
[2024-05-31 21:24:22] [INFO ] State equation strengthened by 3603 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.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 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 1.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 1.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)timeout

(s587 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32177ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32206ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51224 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3512 edges and 1083 vertex of which 959 / 1083 are part of one of the 2 SCC in 1 ms
Free SCC test removed 957 places
Drop transitions (Empty/Sink Transition effects.) removed 2644 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3566 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.1 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 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 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 9 ms. Remains 4 /1083 variables (removed 1079) and now considering 5/3695 (removed 3690) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-31 21:24:54] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 21:24:54] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:24:54] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:24:54] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:24:54] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 65 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-15 in 142520 ms.
[2024-05-31 21:24:54] [INFO ] Flatten gal took : 233 ms
[2024-05-31 21:24:54] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-31 21:24:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1090 places, 3702 transitions and 14836 arcs took 20 ms.
Total runtime 3086732 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : CANInsertWithFailure-PT-030-UpperBounds-00
Could not compute solution for formula : CANInsertWithFailure-PT-030-UpperBounds-01
Could not compute solution for formula : CANInsertWithFailure-PT-030-UpperBounds-02
Could not compute solution for formula : CANInsertWithFailure-PT-030-UpperBounds-03
Could not compute solution for formula : CANInsertWithFailure-PT-030-UpperBounds-04
Could not compute solution for formula : CANInsertWithFailure-PT-030-UpperBounds-06
Could not compute solution for formula : CANInsertWithFailure-PT-030-UpperBounds-07
Could not compute solution for formula : CANInsertWithFailure-PT-030-UpperBounds-08
Could not compute solution for formula : CANInsertWithFailure-PT-030-UpperBounds-09
Could not compute solution for formula : CANInsertWithFailure-PT-030-UpperBounds-10
Could not compute solution for formula : CANInsertWithFailure-PT-030-UpperBounds-11
Could not compute solution for formula : CANInsertWithFailure-PT-030-UpperBounds-12
Could not compute solution for formula : CANInsertWithFailure-PT-030-UpperBounds-13
Could not compute solution for formula : CANInsertWithFailure-PT-030-UpperBounds-14
Could not compute solution for formula : CANInsertWithFailure-PT-030-UpperBounds-15

BK_STOP 1717190695405

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name CANInsertWithFailure-PT-030-UpperBounds-00
ub formula formula --maxsum=/tmp/5446/ub_0_
ub formula name CANInsertWithFailure-PT-030-UpperBounds-01
ub formula formula --maxsum=/tmp/5446/ub_1_
ub formula name CANInsertWithFailure-PT-030-UpperBounds-02
ub formula formula --maxsum=/tmp/5446/ub_2_
ub formula name CANInsertWithFailure-PT-030-UpperBounds-03
ub formula formula --maxsum=/tmp/5446/ub_3_
ub formula name CANInsertWithFailure-PT-030-UpperBounds-04
ub formula formula --maxsum=/tmp/5446/ub_4_
ub formula name CANInsertWithFailure-PT-030-UpperBounds-06
ub formula formula --maxsum=/tmp/5446/ub_5_
ub formula name CANInsertWithFailure-PT-030-UpperBounds-07
ub formula formula --maxsum=/tmp/5446/ub_6_
ub formula name CANInsertWithFailure-PT-030-UpperBounds-08
ub formula formula --maxsum=/tmp/5446/ub_7_
ub formula name CANInsertWithFailure-PT-030-UpperBounds-09
ub formula formula --maxsum=/tmp/5446/ub_8_
ub formula name CANInsertWithFailure-PT-030-UpperBounds-10
ub formula formula --maxsum=/tmp/5446/ub_9_
ub formula name CANInsertWithFailure-PT-030-UpperBounds-11
ub formula formula --maxsum=/tmp/5446/ub_10_
ub formula name CANInsertWithFailure-PT-030-UpperBounds-12
ub formula formula --maxsum=/tmp/5446/ub_11_
ub formula name CANInsertWithFailure-PT-030-UpperBounds-13
ub formula formula --maxsum=/tmp/5446/ub_12_
ub formula name CANInsertWithFailure-PT-030-UpperBounds-14
ub formula formula --maxsum=/tmp/5446/ub_13_
ub formula name CANInsertWithFailure-PT-030-UpperBounds-15
ub formula formula --maxsum=/tmp/5446/ub_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc