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-171620505100101.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-010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505100101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 698K 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-010-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717186298237

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-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:11:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 20:11:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:11:39] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-31 20:11:39] [INFO ] Transformed 324 places.
[2024-05-31 20:11:39] [INFO ] Transformed 660 transitions.
[2024-05-31 20:11:39] [INFO ] Parsed PT model containing 324 places and 660 transitions and 1800 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 660 rows 324 cols
[2024-05-31 20:11:39] [INFO ] Computed 13 invariants in 34 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:[10, 10, 10, 10, 1, 10, 10, 10, 10, 10, 10, 10, 1, 1, 10, 10]
RANDOM walk for 10000 steps (45 resets) in 41 ms. (238 steps per ms)
FORMULA CANInsertWithFailure-PT-010-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130012 steps (73 resets) in 114 ms. (1130 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] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
[2024-05-31 20:11:39] [INFO ] Invariant cache hit.
[2024-05-31 20:11:40] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-05-31 20:11:40] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-31 20:11:40] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-31 20:11:40] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-31 20:11:40] [INFO ] [Real]Added 190 Read/Feed constraints in 22 ms returned sat
[2024-05-31 20:11:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:11:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-31 20:11:40] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-31 20:11:40] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-05-31 20:11:40] [INFO ] [Nat]Added 190 Read/Feed constraints in 54 ms returned sat
[2024-05-31 20:11:40] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 45 ms.
[2024-05-31 20:11:41] [INFO ] Added : 47 causal constraints over 10 iterations in 452 ms. Result :sat
Minimization took 501 ms.
[2024-05-31 20:11:41] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-31 20:11:41] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:11:41] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2024-05-31 20:11:41] [INFO ] [Real]Added 190 Read/Feed constraints in 14 ms returned sat
[2024-05-31 20:11:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:11:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 20:11:41] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:11:42] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2024-05-31 20:11:42] [INFO ] [Nat]Added 190 Read/Feed constraints in 67 ms returned sat
[2024-05-31 20:11:42] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 39 ms.
[2024-05-31 20:11:42] [INFO ] Added : 39 causal constraints over 8 iterations in 320 ms. Result :sat
Minimization took 501 ms.
[2024-05-31 20:11:42] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 20:11:42] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-31 20:11:43] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-05-31 20:11:43] [INFO ] [Real]Added 190 Read/Feed constraints in 26 ms returned sat
[2024-05-31 20:11:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:11:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 20:11:43] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:11:43] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-05-31 20:11:43] [INFO ] [Nat]Added 190 Read/Feed constraints in 67 ms returned sat
[2024-05-31 20:11:43] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 35 ms.
[2024-05-31 20:11:43] [INFO ] Added : 46 causal constraints over 10 iterations in 393 ms. Result :sat
Minimization took 500 ms.
[2024-05-31 20:11:44] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 20:11:44] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:11:44] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-05-31 20:11:44] [INFO ] [Real]Added 190 Read/Feed constraints in 22 ms returned sat
[2024-05-31 20:11:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:11:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 20:11:44] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:11:44] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-05-31 20:11:44] [INFO ] [Nat]Added 190 Read/Feed constraints in 81 ms returned sat
[2024-05-31 20:11:44] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 35 ms.
[2024-05-31 20:11:45] [INFO ] Added : 47 causal constraints over 10 iterations in 366 ms. Result :sat
Minimization took 501 ms.
[2024-05-31 20:11:45] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-31 20:11:45] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:11:45] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-05-31 20:11:45] [INFO ] [Real]Added 190 Read/Feed constraints in 23 ms returned sat
[2024-05-31 20:11:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:11:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 20:11:45] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:11:46] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2024-05-31 20:11:46] [INFO ] [Nat]Added 190 Read/Feed constraints in 46 ms returned sat
[2024-05-31 20:11:46] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 37 ms.
[2024-05-31 20:11:46] [INFO ] Added : 36 causal constraints over 8 iterations in 294 ms. Result :sat
Minimization took 501 ms.
[2024-05-31 20:11:46] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 20:11:46] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned unsat
[2024-05-31 20:11:47] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 20:11:47] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-31 20:11:47] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-05-31 20:11:47] [INFO ] [Real]Added 190 Read/Feed constraints in 16 ms returned sat
[2024-05-31 20:11:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:11:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 20:11:47] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:11:47] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2024-05-31 20:11:47] [INFO ] [Nat]Added 190 Read/Feed constraints in 54 ms returned sat
[2024-05-31 20:11:47] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 36 ms.
[2024-05-31 20:11:47] [INFO ] Added : 55 causal constraints over 11 iterations in 405 ms. Result :sat
Minimization took 503 ms.
[2024-05-31 20:11:48] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 20:11:48] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned unsat
[2024-05-31 20:11:48] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 20:11:48] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:11:48] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-05-31 20:11:48] [INFO ] [Real]Added 190 Read/Feed constraints in 21 ms returned sat
[2024-05-31 20:11:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:11:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 20:11:48] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:11:48] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2024-05-31 20:11:48] [INFO ] [Nat]Added 190 Read/Feed constraints in 49 ms returned sat
[2024-05-31 20:11:48] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 36 ms.
[2024-05-31 20:11:49] [INFO ] Added : 38 causal constraints over 8 iterations in 286 ms. Result :sat
Minimization took 500 ms.
[2024-05-31 20:11:49] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-31 20:11:49] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:11:49] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-05-31 20:11:49] [INFO ] [Real]Added 190 Read/Feed constraints in 17 ms returned sat
[2024-05-31 20:11:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:11:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 20:11:49] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-31 20:11:50] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-05-31 20:11:50] [INFO ] [Nat]Added 190 Read/Feed constraints in 38 ms returned sat
[2024-05-31 20:11:50] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 38 ms.
[2024-05-31 20:11:50] [INFO ] Added : 29 causal constraints over 6 iterations in 239 ms. Result :sat
Minimization took 503 ms.
[2024-05-31 20:11:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 20:11:50] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:11:51] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-05-31 20:11:51] [INFO ] [Real]Added 190 Read/Feed constraints in 16 ms returned sat
[2024-05-31 20:11:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:11:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 20:11:51] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:11:51] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-05-31 20:11:51] [INFO ] [Nat]Added 190 Read/Feed constraints in 45 ms returned sat
[2024-05-31 20:11:51] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 36 ms.
[2024-05-31 20:11:51] [INFO ] Added : 46 causal constraints over 10 iterations in 326 ms. Result :sat
Minimization took 501 ms.
[2024-05-31 20:11:52] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 20:11:52] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:11:52] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2024-05-31 20:11:52] [INFO ] [Real]Added 190 Read/Feed constraints in 18 ms returned sat
[2024-05-31 20:11:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:11:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 20:11:52] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:11:52] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2024-05-31 20:11:52] [INFO ] [Nat]Added 190 Read/Feed constraints in 52 ms returned sat
[2024-05-31 20:11:52] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 48 ms.
[2024-05-31 20:11:52] [INFO ] Added : 36 causal constraints over 8 iterations in 310 ms. Result :sat
Minimization took 504 ms.
[2024-05-31 20:11:53] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 20:11:53] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 1, 10, 1, 10, 10, 10, 10, 1]
FORMULA CANInsertWithFailure-PT-010-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Support contains 10 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 660/660 transitions.
Graph (complete) has 951 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 323 transition count 590
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 253 transition count 590
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 315 place count 166 transition count 503
Drop transitions (Redundant composition of simpler transitions.) removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 2 with 69 rules applied. Total rules applied 384 place count 166 transition count 434
Partial Free-agglomeration rule applied 111 times.
Drop transitions (Partial Free agglomeration) removed 111 transitions
Iterating global reduction 2 with 111 rules applied. Total rules applied 495 place count 166 transition count 434
Applied a total of 495 rules in 101 ms. Remains 166 /324 variables (removed 158) and now considering 434/660 (removed 226) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 166/324 places, 434/660 transitions.
// Phase 1: matrix 434 rows 166 cols
[2024-05-31 20:11:53] [INFO ] Computed 12 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
RANDOM walk for 1000000 steps (19890 resets) in 2471 ms. (404 steps per ms)
BEST_FIRST walk for 10000009 steps (19442 resets) in 5173 ms. (1932 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
[2024-05-31 20:12:01] [INFO ] Invariant cache hit.
[2024-05-31 20:12:01] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:01] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:01] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-31 20:12:01] [INFO ] State equation strengthened by 387 read => feed constraints.
[2024-05-31 20:12:01] [INFO ] [Real]Added 387 Read/Feed constraints in 28 ms returned sat
[2024-05-31 20:12:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:12:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:01] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:12:01] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-31 20:12:01] [INFO ] [Nat]Added 387 Read/Feed constraints in 29 ms returned sat
[2024-05-31 20:12:01] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 27 ms.
[2024-05-31 20:12:01] [INFO ] Added : 7 causal constraints over 2 iterations in 92 ms. Result :sat
Minimization took 267 ms.
[2024-05-31 20:12:01] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-31 20:12:01] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-31 20:12:02] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-31 20:12:02] [INFO ] [Real]Added 387 Read/Feed constraints in 26 ms returned sat
[2024-05-31 20:12:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:12:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:02] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:02] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-31 20:12:02] [INFO ] [Nat]Added 387 Read/Feed constraints in 34 ms returned sat
[2024-05-31 20:12:02] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 26 ms.
[2024-05-31 20:12:02] [INFO ] Added : 6 causal constraints over 2 iterations in 97 ms. Result :sat
Minimization took 262 ms.
[2024-05-31 20:12:02] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:02] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-31 20:12:02] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-31 20:12:02] [INFO ] [Real]Added 387 Read/Feed constraints in 28 ms returned sat
[2024-05-31 20:12:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:12:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-31 20:12:02] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:02] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-31 20:12:02] [INFO ] [Nat]Added 387 Read/Feed constraints in 32 ms returned sat
[2024-05-31 20:12:02] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 24 ms.
[2024-05-31 20:12:03] [INFO ] Added : 10 causal constraints over 3 iterations in 112 ms. Result :sat
Minimization took 265 ms.
[2024-05-31 20:12:03] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:03] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:03] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-31 20:12:03] [INFO ] [Real]Added 387 Read/Feed constraints in 26 ms returned sat
[2024-05-31 20:12:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:12:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-31 20:12:03] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-31 20:12:03] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-31 20:12:03] [INFO ] [Nat]Added 387 Read/Feed constraints in 30 ms returned sat
[2024-05-31 20:12:03] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 24 ms.
[2024-05-31 20:12:03] [INFO ] Added : 7 causal constraints over 2 iterations in 90 ms. Result :sat
Minimization took 277 ms.
[2024-05-31 20:12:04] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:04] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:04] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-31 20:12:04] [INFO ] [Real]Added 387 Read/Feed constraints in 26 ms returned sat
[2024-05-31 20:12:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:12:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:04] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:04] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-31 20:12:04] [INFO ] [Nat]Added 387 Read/Feed constraints in 34 ms returned sat
[2024-05-31 20:12:04] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 23 ms.
[2024-05-31 20:12:04] [INFO ] Added : 11 causal constraints over 3 iterations in 117 ms. Result :sat
Minimization took 281 ms.
[2024-05-31 20:12:04] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:04] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:04] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-31 20:12:04] [INFO ] [Real]Added 387 Read/Feed constraints in 30 ms returned sat
[2024-05-31 20:12:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:12:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:04] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:05] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-31 20:12:05] [INFO ] [Nat]Added 387 Read/Feed constraints in 33 ms returned sat
[2024-05-31 20:12:05] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 21 ms.
[2024-05-31 20:12:05] [INFO ] Added : 6 causal constraints over 2 iterations in 87 ms. Result :sat
Minimization took 276 ms.
[2024-05-31 20:12:05] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:05] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:12:05] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-31 20:12:05] [INFO ] [Real]Added 387 Read/Feed constraints in 27 ms returned sat
[2024-05-31 20:12:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:12:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:05] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:12:05] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-31 20:12:05] [INFO ] [Nat]Added 387 Read/Feed constraints in 41 ms returned sat
[2024-05-31 20:12:05] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 24 ms.
[2024-05-31 20:12:05] [INFO ] Added : 12 causal constraints over 3 iterations in 128 ms. Result :sat
Minimization took 291 ms.
[2024-05-31 20:12:06] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:06] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:12:06] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-31 20:12:06] [INFO ] [Real]Added 387 Read/Feed constraints in 28 ms returned sat
[2024-05-31 20:12:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:12:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:06] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:12:06] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-31 20:12:06] [INFO ] [Nat]Added 387 Read/Feed constraints in 27 ms returned sat
[2024-05-31 20:12:06] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 22 ms.
[2024-05-31 20:12:06] [INFO ] Added : 6 causal constraints over 2 iterations in 86 ms. Result :sat
Minimization took 271 ms.
[2024-05-31 20:12:06] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:06] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:12:06] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-31 20:12:07] [INFO ] [Real]Added 387 Read/Feed constraints in 28 ms returned sat
[2024-05-31 20:12:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:12:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:07] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:07] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-31 20:12:07] [INFO ] [Nat]Added 387 Read/Feed constraints in 36 ms returned sat
[2024-05-31 20:12:07] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 23 ms.
[2024-05-31 20:12:07] [INFO ] Added : 6 causal constraints over 2 iterations in 97 ms. Result :sat
Minimization took 254 ms.
[2024-05-31 20:12:07] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:07] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:12:07] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-31 20:12:07] [INFO ] [Real]Added 387 Read/Feed constraints in 27 ms returned sat
[2024-05-31 20:12:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:12:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-31 20:12:07] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:07] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-31 20:12:07] [INFO ] [Nat]Added 387 Read/Feed constraints in 29 ms returned sat
[2024-05-31 20:12:07] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 22 ms.
[2024-05-31 20:12:07] [INFO ] Added : 5 causal constraints over 1 iterations in 71 ms. Result :sat
Minimization took 252 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Support contains 10 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 434/434 transitions.
Applied a total of 0 rules in 13 ms. Remains 166 /166 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 166/166 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 434/434 transitions.
Applied a total of 0 rules in 18 ms. Remains 166 /166 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2024-05-31 20:12:08] [INFO ] Invariant cache hit.
[2024-05-31 20:12:08] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-31 20:12:08] [INFO ] Invariant cache hit.
[2024-05-31 20:12:08] [INFO ] State equation strengthened by 387 read => feed constraints.
[2024-05-31 20:12:08] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
[2024-05-31 20:12:08] [INFO ] Redundant transitions in 22 ms returned []
Running 424 sub problems to find dead transitions.
[2024-05-31 20:12:08] [INFO ] Invariant cache hit.
[2024-05-31 20:12:08] [INFO ] State equation strengthened by 387 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:12:10] [INFO ] Deduced a trap composed of 2 places in 95 ms of which 10 ms to minimize.
[2024-05-31 20:12:10] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-31 20:12:10] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:12:10] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:12:10] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:12:10] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:12:11] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:12:11] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-31 20:12:11] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:12:11] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:12:11] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:12:11] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:12:11] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-31 20:12:11] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-31 20:12:11] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:12:11] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-31 20:12:11] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:12:11] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:12:11] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-31 20:12:11] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:12:11] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:12:11] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:12:11] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:12:11] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:12:11] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:12:11] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:12:11] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-31 20:12:12] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:12:12] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-31 20:12:12] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:12:12] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:12:12] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:12:12] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-31 20:12:12] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:12:12] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 4 ms to minimize.
[2024-05-31 20:12:12] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:12:12] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:12:13] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:12:13] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:12:13] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:12:14] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:12:14] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:12:14] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-31 20:12:14] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:12:14] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-31 20:12:14] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:12:14] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:12:14] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:12:14] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-31 20:12:14] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:12:14] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:12:15] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:12:15] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-31 20:12:15] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:12:15] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:12:15] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:12:15] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 4 ms to minimize.
[2024-05-31 20:12:15] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:12:15] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:12:16] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:12:16] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-31 20:12:16] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:12:16] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:12:16] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-31 20:12:16] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:12:16] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:12:16] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:12:16] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-31 20:12:16] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-31 20:12:16] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-31 20:12:16] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-31 20:12:16] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:12:16] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:12:16] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-31 20:12:16] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-31 20:12:16] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:12:16] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:12:16] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-31 20:12:16] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-31 20:12:16] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:12:17] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:12:17] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:12:17] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:12:17] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-31 20:12:17] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:12:17] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-31 20:12:17] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-31 20:12:17] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-31 20:12:18] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:12:18] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:12:18] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:12:18] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-31 20:12:18] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:12:18] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:12:18] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-31 20:12:18] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:12:18] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:12:18] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-31 20:12:18] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:12:19] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:12:20] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:12:20] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-31 20:12:20] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-31 20:12:20] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:12:20] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:12:20] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:12:20] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-31 20:12:20] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:12:20] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:12:21] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:12:21] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:12:21] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-31 20:12:22] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:12:22] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:12:22] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-31 20:12:22] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 16/128 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:12:23] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:12:23] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:12:24] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:12:24] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-31 20:12:24] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 10 (OVERLAPS) 434/599 variables, 165/298 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Problem TDEAD332 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD433 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/599 variables, 387/685 constraints. Problems are: Problem set: 9 solved, 415 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/599 variables, 0/685 constraints. Problems are: Problem set: 9 solved, 415 unsolved
SMT process timed out in 30199ms, After SMT, problems are : Problem set: 9 solved, 415 unsolved
Search for dead transitions found 9 dead transitions in 30213ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 166/166 places, 425/434 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 159 transition count 411
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 159 transition count 411
Applied a total of 14 rules in 14 ms. Remains 159 /166 variables (removed 7) and now considering 411/425 (removed 14) transitions.
// Phase 1: matrix 411 rows 159 cols
[2024-05-31 20:12:39] [INFO ] Computed 12 invariants in 3 ms
[2024-05-31 20:12:39] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-31 20:12:39] [INFO ] Invariant cache hit.
[2024-05-31 20:12:39] [INFO ] State equation strengthened by 371 read => feed constraints.
[2024-05-31 20:12:39] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 159/166 places, 411/434 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 31655 ms. Remains : 159/166 places, 411/434 transitions.
[2024-05-31 20:12:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
RANDOM walk for 1000000 steps (19891 resets) in 2357 ms. (424 steps per ms)
BEST_FIRST walk for 10000009 steps (19530 resets) in 5152 ms. (1940 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
[2024-05-31 20:12:47] [INFO ] Invariant cache hit.
[2024-05-31 20:12:47] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:47] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:47] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-31 20:12:47] [INFO ] State equation strengthened by 371 read => feed constraints.
[2024-05-31 20:12:47] [INFO ] [Real]Added 371 Read/Feed constraints in 23 ms returned sat
[2024-05-31 20:12:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:12:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:47] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:12:47] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-31 20:12:47] [INFO ] [Nat]Added 371 Read/Feed constraints in 37 ms returned sat
[2024-05-31 20:12:47] [INFO ] Computed and/alt/rep : 284/795/284 causal constraints (skipped 117 transitions) in 21 ms.
[2024-05-31 20:12:47] [INFO ] Added : 9 causal constraints over 2 iterations in 96 ms. Result :sat
Minimization took 230 ms.
[2024-05-31 20:12:48] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:48] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-31 20:12:48] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-31 20:12:48] [INFO ] [Real]Added 371 Read/Feed constraints in 24 ms returned sat
[2024-05-31 20:12:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:12:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-31 20:12:48] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:48] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-31 20:12:48] [INFO ] [Nat]Added 371 Read/Feed constraints in 27 ms returned sat
[2024-05-31 20:12:48] [INFO ] Computed and/alt/rep : 284/795/284 causal constraints (skipped 117 transitions) in 22 ms.
[2024-05-31 20:12:48] [INFO ] Added : 6 causal constraints over 2 iterations in 98 ms. Result :sat
Minimization took 227 ms.
[2024-05-31 20:12:48] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:48] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-31 20:12:48] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-31 20:12:48] [INFO ] [Real]Added 371 Read/Feed constraints in 26 ms returned sat
[2024-05-31 20:12:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:12:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:48] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:48] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-31 20:12:48] [INFO ] [Nat]Added 371 Read/Feed constraints in 33 ms returned sat
[2024-05-31 20:12:48] [INFO ] Computed and/alt/rep : 284/795/284 causal constraints (skipped 117 transitions) in 21 ms.
[2024-05-31 20:12:49] [INFO ] Added : 11 causal constraints over 3 iterations in 106 ms. Result :sat
Minimization took 234 ms.
[2024-05-31 20:12:49] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:49] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:49] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-31 20:12:49] [INFO ] [Real]Added 371 Read/Feed constraints in 25 ms returned sat
[2024-05-31 20:12:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:12:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:49] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:49] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-31 20:12:49] [INFO ] [Nat]Added 371 Read/Feed constraints in 35 ms returned sat
[2024-05-31 20:12:49] [INFO ] Computed and/alt/rep : 284/795/284 causal constraints (skipped 117 transitions) in 21 ms.
[2024-05-31 20:12:49] [INFO ] Added : 7 causal constraints over 2 iterations in 84 ms. Result :sat
Minimization took 197 ms.
[2024-05-31 20:12:49] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:49] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:50] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-31 20:12:50] [INFO ] [Real]Added 371 Read/Feed constraints in 25 ms returned sat
[2024-05-31 20:12:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:12:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:50] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:50] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-31 20:12:50] [INFO ] [Nat]Added 371 Read/Feed constraints in 27 ms returned sat
[2024-05-31 20:12:50] [INFO ] Computed and/alt/rep : 284/795/284 causal constraints (skipped 117 transitions) in 24 ms.
[2024-05-31 20:12:50] [INFO ] Added : 6 causal constraints over 2 iterations in 87 ms. Result :sat
Minimization took 198 ms.
[2024-05-31 20:12:50] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:50] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:12:50] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-31 20:12:50] [INFO ] [Real]Added 371 Read/Feed constraints in 25 ms returned sat
[2024-05-31 20:12:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:12:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:50] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:50] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-31 20:12:50] [INFO ] [Nat]Added 371 Read/Feed constraints in 32 ms returned sat
[2024-05-31 20:12:50] [INFO ] Computed and/alt/rep : 284/795/284 causal constraints (skipped 117 transitions) in 21 ms.
[2024-05-31 20:12:50] [INFO ] Added : 13 causal constraints over 3 iterations in 112 ms. Result :sat
Minimization took 231 ms.
[2024-05-31 20:12:51] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-31 20:12:51] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:51] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-31 20:12:51] [INFO ] [Real]Added 371 Read/Feed constraints in 26 ms returned sat
[2024-05-31 20:12:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:12:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:51] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:51] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-31 20:12:51] [INFO ] [Nat]Added 371 Read/Feed constraints in 31 ms returned sat
[2024-05-31 20:12:51] [INFO ] Computed and/alt/rep : 284/795/284 causal constraints (skipped 117 transitions) in 22 ms.
[2024-05-31 20:12:51] [INFO ] Added : 7 causal constraints over 2 iterations in 78 ms. Result :sat
Minimization took 196 ms.
[2024-05-31 20:12:51] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:51] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:51] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-31 20:12:51] [INFO ] [Real]Added 371 Read/Feed constraints in 27 ms returned sat
[2024-05-31 20:12:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:12:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-31 20:12:51] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:51] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-31 20:12:52] [INFO ] [Nat]Added 371 Read/Feed constraints in 30 ms returned sat
[2024-05-31 20:12:52] [INFO ] Computed and/alt/rep : 284/795/284 causal constraints (skipped 117 transitions) in 22 ms.
[2024-05-31 20:12:52] [INFO ] Added : 6 causal constraints over 2 iterations in 86 ms. Result :sat
Minimization took 210 ms.
[2024-05-31 20:12:52] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:52] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:52] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-31 20:12:52] [INFO ] [Real]Added 371 Read/Feed constraints in 27 ms returned sat
[2024-05-31 20:12:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:12:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-31 20:12:52] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:52] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-31 20:12:52] [INFO ] [Nat]Added 371 Read/Feed constraints in 28 ms returned sat
[2024-05-31 20:12:52] [INFO ] Computed and/alt/rep : 284/795/284 causal constraints (skipped 117 transitions) in 22 ms.
[2024-05-31 20:12:52] [INFO ] Added : 6 causal constraints over 2 iterations in 91 ms. Result :sat
Minimization took 217 ms.
[2024-05-31 20:12:52] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:52] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:12:53] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-31 20:12:53] [INFO ] [Real]Added 371 Read/Feed constraints in 25 ms returned sat
[2024-05-31 20:12:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:12:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 20:12:53] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:12:53] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-31 20:12:53] [INFO ] [Nat]Added 371 Read/Feed constraints in 26 ms returned sat
[2024-05-31 20:12:53] [INFO ] Computed and/alt/rep : 284/795/284 causal constraints (skipped 117 transitions) in 20 ms.
[2024-05-31 20:12:53] [INFO ] Added : 7 causal constraints over 2 iterations in 76 ms. Result :sat
Minimization took 215 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Support contains 10 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 411/411 transitions.
Applied a total of 0 rules in 8 ms. Remains 159 /159 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 159/159 places, 411/411 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 411/411 transitions.
Applied a total of 0 rules in 8 ms. Remains 159 /159 variables (removed 0) and now considering 411/411 (removed 0) transitions.
[2024-05-31 20:12:53] [INFO ] Invariant cache hit.
[2024-05-31 20:12:53] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-31 20:12:53] [INFO ] Invariant cache hit.
[2024-05-31 20:12:53] [INFO ] State equation strengthened by 371 read => feed constraints.
[2024-05-31 20:12:54] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2024-05-31 20:12:54] [INFO ] Redundant transitions in 6 ms returned []
Running 401 sub problems to find dead transitions.
[2024-05-31 20:12:54] [INFO ] Invariant cache hit.
[2024-05-31 20:12:54] [INFO ] State equation strengthened by 371 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 2 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:12:57] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-31 20:12:57] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-31 20:12:57] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
[2024-05-31 20:12:57] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-31 20:12:57] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-31 20:12:58] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:12:58] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-31 20:12:58] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:12:58] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-31 20:12:58] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:12:58] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-31 20:12:58] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:12:58] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:12:58] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:12:58] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-31 20:12:58] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:12:58] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-31 20:12:58] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:12:58] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:12:58] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:12:59] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:12:59] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-05-31 20:12:59] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-31 20:12:59] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:12:59] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-31 20:12:59] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:12:59] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-31 20:12:59] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:12:59] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-31 20:12:59] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:12:59] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-31 20:12:59] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-31 20:13:00] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-31 20:13:00] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:13:00] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-31 20:13:00] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-31 20:13:00] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:13:00] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:13:00] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-31 20:13:00] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-05-31 20:13:00] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:13:00] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-31 20:13:00] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:13:01] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:13:01] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-31 20:13:01] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:13:01] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-31 20:13:01] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-31 20:13:01] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-31 20:13:01] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-31 20:13:01] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-31 20:13:01] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-31 20:13:01] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:13:01] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-31 20:13:01] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-31 20:13:02] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-31 20:13:02] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
[2024-05-31 20:13:02] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:13:02] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:13:02] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:13:02] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:13:02] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-31 20:13:02] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-31 20:13:02] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-31 20:13:02] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-31 20:13:04] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:13:04] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:13:04] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:13:04] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:13:04] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-31 20:13:05] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:13:05] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-31 20:13:05] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:13:05] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-31 20:13:05] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-31 20:13:06] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 2 ms to minimize.
[2024-05-31 20:13:06] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:13:06] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-31 20:13:06] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:13:06] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:13:06] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
[2024-05-31 20:13:06] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:13:06] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 18/130 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-31 20:13:07] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-31 20:13:07] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-31 20:13:07] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:13:07] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-31 20:13:07] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-31 20:13:07] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-31 20:13:07] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-31 20:13:07] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:13:07] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-31 20:13:07] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 2 ms to minimize.
[2024-05-31 20:13:07] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-31 20:13:07] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-31 20:13:07] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:13:07] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:13:08] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:13:08] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:13:09] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 17/147 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-31 20:13:09] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-31 20:13:10] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:13:10] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:13:10] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-31 20:13:10] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:13:10] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:13:10] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:13:10] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-31 20:13:10] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:13:10] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:13:10] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:13:10] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:13:10] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-31 20:13:11] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 14/161 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-31 20:13:13] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:13:13] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-31 20:13:13] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:13:14] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-31 20:13:14] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-31 20:13:15] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-31 20:13:15] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:13:15] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-31 20:13:15] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-31 20:13:15] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-31 20:13:15] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 5/172 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-31 20:13:17] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:13:17] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-31 20:13:17] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-31 20:13:17] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-31 20:13:17] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-31 20:13:18] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-31 20:13:19] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-31 20:13:21] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-31 20:13:21] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-05-31 20:13:21] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:13:22] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-31 20:13:22] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:13:22] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/570 variables, and 185 constraints, problems are : Problem set: 0 solved, 401 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/159 constraints, ReadFeed: 0/371 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 173/173 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 173/185 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-31 20:13:25] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-31 20:13:25] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 411/569 variables, 158/345 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Problem TDEAD158 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 371/716 constraints. Problems are: Problem set: 1 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 400/1116 constraints. Problems are: Problem set: 1 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 0/1116 constraints. Problems are: Problem set: 1 solved, 400 unsolved
At refinement iteration 9 (OVERLAPS) 1/570 variables, 1/1117 constraints. Problems are: Problem set: 1 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 1117 constraints, problems are : Problem set: 1 solved, 400 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 159/159 constraints, ReadFeed: 371/371 constraints, PredecessorRefiner: 400/401 constraints, Known Traps: 175/175 constraints]
After SMT, in 60135ms problems are : Problem set: 1 solved, 400 unsolved
Search for dead transitions found 1 dead transitions in 60145ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 159/159 places, 410/411 transitions.
Graph (complete) has 711 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 158 /159 variables (removed 1) and now considering 410/410 (removed 0) transitions.
// Phase 1: matrix 410 rows 158 cols
[2024-05-31 20:13:54] [INFO ] Computed 11 invariants in 5 ms
[2024-05-31 20:13:54] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-31 20:13:54] [INFO ] Invariant cache hit.
[2024-05-31 20:13:54] [INFO ] State equation strengthened by 370 read => feed constraints.
[2024-05-31 20:13:55] [INFO ] Implicit Places using invariants and state equation in 663 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 755 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 157/159 places, 410/411 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 155 transition count 408
Applied a total of 4 rules in 18 ms. Remains 155 /157 variables (removed 2) and now considering 408/410 (removed 2) transitions.
// Phase 1: matrix 408 rows 155 cols
[2024-05-31 20:13:55] [INFO ] Computed 10 invariants in 3 ms
[2024-05-31 20:13:55] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 20:13:55] [INFO ] Invariant cache hit.
[2024-05-31 20:13:55] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:13:55] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 155/159 places, 408/411 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 62116 ms. Remains : 155/159 places, 408/411 transitions.
[2024-05-31 20:13:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
RANDOM walk for 1000000 steps (20129 resets) in 2274 ms. (439 steps per ms)
BEST_FIRST walk for 10000009 steps (19664 resets) in 4953 ms. (2018 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
[2024-05-31 20:14:02] [INFO ] Invariant cache hit.
[2024-05-31 20:14:02] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:14:02] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:14:02] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-31 20:14:02] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:14:03] [INFO ] [Real]Added 361 Read/Feed constraints in 25 ms returned sat
[2024-05-31 20:14:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:14:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:14:03] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:14:03] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-31 20:14:03] [INFO ] [Nat]Added 361 Read/Feed constraints in 26 ms returned sat
[2024-05-31 20:14:03] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 21 ms.
[2024-05-31 20:14:03] [INFO ] Added : 7 causal constraints over 2 iterations in 77 ms. Result :sat
Minimization took 175 ms.
[2024-05-31 20:14:03] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:14:03] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:14:03] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-31 20:14:03] [INFO ] [Real]Added 361 Read/Feed constraints in 22 ms returned sat
[2024-05-31 20:14:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:14:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-31 20:14:03] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:14:03] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-31 20:14:03] [INFO ] [Nat]Added 361 Read/Feed constraints in 25 ms returned sat
[2024-05-31 20:14:03] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 20 ms.
[2024-05-31 20:14:03] [INFO ] Added : 9 causal constraints over 3 iterations in 96 ms. Result :sat
Minimization took 188 ms.
[2024-05-31 20:14:03] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:14:03] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:14:04] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-31 20:14:04] [INFO ] [Real]Added 361 Read/Feed constraints in 24 ms returned sat
[2024-05-31 20:14:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:14:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:14:04] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:14:04] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-31 20:14:04] [INFO ] [Nat]Added 361 Read/Feed constraints in 41 ms returned sat
[2024-05-31 20:14:04] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 23 ms.
[2024-05-31 20:14:04] [INFO ] Added : 13 causal constraints over 3 iterations in 104 ms. Result :sat
Minimization took 187 ms.
[2024-05-31 20:14:04] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:14:04] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:14:04] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-31 20:14:04] [INFO ] [Real]Added 361 Read/Feed constraints in 23 ms returned sat
[2024-05-31 20:14:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:14:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:14:04] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:14:04] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-31 20:14:04] [INFO ] [Nat]Added 361 Read/Feed constraints in 31 ms returned sat
[2024-05-31 20:14:04] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 22 ms.
[2024-05-31 20:14:04] [INFO ] Added : 9 causal constraints over 2 iterations in 83 ms. Result :sat
Minimization took 173 ms.
[2024-05-31 20:14:05] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:14:05] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:14:05] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-31 20:14:05] [INFO ] [Real]Added 361 Read/Feed constraints in 23 ms returned sat
[2024-05-31 20:14:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:14:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:14:05] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:14:05] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-31 20:14:05] [INFO ] [Nat]Added 361 Read/Feed constraints in 30 ms returned sat
[2024-05-31 20:14:05] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 21 ms.
[2024-05-31 20:14:05] [INFO ] Added : 5 causal constraints over 1 iterations in 66 ms. Result :sat
Minimization took 173 ms.
[2024-05-31 20:14:05] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:14:05] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:14:05] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-31 20:14:05] [INFO ] [Real]Added 361 Read/Feed constraints in 23 ms returned sat
[2024-05-31 20:14:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:14:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-31 20:14:05] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:14:05] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-31 20:14:05] [INFO ] [Nat]Added 361 Read/Feed constraints in 27 ms returned sat
[2024-05-31 20:14:05] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 22 ms.
[2024-05-31 20:14:05] [INFO ] Added : 8 causal constraints over 2 iterations in 79 ms. Result :sat
Minimization took 190 ms.
[2024-05-31 20:14:06] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:14:06] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 20:14:06] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-31 20:14:06] [INFO ] [Real]Added 361 Read/Feed constraints in 24 ms returned sat
[2024-05-31 20:14:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:14:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:14:06] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:14:06] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-31 20:14:06] [INFO ] [Nat]Added 361 Read/Feed constraints in 38 ms returned sat
[2024-05-31 20:14:06] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 24 ms.
[2024-05-31 20:14:06] [INFO ] Added : 11 causal constraints over 3 iterations in 101 ms. Result :sat
Minimization took 168 ms.
[2024-05-31 20:14:06] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:14:06] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:14:06] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-31 20:14:06] [INFO ] [Real]Added 361 Read/Feed constraints in 25 ms returned sat
[2024-05-31 20:14:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:14:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:14:06] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:14:07] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-31 20:14:07] [INFO ] [Nat]Added 361 Read/Feed constraints in 27 ms returned sat
[2024-05-31 20:14:07] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 26 ms.
[2024-05-31 20:14:07] [INFO ] Added : 6 causal constraints over 2 iterations in 87 ms. Result :sat
Minimization took 181 ms.
[2024-05-31 20:14:07] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:14:07] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:14:07] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-31 20:14:07] [INFO ] [Real]Added 361 Read/Feed constraints in 26 ms returned sat
[2024-05-31 20:14:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:14:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:14:07] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:14:07] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-31 20:14:07] [INFO ] [Nat]Added 361 Read/Feed constraints in 29 ms returned sat
[2024-05-31 20:14:07] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 22 ms.
[2024-05-31 20:14:07] [INFO ] Added : 6 causal constraints over 2 iterations in 77 ms. Result :sat
Minimization took 171 ms.
[2024-05-31 20:14:07] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:14:07] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:14:07] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-31 20:14:08] [INFO ] [Real]Added 361 Read/Feed constraints in 24 ms returned sat
[2024-05-31 20:14:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:14:08] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:14:08] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:14:08] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-31 20:14:08] [INFO ] [Nat]Added 361 Read/Feed constraints in 29 ms returned sat
[2024-05-31 20:14:08] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 21 ms.
[2024-05-31 20:14:08] [INFO ] Added : 7 causal constraints over 2 iterations in 86 ms. Result :sat
Minimization took 179 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Support contains 10 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Applied a total of 0 rules in 7 ms. Remains 155 /155 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 155/155 places, 408/408 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 408/408 (removed 0) transitions.
[2024-05-31 20:14:08] [INFO ] Invariant cache hit.
[2024-05-31 20:14:08] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-31 20:14:08] [INFO ] Invariant cache hit.
[2024-05-31 20:14:08] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:14:09] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2024-05-31 20:14:09] [INFO ] Redundant transitions in 16 ms returned []
Running 398 sub problems to find dead transitions.
[2024-05-31 20:14:09] [INFO ] Invariant cache hit.
[2024-05-31 20:14:09] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (OVERLAPS) 408/562 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 361/525 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 6 (OVERLAPS) 1/563 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 8 (OVERLAPS) 0/563 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 398 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 526 constraints, problems are : Problem set: 0 solved, 398 unsolved in 29391 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (OVERLAPS) 408/562 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 361/525 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 398/923 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 7 (OVERLAPS) 1/563 variables, 1/924 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 9 (OVERLAPS) 0/563 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 398 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 924 constraints, problems are : Problem set: 0 solved, 398 unsolved in 20542 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 0/0 constraints]
After SMT, in 50016ms problems are : Problem set: 0 solved, 398 unsolved
Search for dead transitions found 0 dead transitions in 50020ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50631 ms. Remains : 155/155 places, 408/408 transitions.
RANDOM walk for 40000 steps (811 resets) in 1109 ms. (36 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 753503 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 20
Probabilistic random walk after 753503 steps, saw 98771 distinct states, run finished after 3004 ms. (steps per millisecond=250 ) properties seen :0
[2024-05-31 20:15:02] [INFO ] Invariant cache hit.
[2024-05-31 20:15:02] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 249/299 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 45/81 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 239/538 variables, 100/181 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 310/496 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 1/539 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 5/544 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/544 variables, 5/504 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (OVERLAPS) 5/549 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/549 variables, 5/512 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/549 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 20 unsolved
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
At refinement iteration 19 (OVERLAPS) 14/563 variables, 8/520 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/563 variables, 6/526 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/563 variables, 0/526 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 0/563 variables, 0/526 constraints. Problems are: Problem set: 10 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 526 constraints, problems are : Problem set: 10 solved, 10 unsolved in 2339 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 10/10 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 249/299 variables, 26/36 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 45/81 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/81 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 239/538 variables, 100/181 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 5/186 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 310/496 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 6/502 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/502 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1/539 variables, 1/503 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 1/504 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 0/504 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 5/544 variables, 1/505 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 5/510 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/544 variables, 3/513 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/544 variables, 0/513 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 5/549 variables, 3/516 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/549 variables, 5/521 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/549 variables, 1/522 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/549 variables, 0/522 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 14/563 variables, 8/530 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/563 variables, 6/536 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/563 variables, 0/536 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 0/563 variables, 0/536 constraints. Problems are: Problem set: 10 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 536 constraints, problems are : Problem set: 10 solved, 10 unsolved in 1493 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 10/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 3844ms problems are : Problem set: 10 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 912 ms.
Support contains 10 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Applied a total of 0 rules in 15 ms. Remains 155 /155 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 155/155 places, 408/408 transitions.
RANDOM walk for 40000 steps (802 resets) in 256 ms. (155 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (78 resets) in 56 ms. (701 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (75 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (80 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (75 resets) in 82 ms. (481 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (77 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (79 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (77 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (80 resets) in 53 ms. (740 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (77 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (73 resets) in 52 ms. (754 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 743237 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :0 out of 10
Probabilistic random walk after 743237 steps, saw 97586 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :0
[2024-05-31 20:15:10] [INFO ] Invariant cache hit.
[2024-05-31 20:15:10] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 249/299 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 45/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 239/538 variables, 100/181 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 310/496 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1/539 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 5/544 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/544 variables, 5/504 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 5/549 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/549 variables, 5/512 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/549 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 14/563 variables, 8/520 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/563 variables, 6/526 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/563 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 0/563 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 526 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1080 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 249/299 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 45/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 239/538 variables, 100/181 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 310/496 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 6/502 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1/539 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 5/544 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 5/510 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/544 variables, 3/513 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/544 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 5/549 variables, 3/516 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/549 variables, 5/521 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/549 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/549 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 14/563 variables, 8/530 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/563 variables, 6/536 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/563 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 0/563 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 536 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1601 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 2701ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 951 ms.
Support contains 10 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Applied a total of 0 rules in 10 ms. Remains 155 /155 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 155/155 places, 408/408 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Applied a total of 0 rules in 7 ms. Remains 155 /155 variables (removed 0) and now considering 408/408 (removed 0) transitions.
[2024-05-31 20:15:14] [INFO ] Invariant cache hit.
[2024-05-31 20:15:14] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-31 20:15:14] [INFO ] Invariant cache hit.
[2024-05-31 20:15:14] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:15:15] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2024-05-31 20:15:15] [INFO ] Redundant transitions in 7 ms returned []
Running 398 sub problems to find dead transitions.
[2024-05-31 20:15:15] [INFO ] Invariant cache hit.
[2024-05-31 20:15:15] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (OVERLAPS) 408/562 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 361/525 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 6 (OVERLAPS) 1/563 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 8 (OVERLAPS) 0/563 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 398 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 526 constraints, problems are : Problem set: 0 solved, 398 unsolved in 29568 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (OVERLAPS) 408/562 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 361/525 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 398/923 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 7 (OVERLAPS) 1/563 variables, 1/924 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 9 (OVERLAPS) 0/563 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 398 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 924 constraints, problems are : Problem set: 0 solved, 398 unsolved in 20293 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 0/0 constraints]
After SMT, in 49946ms problems are : Problem set: 0 solved, 398 unsolved
Search for dead transitions found 0 dead transitions in 49950ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50527 ms. Remains : 155/155 places, 408/408 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 314 edges and 155 vertex of which 103 / 155 are part of one of the 3 SCC in 2 ms
Free SCC test removed 100 places
Drop transitions (Empty/Sink Transition effects.) removed 240 transitions
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 329 transitions.
Graph (complete) has 134 edges and 55 vertex of which 25 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 25 transition count 49
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 31 place count 17 transition count 41
Iterating global reduction 1 with 8 rules applied. Total rules applied 39 place count 17 transition count 41
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 41 place count 16 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 16 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 16 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 14 transition count 36
Applied a total of 45 rules in 16 ms. Remains 14 /155 variables (removed 141) and now considering 36/408 (removed 372) transitions.
Running SMT prover for 10 properties.
[2024-05-31 20:16:04] [INFO ] Flow matrix only has 34 transitions (discarded 2 similar events)
// Phase 1: matrix 34 rows 14 cols
[2024-05-31 20:16:04] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 20:16:05] [INFO ] After 21ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:9
TRAPS : Iteration 0
[2024-05-31 20:16:05] [INFO ] After 28ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-31 20:16:05] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-31 20:16:05] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-05-31 20:16:05] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-05-31 20:16:05] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 170 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Starting property specific reduction for CANInsertWithFailure-PT-010-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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-31 20:16:05] [INFO ] Computed 10 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (201 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (20 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:16:05] [INFO ] Invariant cache hit.
[2024-05-31 20:16:05] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-05-31 20:16:05] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:16:05] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-31 20:16:05] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:16:05] [INFO ] [Real]Added 361 Read/Feed constraints in 28 ms returned sat
[2024-05-31 20:16:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:16:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-31 20:16:05] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:16:05] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-31 20:16:05] [INFO ] [Nat]Added 361 Read/Feed constraints in 29 ms returned sat
[2024-05-31 20:16:05] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 20 ms.
[2024-05-31 20:16:05] [INFO ] Added : 7 causal constraints over 2 iterations in 78 ms. Result :sat
Minimization took 189 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 405
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 152 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 151 transition count 404
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 151 transition count 404
Applied a total of 15 rules in 26 ms. Remains 151 /155 variables (removed 4) and now considering 404/408 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 151/155 places, 404/408 transitions.
// Phase 1: matrix 404 rows 151 cols
[2024-05-31 20:16:05] [INFO ] Computed 10 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20469 resets) in 2223 ms. (449 steps per ms)
BEST_FIRST walk for 1000001 steps (1987 resets) in 509 ms. (1960 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:16:08] [INFO ] Invariant cache hit.
[2024-05-31 20:16:08] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:16:08] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:16:08] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-31 20:16:08] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-31 20:16:08] [INFO ] [Real]Added 374 Read/Feed constraints in 27 ms returned sat
[2024-05-31 20:16:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:16:08] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-31 20:16:08] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:16:08] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-31 20:16:08] [INFO ] [Nat]Added 374 Read/Feed constraints in 27 ms returned sat
[2024-05-31 20:16:08] [INFO ] Computed and/alt/rep : 261/724/261 causal constraints (skipped 133 transitions) in 20 ms.
[2024-05-31 20:16:08] [INFO ] Added : 4 causal constraints over 1 iterations in 71 ms. Result :sat
Minimization took 254 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 12 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 151/151 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 7 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-31 20:16:09] [INFO ] Invariant cache hit.
[2024-05-31 20:16:09] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-31 20:16:09] [INFO ] Invariant cache hit.
[2024-05-31 20:16:09] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-31 20:16:09] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2024-05-31 20:16:09] [INFO ] Redundant transitions in 4 ms returned []
Running 394 sub problems to find dead transitions.
[2024-05-31 20:16:09] [INFO ] Invariant cache hit.
[2024-05-31 20:16:09] [INFO ] State equation strengthened by 374 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Problem TDEAD400 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 1/555 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 535 constraints, problems are : Problem set: 1 solved, 393 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 1 solved, 393 unsolved
Problem TDEAD136 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 392/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 1/555 variables, 1/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 927 constraints, problems are : Problem set: 2 solved, 392 unsolved in 25707 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 392/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 55806ms problems are : Problem set: 2 solved, 392 unsolved
Search for dead transitions found 2 dead transitions in 55810ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 151/151 places, 402/404 transitions.
Graph (complete) has 708 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 149 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 149 transition count 400
Applied a total of 3 rules in 10 ms. Remains 149 /151 variables (removed 2) and now considering 400/402 (removed 2) transitions.
// Phase 1: matrix 400 rows 149 cols
[2024-05-31 20:17:05] [INFO ] Computed 11 invariants in 3 ms
[2024-05-31 20:17:05] [INFO ] Implicit Places using invariants in 92 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 148/151 places, 400/404 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 147 transition count 399
Applied a total of 10 rules in 19 ms. Remains 147 /148 variables (removed 1) and now considering 399/400 (removed 1) transitions.
// Phase 1: matrix 399 rows 147 cols
[2024-05-31 20:17:05] [INFO ] Computed 10 invariants in 3 ms
[2024-05-31 20:17:05] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-31 20:17:05] [INFO ] Invariant cache hit.
[2024-05-31 20:17:05] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-31 20:17:06] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 147/151 places, 399/404 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 57130 ms. Remains : 147/151 places, 399/404 transitions.
[2024-05-31 20:17:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22554 resets) in 2198 ms. (454 steps per ms)
BEST_FIRST walk for 1000001 steps (2098 resets) in 474 ms. (2105 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:17:08] [INFO ] Invariant cache hit.
[2024-05-31 20:17:08] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-31 20:17:08] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:17:09] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-31 20:17:09] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-31 20:17:09] [INFO ] [Real]Added 362 Read/Feed constraints in 25 ms returned sat
[2024-05-31 20:17:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:17:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-31 20:17:09] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:17:09] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-31 20:17:09] [INFO ] [Nat]Added 362 Read/Feed constraints in 24 ms returned sat
[2024-05-31 20:17:09] [INFO ] Computed and/alt/rep : 229/578/229 causal constraints (skipped 160 transitions) in 19 ms.
[2024-05-31 20:17:09] [INFO ] Added : 4 causal constraints over 1 iterations in 62 ms. Result :sat
Minimization took 142 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 14 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 8 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-31 20:17:09] [INFO ] Invariant cache hit.
[2024-05-31 20:17:09] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-31 20:17:09] [INFO ] Invariant cache hit.
[2024-05-31 20:17:09] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-31 20:17:10] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
[2024-05-31 20:17:10] [INFO ] Redundant transitions in 3 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-31 20:17:10] [INFO ] Invariant cache hit.
[2024-05-31 20:17:10] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-31 20:17:12] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-31 20:17:13] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 28500 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 24172 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 52762ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 52767ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53348 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (899 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (81 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (79 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1235314 steps, run timeout after 3001 ms. (steps per millisecond=411 ) properties seen :0 out of 2
Probabilistic random walk after 1235314 steps, saw 150114 distinct states, run finished after 3001 ms. (steps per millisecond=411 ) properties seen :0
[2024-05-31 20:18:05] [INFO ] Invariant cache hit.
[2024-05-31 20:18:05] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 146/202 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 116/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 23/225 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/236 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:18:06] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-31 20:18:06] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-05-31 20:18:06] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 268/504 variables, 64/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 231/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 20 (OVERLAPS) 42/546 variables, 36/516 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 6/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/546 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 522 constraints, problems are : Problem set: 1 solved, 1 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 146/202 variables, 31/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 116/162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/225 variables, 1/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 6/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/236 variables, 8/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 5/182 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 1/183 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 3/186 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/236 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 268/504 variables, 64/250 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 231/481 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/504 variables, 0/481 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/546 variables, 36/517 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 6/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/546 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 523 constraints, problems are : Problem set: 1 solved, 1 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 471ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 8 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (906 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (82 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1725114 steps, run timeout after 3001 ms. (steps per millisecond=574 ) properties seen :0 out of 1
Probabilistic random walk after 1725114 steps, saw 209101 distinct states, run finished after 3001 ms. (steps per millisecond=574 ) properties seen :0
[2024-05-31 20:18:09] [INFO ] Invariant cache hit.
[2024-05-31 20:18:09] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 146/202 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 116/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/225 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/236 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 268/504 variables, 64/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/504 variables, 231/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/546 variables, 36/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 146/202 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 116/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/225 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/236 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 268/504 variables, 64/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 231/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 42/546 variables, 36/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 6/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 318ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-31 20:18:09] [INFO ] Invariant cache hit.
[2024-05-31 20:18:09] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-31 20:18:09] [INFO ] Invariant cache hit.
[2024-05-31 20:18:09] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-31 20:18:10] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-05-31 20:18:10] [INFO ] Redundant transitions in 4 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-31 20:18:10] [INFO ] Invariant cache hit.
[2024-05-31 20:18:10] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-31 20:18:12] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-31 20:18:13] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 28824 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 24101 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 53009ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 53013ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53562 ms. Remains : 147/147 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 325 edges and 147 vertex of which 107 / 147 are part of one of the 3 SCC in 1 ms
Free SCC test removed 104 places
Drop transitions (Empty/Sink Transition effects.) removed 260 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 354 transitions.
Graph (complete) has 97 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 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 21 rules applied. Total rules applied 23 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 2 transition count 3
Applied a total of 43 rules in 3 ms. Remains 2 /147 variables (removed 145) and now considering 3/399 (removed 396) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-31 20:19:03] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 20:19:03] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:19:03] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:19:03] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:19:03] [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 42 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-00 in 178229 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-31 20:19:03] [INFO ] Computed 10 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (201 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (18 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:19:03] [INFO ] Invariant cache hit.
[2024-05-31 20:19:03] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:19:03] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:19:03] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-31 20:19:03] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:19:03] [INFO ] [Real]Added 361 Read/Feed constraints in 22 ms returned sat
[2024-05-31 20:19:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:19:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:19:03] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:19:03] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-31 20:19:03] [INFO ] [Nat]Added 361 Read/Feed constraints in 31 ms returned sat
[2024-05-31 20:19:03] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 22 ms.
[2024-05-31 20:19:03] [INFO ] Added : 9 causal constraints over 3 iterations in 107 ms. Result :sat
Minimization took 191 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 405
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 152 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 151 transition count 404
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 151 transition count 404
Applied a total of 15 rules in 25 ms. Remains 151 /155 variables (removed 4) and now considering 404/408 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 151/155 places, 404/408 transitions.
// Phase 1: matrix 404 rows 151 cols
[2024-05-31 20:19:04] [INFO ] Computed 10 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20509 resets) in 2173 ms. (459 steps per ms)
BEST_FIRST walk for 1000001 steps (1961 resets) in 485 ms. (2057 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:19:06] [INFO ] Invariant cache hit.
[2024-05-31 20:19:06] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:19:06] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:19:06] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-31 20:19:06] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-31 20:19:06] [INFO ] [Real]Added 374 Read/Feed constraints in 24 ms returned sat
[2024-05-31 20:19:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:19:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:19:06] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:19:06] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-31 20:19:06] [INFO ] [Nat]Added 374 Read/Feed constraints in 23 ms returned sat
[2024-05-31 20:19:06] [INFO ] Computed and/alt/rep : 261/724/261 causal constraints (skipped 133 transitions) in 19 ms.
[2024-05-31 20:19:06] [INFO ] Added : 5 causal constraints over 1 iterations in 58 ms. Result :sat
Minimization took 240 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 151/151 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-31 20:19:07] [INFO ] Invariant cache hit.
[2024-05-31 20:19:07] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-31 20:19:07] [INFO ] Invariant cache hit.
[2024-05-31 20:19:07] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-31 20:19:07] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2024-05-31 20:19:07] [INFO ] Redundant transitions in 5 ms returned []
Running 394 sub problems to find dead transitions.
[2024-05-31 20:19:07] [INFO ] Invariant cache hit.
[2024-05-31 20:19:07] [INFO ] State equation strengthened by 374 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Problem TDEAD400 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 1/555 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 535 constraints, problems are : Problem set: 1 solved, 393 unsolved in 29491 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 1 solved, 393 unsolved
Problem TDEAD136 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 392/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 1/555 variables, 1/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 927 constraints, problems are : Problem set: 2 solved, 392 unsolved in 25300 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 392/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 54877ms problems are : Problem set: 2 solved, 392 unsolved
Search for dead transitions found 2 dead transitions in 54881ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 151/151 places, 402/404 transitions.
Graph (complete) has 707 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 149 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 149 transition count 400
Applied a total of 3 rules in 6 ms. Remains 149 /151 variables (removed 2) and now considering 400/402 (removed 2) transitions.
// Phase 1: matrix 400 rows 149 cols
[2024-05-31 20:20:02] [INFO ] Computed 11 invariants in 2 ms
[2024-05-31 20:20:02] [INFO ] Implicit Places using invariants in 90 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 148/151 places, 400/404 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 147 transition count 399
Applied a total of 10 rules in 12 ms. Remains 147 /148 variables (removed 1) and now considering 399/400 (removed 1) transitions.
// Phase 1: matrix 399 rows 147 cols
[2024-05-31 20:20:02] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 20:20:02] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-31 20:20:02] [INFO ] Invariant cache hit.
[2024-05-31 20:20:03] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-31 20:20:03] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 147/151 places, 399/404 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 56154 ms. Remains : 147/151 places, 399/404 transitions.
[2024-05-31 20:20:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22618 resets) in 2193 ms. (455 steps per ms)
BEST_FIRST walk for 1000001 steps (2058 resets) in 474 ms. (2105 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:20:06] [INFO ] Invariant cache hit.
[2024-05-31 20:20:06] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-31 20:20:06] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:20:06] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-31 20:20:06] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-31 20:20:06] [INFO ] [Real]Added 362 Read/Feed constraints in 25 ms returned sat
[2024-05-31 20:20:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:20:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:20:06] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:20:06] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-31 20:20:06] [INFO ] [Nat]Added 362 Read/Feed constraints in 29 ms returned sat
[2024-05-31 20:20:06] [INFO ] Computed and/alt/rep : 229/578/229 causal constraints (skipped 160 transitions) in 20 ms.
[2024-05-31 20:20:06] [INFO ] Added : 7 causal constraints over 2 iterations in 81 ms. Result :sat
Minimization took 188 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-31 20:20:06] [INFO ] Invariant cache hit.
[2024-05-31 20:20:06] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-31 20:20:06] [INFO ] Invariant cache hit.
[2024-05-31 20:20:06] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-31 20:20:07] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2024-05-31 20:20:07] [INFO ] Redundant transitions in 6 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-31 20:20:07] [INFO ] Invariant cache hit.
[2024-05-31 20:20:07] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-31 20:20:09] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-31 20:20:10] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 28927 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 23779 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 52791ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 52795ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53390 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (907 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (79 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (82 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1141498 steps, run timeout after 3001 ms. (steps per millisecond=380 ) properties seen :0 out of 2
Probabilistic random walk after 1141498 steps, saw 139617 distinct states, run finished after 3001 ms. (steps per millisecond=380 ) properties seen :0
[2024-05-31 20:21:03] [INFO ] Invariant cache hit.
[2024-05-31 20:21:03] [INFO ] State equation strengthened by 362 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 281/335 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 246/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/345 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 10/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/357 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/357 variables, 12/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 10/367 variables, 7/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 19 (OVERLAPS) 179/546 variables, 72/412 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 107/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 519 constraints, problems are : Problem set: 1 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/54 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 281/335 variables, 38/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 246/299 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/299 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/345 variables, 1/300 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 10/310 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 1/311 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 0/311 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/357 variables, 1/312 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 12/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/367 variables, 7/331 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 10/341 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 179/546 variables, 72/413 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 107/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/546 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 520 constraints, problems are : Problem set: 1 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 405ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (910 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (80 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1727515 steps, run timeout after 3001 ms. (steps per millisecond=575 ) properties seen :0 out of 1
Probabilistic random walk after 1727515 steps, saw 209365 distinct states, run finished after 3001 ms. (steps per millisecond=575 ) properties seen :0
[2024-05-31 20:21:06] [INFO ] Invariant cache hit.
[2024-05-31 20:21:06] [INFO ] State equation strengthened by 362 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 281/335 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 246/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/345 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 10/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/357 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/357 variables, 12/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/367 variables, 7/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 179/546 variables, 72/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 107/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 281/335 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 246/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/345 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 10/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/357 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 12/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/367 variables, 7/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 10/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 179/546 variables, 72/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 107/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 332ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-31 20:21:06] [INFO ] Invariant cache hit.
[2024-05-31 20:21:07] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-31 20:21:07] [INFO ] Invariant cache hit.
[2024-05-31 20:21:07] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-31 20:21:07] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2024-05-31 20:21:07] [INFO ] Redundant transitions in 2 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-31 20:21:07] [INFO ] Invariant cache hit.
[2024-05-31 20:21:07] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-31 20:21:09] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-31 20:21:10] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 29906 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 24560 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 54546ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 54550ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55124 ms. Remains : 147/147 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 147 vertex of which 107 / 147 are part of one of the 3 SCC in 1 ms
Free SCC test removed 104 places
Drop transitions (Empty/Sink Transition effects.) removed 260 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 352 transitions.
Graph (complete) has 98 edges and 43 vertex of which 13 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 13 transition count 16
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 6 transition count 9
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 6 transition count 9
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 4 transition count 7
Applied a total of 38 rules in 10 ms. Remains 4 /147 variables (removed 143) and now considering 7/399 (removed 392) transitions.
Running SMT prover for 1 properties.
[2024-05-31 20:22:02] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 4 cols
[2024-05-31 20:22:02] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 20:22:02] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:22:02] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:22:02] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:22:02] [INFO ] After 19ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 58 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-01 in 178729 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-31 20:22:02] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (203 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (21 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:22:02] [INFO ] Invariant cache hit.
[2024-05-31 20:22:02] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:22:02] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:22:02] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-31 20:22:02] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:22:02] [INFO ] [Real]Added 361 Read/Feed constraints in 25 ms returned sat
[2024-05-31 20:22:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:22:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:22:02] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:22:02] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-31 20:22:02] [INFO ] [Nat]Added 361 Read/Feed constraints in 41 ms returned sat
[2024-05-31 20:22:02] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 21 ms.
[2024-05-31 20:22:02] [INFO ] Added : 13 causal constraints over 3 iterations in 108 ms. Result :sat
Minimization took 193 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 405
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 152 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 151 transition count 404
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 151 transition count 404
Applied a total of 15 rules in 19 ms. Remains 151 /155 variables (removed 4) and now considering 404/408 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 151/155 places, 404/408 transitions.
// Phase 1: matrix 404 rows 151 cols
[2024-05-31 20:22:02] [INFO ] Computed 10 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20421 resets) in 2134 ms. (468 steps per ms)
BEST_FIRST walk for 1000001 steps (2023 resets) in 473 ms. (2109 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:22:05] [INFO ] Invariant cache hit.
[2024-05-31 20:22:05] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:22:05] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:22:05] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-31 20:22:05] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-31 20:22:05] [INFO ] [Real]Added 374 Read/Feed constraints in 25 ms returned sat
[2024-05-31 20:22:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:22:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:22:05] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:22:05] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-31 20:22:05] [INFO ] [Nat]Added 374 Read/Feed constraints in 29 ms returned sat
[2024-05-31 20:22:05] [INFO ] Computed and/alt/rep : 260/715/260 causal constraints (skipped 134 transitions) in 22 ms.
[2024-05-31 20:22:05] [INFO ] Added : 8 causal constraints over 2 iterations in 87 ms. Result :sat
Minimization took 240 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 6 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 151/151 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 7 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-31 20:22:05] [INFO ] Invariant cache hit.
[2024-05-31 20:22:06] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-31 20:22:06] [INFO ] Invariant cache hit.
[2024-05-31 20:22:06] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-31 20:22:06] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2024-05-31 20:22:06] [INFO ] Redundant transitions in 6 ms returned []
Running 394 sub problems to find dead transitions.
[2024-05-31 20:22:06] [INFO ] Invariant cache hit.
[2024-05-31 20:22:06] [INFO ] State equation strengthened by 374 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Problem TDEAD400 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 1/555 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 535 constraints, problems are : Problem set: 1 solved, 393 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 393/927 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/927 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 7 (OVERLAPS) 1/555 variables, 1/928 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/928 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/928 constraints. Problems are: Problem set: 1 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 928 constraints, problems are : Problem set: 1 solved, 393 unsolved in 24908 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 393/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 55007ms problems are : Problem set: 1 solved, 393 unsolved
Search for dead transitions found 1 dead transitions in 55010ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 151/151 places, 403/404 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 150 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 150 transition count 401
Applied a total of 2 rules in 6 ms. Remains 150 /151 variables (removed 1) and now considering 401/403 (removed 2) transitions.
// Phase 1: matrix 401 rows 150 cols
[2024-05-31 20:23:01] [INFO ] Computed 10 invariants in 4 ms
[2024-05-31 20:23:01] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 20:23:01] [INFO ] Invariant cache hit.
[2024-05-31 20:23:01] [INFO ] State equation strengthened by 372 read => feed constraints.
[2024-05-31 20:23:02] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 150/151 places, 401/404 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 56220 ms. Remains : 150/151 places, 401/404 transitions.
[2024-05-31 20:23:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20441 resets) in 2142 ms. (466 steps per ms)
BEST_FIRST walk for 1000001 steps (2005 resets) in 482 ms. (2070 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:23:04] [INFO ] Invariant cache hit.
[2024-05-31 20:23:04] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-31 20:23:04] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:23:04] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-31 20:23:04] [INFO ] State equation strengthened by 372 read => feed constraints.
[2024-05-31 20:23:04] [INFO ] [Real]Added 372 Read/Feed constraints in 25 ms returned sat
[2024-05-31 20:23:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:23:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:23:05] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:23:05] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-31 20:23:05] [INFO ] [Nat]Added 372 Read/Feed constraints in 31 ms returned sat
[2024-05-31 20:23:05] [INFO ] Computed and/alt/rep : 255/665/255 causal constraints (skipped 136 transitions) in 20 ms.
[2024-05-31 20:23:05] [INFO ] Added : 5 causal constraints over 1 iterations in 63 ms. Result :sat
Minimization took 187 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 401/401 transitions.
Applied a total of 0 rules in 7 ms. Remains 150 /150 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 150/150 places, 401/401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-31 20:23:05] [INFO ] Invariant cache hit.
[2024-05-31 20:23:05] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-31 20:23:05] [INFO ] Invariant cache hit.
[2024-05-31 20:23:05] [INFO ] State equation strengthened by 372 read => feed constraints.
[2024-05-31 20:23:05] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2024-05-31 20:23:05] [INFO ] Redundant transitions in 5 ms returned []
Running 391 sub problems to find dead transitions.
[2024-05-31 20:23:05] [INFO ] Invariant cache hit.
[2024-05-31 20:23:05] [INFO ] State equation strengthened by 372 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/550 variables, 149/159 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 372/531 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (OVERLAPS) 1/551 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 8 (OVERLAPS) 0/551 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 532 constraints, problems are : Problem set: 0 solved, 391 unsolved in 28775 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/550 variables, 149/159 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 372/531 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 391/922 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (OVERLAPS) 1/551 variables, 1/923 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 9 (OVERLAPS) 0/551 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 923 constraints, problems are : Problem set: 0 solved, 391 unsolved in 17776 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
After SMT, in 46632ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 46635ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47220 ms. Remains : 150/150 places, 401/401 transitions.
RANDOM walk for 40000 steps (815 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (75 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (78 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1240744 steps, run timeout after 3001 ms. (steps per millisecond=413 ) properties seen :0 out of 2
Probabilistic random walk after 1240744 steps, saw 158048 distinct states, run finished after 3001 ms. (steps per millisecond=413 ) properties seen :0
[2024-05-31 20:23:55] [INFO ] Invariant cache hit.
[2024-05-31 20:23:55] [INFO ] State equation strengthened by 372 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/43 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 81/124 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 60/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 14/138 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/149 variables, 8/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 330/479 variables, 52/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 294/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 19 (OVERLAPS) 72/551 variables, 64/524 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 8/532 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/551 variables, 0/532 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/551 variables, 0/532 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 532 constraints, problems are : Problem set: 1 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/43 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 10/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 81/124 variables, 21/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 1/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 60/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/138 variables, 1/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 4/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/149 variables, 8/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 5/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 1/115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/149 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 330/479 variables, 52/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 294/461 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/479 variables, 0/461 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 72/551 variables, 64/525 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/551 variables, 8/533 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/551 variables, 0/533 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/551 variables, 0/533 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 533 constraints, problems are : Problem set: 1 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 334ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 150/150 places, 401/401 transitions.
RANDOM walk for 40000 steps (813 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (79 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1678964 steps, run timeout after 3001 ms. (steps per millisecond=559 ) properties seen :0 out of 1
Probabilistic random walk after 1678964 steps, saw 214776 distinct states, run finished after 3001 ms. (steps per millisecond=559 ) properties seen :0
[2024-05-31 20:23:59] [INFO ] Invariant cache hit.
[2024-05-31 20:23:59] [INFO ] State equation strengthened by 372 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/43 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 81/124 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 60/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/138 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/149 variables, 8/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 330/479 variables, 52/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 294/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 72/551 variables, 64/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 8/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/551 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/551 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 532 constraints, problems are : Problem set: 0 solved, 1 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/43 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 81/124 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 60/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/138 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/149 variables, 8/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/149 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 330/479 variables, 52/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 294/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/479 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 72/551 variables, 64/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/551 variables, 8/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/551 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/551 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 533 constraints, problems are : Problem set: 0 solved, 1 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 340ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 150/150 places, 401/401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 401/401 transitions.
Applied a total of 0 rules in 3 ms. Remains 150 /150 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-31 20:23:59] [INFO ] Invariant cache hit.
[2024-05-31 20:23:59] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-31 20:23:59] [INFO ] Invariant cache hit.
[2024-05-31 20:23:59] [INFO ] State equation strengthened by 372 read => feed constraints.
[2024-05-31 20:23:59] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2024-05-31 20:23:59] [INFO ] Redundant transitions in 5 ms returned []
Running 391 sub problems to find dead transitions.
[2024-05-31 20:23:59] [INFO ] Invariant cache hit.
[2024-05-31 20:23:59] [INFO ] State equation strengthened by 372 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/550 variables, 149/159 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 372/531 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (OVERLAPS) 1/551 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 8 (OVERLAPS) 0/551 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 532 constraints, problems are : Problem set: 0 solved, 391 unsolved in 28183 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/550 variables, 149/159 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 372/531 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 391/922 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (OVERLAPS) 1/551 variables, 1/923 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 9 (OVERLAPS) 0/551 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 923 constraints, problems are : Problem set: 0 solved, 391 unsolved in 18176 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
After SMT, in 46439ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 46443ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47007 ms. Remains : 150/150 places, 401/401 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 343 edges and 150 vertex of which 108 / 150 are part of one of the 3 SCC in 0 ms
Free SCC test removed 105 places
Drop transitions (Empty/Sink Transition effects.) removed 261 transitions
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 354 transitions.
Graph (complete) has 102 edges and 45 vertex of which 15 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 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 24 rules applied. Total rules applied 26 place count 15 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 14 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 27 place count 14 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 13 transition count 14
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 38 place count 4 transition count 5
Iterating global reduction 2 with 9 rules applied. Total rules applied 47 place count 4 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 3 transition count 4
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 3 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 2 transition count 2
Applied a total of 51 rules in 4 ms. Remains 2 /150 variables (removed 148) and now considering 2/401 (removed 399) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-05-31 20:24:46] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 20:24:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:24:46] [INFO ] After 1ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:24:46] [INFO ] After 3ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-31 20:24:46] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 25 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-02 in 164339 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-31 20:24:46] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (200 resets) in 22 ms. (434 steps per ms)
BEST_FIRST walk for 10001 steps (18 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:24:46] [INFO ] Invariant cache hit.
[2024-05-31 20:24:46] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:24:46] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:24:46] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-31 20:24:46] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:24:46] [INFO ] [Real]Added 361 Read/Feed constraints in 26 ms returned sat
[2024-05-31 20:24:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:24:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:24:46] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:24:46] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-31 20:24:46] [INFO ] [Nat]Added 361 Read/Feed constraints in 31 ms returned sat
[2024-05-31 20:24:46] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 22 ms.
[2024-05-31 20:24:46] [INFO ] Added : 9 causal constraints over 2 iterations in 85 ms. Result :sat
Minimization took 167 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 405
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 152 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 151 transition count 404
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 151 transition count 404
Applied a total of 15 rules in 15 ms. Remains 151 /155 variables (removed 4) and now considering 404/408 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 151/155 places, 404/408 transitions.
// Phase 1: matrix 404 rows 151 cols
[2024-05-31 20:24:47] [INFO ] Computed 10 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20453 resets) in 2129 ms. (469 steps per ms)
BEST_FIRST walk for 1000001 steps (1968 resets) in 486 ms. (2053 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:24:49] [INFO ] Invariant cache hit.
[2024-05-31 20:24:49] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:24:49] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:24:49] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-31 20:24:49] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-31 20:24:49] [INFO ] [Real]Added 374 Read/Feed constraints in 25 ms returned sat
[2024-05-31 20:24:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:24:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:24:49] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:24:49] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-31 20:24:49] [INFO ] [Nat]Added 374 Read/Feed constraints in 35 ms returned sat
[2024-05-31 20:24:49] [INFO ] Computed and/alt/rep : 261/724/261 causal constraints (skipped 133 transitions) in 19 ms.
[2024-05-31 20:24:50] [INFO ] Added : 6 causal constraints over 2 iterations in 76 ms. Result :sat
Minimization took 222 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 151/151 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-31 20:24:50] [INFO ] Invariant cache hit.
[2024-05-31 20:24:50] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-31 20:24:50] [INFO ] Invariant cache hit.
[2024-05-31 20:24:50] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-31 20:24:50] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2024-05-31 20:24:50] [INFO ] Redundant transitions in 6 ms returned []
Running 394 sub problems to find dead transitions.
[2024-05-31 20:24:50] [INFO ] Invariant cache hit.
[2024-05-31 20:24:50] [INFO ] State equation strengthened by 374 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Problem TDEAD399 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 1/555 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 535 constraints, problems are : Problem set: 1 solved, 393 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 1 solved, 393 unsolved
Problem TDEAD136 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 392/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 1/555 variables, 1/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 927 constraints, problems are : Problem set: 2 solved, 392 unsolved in 25719 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 392/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 55810ms problems are : Problem set: 2 solved, 392 unsolved
Search for dead transitions found 2 dead transitions in 55814ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 151/151 places, 402/404 transitions.
Graph (complete) has 708 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 149 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 149 transition count 400
Applied a total of 3 rules in 6 ms. Remains 149 /151 variables (removed 2) and now considering 400/402 (removed 2) transitions.
// Phase 1: matrix 400 rows 149 cols
[2024-05-31 20:25:46] [INFO ] Computed 11 invariants in 3 ms
[2024-05-31 20:25:46] [INFO ] Implicit Places using invariants in 94 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 148/151 places, 400/404 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 147 transition count 399
Applied a total of 10 rules in 12 ms. Remains 147 /148 variables (removed 1) and now considering 399/400 (removed 1) transitions.
// Phase 1: matrix 399 rows 147 cols
[2024-05-31 20:25:46] [INFO ] Computed 10 invariants in 2 ms
[2024-05-31 20:25:46] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-31 20:25:46] [INFO ] Invariant cache hit.
[2024-05-31 20:25:47] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-31 20:25:47] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 147/151 places, 399/404 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 57130 ms. Remains : 147/151 places, 399/404 transitions.
[2024-05-31 20:25:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22563 resets) in 2168 ms. (461 steps per ms)
BEST_FIRST walk for 1000000 steps (2085 resets) in 468 ms. (2132 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:25:50] [INFO ] Invariant cache hit.
[2024-05-31 20:25:50] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:25:50] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:25:50] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-31 20:25:50] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-31 20:25:50] [INFO ] [Real]Added 362 Read/Feed constraints in 23 ms returned sat
[2024-05-31 20:25:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:25:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-31 20:25:50] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:25:50] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-31 20:25:50] [INFO ] [Nat]Added 362 Read/Feed constraints in 28 ms returned sat
[2024-05-31 20:25:50] [INFO ] Computed and/alt/rep : 229/578/229 causal constraints (skipped 160 transitions) in 20 ms.
[2024-05-31 20:25:50] [INFO ] Added : 5 causal constraints over 1 iterations in 63 ms. Result :sat
Minimization took 141 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-31 20:25:50] [INFO ] Invariant cache hit.
[2024-05-31 20:25:50] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-31 20:25:50] [INFO ] Invariant cache hit.
[2024-05-31 20:25:50] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-31 20:25:51] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2024-05-31 20:25:51] [INFO ] Redundant transitions in 4 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-31 20:25:51] [INFO ] Invariant cache hit.
[2024-05-31 20:25:51] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-31 20:25:53] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-31 20:25:54] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 24704 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 54816ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 54822ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55327 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (897 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (84 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (83 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1140236 steps, run timeout after 3001 ms. (steps per millisecond=379 ) properties seen :0 out of 2
Probabilistic random walk after 1140236 steps, saw 139491 distinct states, run finished after 3001 ms. (steps per millisecond=379 ) properties seen :0
[2024-05-31 20:26:48] [INFO ] Invariant cache hit.
[2024-05-31 20:26:48] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 96/140 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 70/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 23/163 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/174 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 5/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:26:49] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/174 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/174 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 316/490 variables, 64/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/490 variables, 276/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/490 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 20 (OVERLAPS) 56/546 variables, 49/513 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 7/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/546 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 520 constraints, problems are : Problem set: 1 solved, 1 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 9/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 96/140 variables, 21/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 1/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 70/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/163 variables, 1/106 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 1/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/174 variables, 8/119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/174 variables, 5/124 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/174 variables, 1/125 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 20:26:49] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/174 variables, 1/126 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/174 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 316/490 variables, 64/190 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/490 variables, 276/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/490 variables, 0/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 56/546 variables, 49/515 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 7/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/546 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/546 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 522 constraints, problems are : Problem set: 1 solved, 1 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 476ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (903 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (83 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1720119 steps, run timeout after 3001 ms. (steps per millisecond=573 ) properties seen :0 out of 1
Probabilistic random walk after 1720119 steps, saw 208265 distinct states, run finished after 3001 ms. (steps per millisecond=573 ) properties seen :0
[2024-05-31 20:26:52] [INFO ] Invariant cache hit.
[2024-05-31 20:26:52] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 96/140 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 70/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/163 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/174 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 5/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/174 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 316/490 variables, 64/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/490 variables, 276/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/490 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 56/546 variables, 49/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 7/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 96/140 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 70/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/163 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/174 variables, 8/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/174 variables, 5/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:26:52] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-31 20:26:52] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-31 20:26:52] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/174 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/174 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 316/490 variables, 64/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/490 variables, 276/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/490 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 56/546 variables, 49/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 7/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/546 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 523 constraints, problems are : Problem set: 0 solved, 1 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 400ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 13 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-31 20:26:52] [INFO ] Invariant cache hit.
[2024-05-31 20:26:52] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 20:26:52] [INFO ] Invariant cache hit.
[2024-05-31 20:26:53] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-31 20:26:53] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2024-05-31 20:26:53] [INFO ] Redundant transitions in 3 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-31 20:26:53] [INFO ] Invariant cache hit.
[2024-05-31 20:26:53] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-31 20:26:55] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-31 20:26:56] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 29539 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 24513 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 54132ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 54135ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54652 ms. Remains : 147/147 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 147 vertex of which 107 / 147 are part of one of the 3 SCC in 1 ms
Free SCC test removed 104 places
Drop transitions (Empty/Sink Transition effects.) removed 260 transitions
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 353 transitions.
Graph (complete) has 97 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 21 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 22 rules applied. Total rules applied 24 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 33 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 41 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 2 transition count 3
Applied a total of 44 rules in 2 ms. Remains 2 /147 variables (removed 145) and now considering 3/399 (removed 396) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-31 20:27:47] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 20:27:47] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:27:47] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:27:47] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:27:47] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 44 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-03 in 181154 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-31 20:27:47] [INFO ] Computed 10 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (199 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (18 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:27:47] [INFO ] Invariant cache hit.
[2024-05-31 20:27:47] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:27:47] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:27:47] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-31 20:27:47] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:27:47] [INFO ] [Real]Added 361 Read/Feed constraints in 24 ms returned sat
[2024-05-31 20:27:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:27:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:27:47] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:27:47] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-31 20:27:47] [INFO ] [Nat]Added 361 Read/Feed constraints in 28 ms returned sat
[2024-05-31 20:27:47] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 20 ms.
[2024-05-31 20:27:47] [INFO ] Added : 5 causal constraints over 1 iterations in 65 ms. Result :sat
Minimization took 168 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 405
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 152 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 151 transition count 404
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 151 transition count 404
Applied a total of 15 rules in 12 ms. Remains 151 /155 variables (removed 4) and now considering 404/408 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 151/155 places, 404/408 transitions.
// Phase 1: matrix 404 rows 151 cols
[2024-05-31 20:27:48] [INFO ] Computed 10 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20489 resets) in 2189 ms. (456 steps per ms)
BEST_FIRST walk for 1000001 steps (1962 resets) in 492 ms. (2028 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:27:50] [INFO ] Invariant cache hit.
[2024-05-31 20:27:50] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-31 20:27:50] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:27:50] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-31 20:27:50] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-31 20:27:50] [INFO ] [Real]Added 374 Read/Feed constraints in 27 ms returned sat
[2024-05-31 20:27:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:27:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:27:51] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:27:51] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-31 20:27:51] [INFO ] [Nat]Added 374 Read/Feed constraints in 23 ms returned sat
[2024-05-31 20:27:51] [INFO ] Computed and/alt/rep : 261/724/261 causal constraints (skipped 133 transitions) in 21 ms.
[2024-05-31 20:27:51] [INFO ] Added : 3 causal constraints over 1 iterations in 66 ms. Result :sat
Minimization took 210 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 3 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 151/151 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 3 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-31 20:27:51] [INFO ] Invariant cache hit.
[2024-05-31 20:27:51] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 20:27:51] [INFO ] Invariant cache hit.
[2024-05-31 20:27:51] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-31 20:27:52] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2024-05-31 20:27:52] [INFO ] Redundant transitions in 5 ms returned []
Running 394 sub problems to find dead transitions.
[2024-05-31 20:27:52] [INFO ] Invariant cache hit.
[2024-05-31 20:27:52] [INFO ] State equation strengthened by 374 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Problem TDEAD399 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 1/555 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 535 constraints, problems are : Problem set: 1 solved, 393 unsolved in 29617 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 1 solved, 393 unsolved
Problem TDEAD136 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 392/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 1/555 variables, 1/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 927 constraints, problems are : Problem set: 2 solved, 392 unsolved in 25419 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 392/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 55127ms problems are : Problem set: 2 solved, 392 unsolved
Search for dead transitions found 2 dead transitions in 55131ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 151/151 places, 402/404 transitions.
Graph (complete) has 708 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 149 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 149 transition count 400
Applied a total of 3 rules in 10 ms. Remains 149 /151 variables (removed 2) and now considering 400/402 (removed 2) transitions.
// Phase 1: matrix 400 rows 149 cols
[2024-05-31 20:28:47] [INFO ] Computed 11 invariants in 1 ms
[2024-05-31 20:28:47] [INFO ] Implicit Places using invariants in 84 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 148/151 places, 400/404 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 147 transition count 399
Applied a total of 10 rules in 12 ms. Remains 147 /148 variables (removed 1) and now considering 399/400 (removed 1) transitions.
// Phase 1: matrix 399 rows 147 cols
[2024-05-31 20:28:47] [INFO ] Computed 10 invariants in 2 ms
[2024-05-31 20:28:47] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-31 20:28:47] [INFO ] Invariant cache hit.
[2024-05-31 20:28:47] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-31 20:28:47] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 147/151 places, 399/404 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 56409 ms. Remains : 147/151 places, 399/404 transitions.
[2024-05-31 20:28:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22616 resets) in 2201 ms. (454 steps per ms)
BEST_FIRST walk for 1000001 steps (2087 resets) in 479 ms. (2083 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:28:50] [INFO ] Invariant cache hit.
[2024-05-31 20:28:50] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:28:50] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:28:50] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-31 20:28:50] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-31 20:28:50] [INFO ] [Real]Added 362 Read/Feed constraints in 25 ms returned sat
[2024-05-31 20:28:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:28:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-31 20:28:50] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:28:50] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-31 20:28:50] [INFO ] [Nat]Added 362 Read/Feed constraints in 23 ms returned sat
[2024-05-31 20:28:50] [INFO ] Computed and/alt/rep : 229/578/229 causal constraints (skipped 160 transitions) in 19 ms.
[2024-05-31 20:28:50] [INFO ] Added : 3 causal constraints over 1 iterations in 63 ms. Result :sat
Minimization took 136 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-31 20:28:51] [INFO ] Invariant cache hit.
[2024-05-31 20:28:51] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-31 20:28:51] [INFO ] Invariant cache hit.
[2024-05-31 20:28:51] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-31 20:28:51] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-05-31 20:28:51] [INFO ] Redundant transitions in 4 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-31 20:28:51] [INFO ] Invariant cache hit.
[2024-05-31 20:28:51] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-31 20:28:53] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/157 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/519 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (OVERLAPS) 1/546 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (OVERLAPS) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 520 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/157 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/519 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/908 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 909 constraints, problems are : Problem set: 0 solved, 389 unsolved in 24554 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 1/1 constraints]
After SMT, in 54655ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 54659ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55235 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (897 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (78 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (83 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1133078 steps, run timeout after 3001 ms. (steps per millisecond=377 ) properties seen :0 out of 2
Probabilistic random walk after 1133078 steps, saw 138614 distinct states, run finished after 3001 ms. (steps per millisecond=377 ) properties seen :0
[2024-05-31 20:29:49] [INFO ] Invariant cache hit.
[2024-05-31 20:29:49] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 49/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 144/198 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 113/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 23/221 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/232 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:29:49] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-31 20:29:49] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/232 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 272/504 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 234/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 20 (OVERLAPS) 42/546 variables, 36/515 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 6/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/54 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 144/198 variables, 30/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 113/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/221 variables, 1/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 6/165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/232 variables, 8/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 5/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 1/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/232 variables, 2/181 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/232 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 272/504 variables, 65/246 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 234/480 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/504 variables, 0/480 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/546 variables, 36/516 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 6/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/546 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 522 constraints, problems are : Problem set: 1 solved, 1 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 455ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 11 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (903 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (80 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1715659 steps, run timeout after 3001 ms. (steps per millisecond=571 ) properties seen :0 out of 1
Probabilistic random walk after 1715659 steps, saw 207628 distinct states, run finished after 3001 ms. (steps per millisecond=571 ) properties seen :0
[2024-05-31 20:29:52] [INFO ] Invariant cache hit.
[2024-05-31 20:29:52] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 144/198 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 113/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/221 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/232 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 272/504 variables, 65/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/504 variables, 234/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/546 variables, 36/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 144/198 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 113/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/221 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/232 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:29:53] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-31 20:29:53] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/232 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/232 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 272/504 variables, 65/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 234/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/504 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/546 variables, 36/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 6/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/546 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 522 constraints, problems are : Problem set: 0 solved, 1 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 395ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-31 20:29:53] [INFO ] Invariant cache hit.
[2024-05-31 20:29:53] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 20:29:53] [INFO ] Invariant cache hit.
[2024-05-31 20:29:53] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-31 20:29:53] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2024-05-31 20:29:53] [INFO ] Redundant transitions in 4 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-31 20:29:53] [INFO ] Invariant cache hit.
[2024-05-31 20:29:53] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-31 20:29:56] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/157 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/519 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (OVERLAPS) 1/546 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (OVERLAPS) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 520 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/157 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/519 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/908 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 909 constraints, problems are : Problem set: 0 solved, 389 unsolved in 24425 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 1/1 constraints]
After SMT, in 54520ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 54524ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55086 ms. Remains : 147/147 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 325 edges and 147 vertex of which 107 / 147 are part of one of the 3 SCC in 0 ms
Free SCC test removed 104 places
Drop transitions (Empty/Sink Transition effects.) removed 260 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 354 transitions.
Graph (complete) has 97 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 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 21 rules applied. Total rules applied 23 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 2 transition count 3
Applied a total of 43 rules in 1 ms. Remains 2 /147 variables (removed 145) and now considering 3/399 (removed 396) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-31 20:30:48] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 20:30:48] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:30:48] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:30:48] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:30:48] [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 46 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-05 in 180785 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-31 20:30:48] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (201 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (19 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:30:48] [INFO ] Invariant cache hit.
[2024-05-31 20:30:48] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:30:48] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:30:48] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-31 20:30:48] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:30:48] [INFO ] [Real]Added 361 Read/Feed constraints in 25 ms returned sat
[2024-05-31 20:30:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:30:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:30:48] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:30:48] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-31 20:30:48] [INFO ] [Nat]Added 361 Read/Feed constraints in 28 ms returned sat
[2024-05-31 20:30:48] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 21 ms.
[2024-05-31 20:30:48] [INFO ] Added : 8 causal constraints over 2 iterations in 80 ms. Result :sat
Minimization took 189 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 405
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 152 transition count 405
Applied a total of 12 rules in 11 ms. Remains 152 /155 variables (removed 3) and now considering 405/408 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 152/155 places, 405/408 transitions.
// Phase 1: matrix 405 rows 152 cols
[2024-05-31 20:30:49] [INFO ] Computed 10 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20553 resets) in 2165 ms. (461 steps per ms)
BEST_FIRST walk for 1000001 steps (2002 resets) in 480 ms. (2079 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:30:51] [INFO ] Invariant cache hit.
[2024-05-31 20:30:51] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-31 20:30:51] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:30:51] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-31 20:30:51] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-31 20:30:51] [INFO ] [Real]Added 373 Read/Feed constraints in 26 ms returned sat
[2024-05-31 20:30:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:30:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:30:51] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:30:51] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-31 20:30:51] [INFO ] [Nat]Added 373 Read/Feed constraints in 29 ms returned sat
[2024-05-31 20:30:51] [INFO ] Computed and/alt/rep : 261/715/261 causal constraints (skipped 134 transitions) in 20 ms.
[2024-05-31 20:30:52] [INFO ] Added : 8 causal constraints over 2 iterations in 80 ms. Result :sat
Minimization took 264 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 152/152 places, 405/405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
[2024-05-31 20:30:52] [INFO ] Invariant cache hit.
[2024-05-31 20:30:52] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-31 20:30:52] [INFO ] Invariant cache hit.
[2024-05-31 20:30:52] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-31 20:30:52] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2024-05-31 20:30:52] [INFO ] Redundant transitions in 4 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-31 20:30:52] [INFO ] Invariant cache hit.
[2024-05-31 20:30:52] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (OVERLAPS) 1/557 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (OVERLAPS) 0/557 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 395 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 535 constraints, problems are : Problem set: 0 solved, 395 unsolved in 28987 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 395/929 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (OVERLAPS) 1/557 variables, 1/930 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 9 (OVERLAPS) 0/557 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 395 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 930 constraints, problems are : Problem set: 0 solved, 395 unsolved in 26615 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 55679ms problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 55685ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56302 ms. Remains : 152/152 places, 405/405 transitions.
RANDOM walk for 40000 steps (812 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (79 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (79 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1136735 steps, run timeout after 3001 ms. (steps per millisecond=378 ) properties seen :0 out of 2
Probabilistic random walk after 1136735 steps, saw 145234 distinct states, run finished after 3001 ms. (steps per millisecond=378 ) properties seen :0
[2024-05-31 20:31:51] [INFO ] Invariant cache hit.
[2024-05-31 20:31:51] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 275/319 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 248/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/329 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 16/345 variables, 8/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 16/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 17 (OVERLAPS) 212/557 variables, 87/410 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 125/535 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 535 constraints, problems are : Problem set: 1 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 5/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 275/319 variables, 33/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 248/287 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/287 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/288 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/289 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/289 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/329 variables, 1/290 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 9/299 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 1/300 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/329 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/345 variables, 8/308 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 16/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/345 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 212/557 variables, 87/411 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 125/536 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/557 variables, 0/536 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/557 variables, 0/536 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 536 constraints, problems are : Problem set: 1 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 401ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 152/152 places, 405/405 transitions.
RANDOM walk for 40000 steps (824 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (77 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1637003 steps, run timeout after 3001 ms. (steps per millisecond=545 ) properties seen :0 out of 1
Probabilistic random walk after 1637003 steps, saw 209116 distinct states, run finished after 3001 ms. (steps per millisecond=545 ) properties seen :0
[2024-05-31 20:31:55] [INFO ] Invariant cache hit.
[2024-05-31 20:31:55] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 275/319 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 248/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/329 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/345 variables, 8/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 16/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 212/557 variables, 87/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 125/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/557 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 535 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 275/319 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 248/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/329 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/329 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/345 variables, 8/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 16/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/345 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 212/557 variables, 87/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 125/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/557 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/557 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 536 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 357ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 152/152 places, 405/405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
[2024-05-31 20:31:55] [INFO ] Invariant cache hit.
[2024-05-31 20:31:55] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-31 20:31:55] [INFO ] Invariant cache hit.
[2024-05-31 20:31:55] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-31 20:31:56] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
[2024-05-31 20:31:56] [INFO ] Redundant transitions in 4 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-31 20:31:56] [INFO ] Invariant cache hit.
[2024-05-31 20:31:56] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (OVERLAPS) 1/557 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (OVERLAPS) 0/557 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 395 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 535 constraints, problems are : Problem set: 0 solved, 395 unsolved in 29266 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 395/929 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (OVERLAPS) 1/557 variables, 1/930 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 9 (OVERLAPS) 0/557 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 395 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 930 constraints, problems are : Problem set: 0 solved, 395 unsolved in 26544 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 55895ms problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 55899ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56510 ms. Remains : 152/152 places, 405/405 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 345 edges and 152 vertex of which 109 / 152 are part of one of the 3 SCC in 1 ms
Free SCC test removed 106 places
Drop transitions (Empty/Sink Transition effects.) removed 263 transitions
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 356 transitions.
Graph (complete) has 106 edges and 46 vertex of which 16 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 16 transition count 20
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 8 transition count 12
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 8 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 7 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 5 transition count 9
Applied a total of 42 rules in 7 ms. Remains 5 /152 variables (removed 147) and now considering 9/405 (removed 396) transitions.
Running SMT prover for 1 properties.
[2024-05-31 20:32:52] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2024-05-31 20:32:52] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 20:32:52] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:32:52] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:32:52] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:32:52] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 63 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-07 in 123686 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-31 20:32:52] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (198 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (20 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:32:52] [INFO ] Invariant cache hit.
[2024-05-31 20:32:52] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:32:52] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:32:52] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-31 20:32:52] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:32:52] [INFO ] [Real]Added 361 Read/Feed constraints in 25 ms returned sat
[2024-05-31 20:32:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:32:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:32:52] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:32:52] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-31 20:32:52] [INFO ] [Nat]Added 361 Read/Feed constraints in 31 ms returned sat
[2024-05-31 20:32:52] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 22 ms.
[2024-05-31 20:32:52] [INFO ] Added : 11 causal constraints over 3 iterations in 104 ms. Result :sat
Minimization took 166 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 153 transition count 406
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 153 transition count 405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 152 transition count 405
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 14 place count 152 transition count 405
Applied a total of 14 rules in 16 ms. Remains 152 /155 variables (removed 3) and now considering 405/408 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 152/155 places, 405/408 transitions.
// Phase 1: matrix 405 rows 152 cols
[2024-05-31 20:32:52] [INFO ] Computed 10 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20403 resets) in 2163 ms. (462 steps per ms)
BEST_FIRST walk for 1000001 steps (1973 resets) in 493 ms. (2024 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:32:55] [INFO ] Invariant cache hit.
[2024-05-31 20:32:55] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:32:55] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:32:55] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-31 20:32:55] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-31 20:32:55] [INFO ] [Real]Added 373 Read/Feed constraints in 27 ms returned sat
[2024-05-31 20:32:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:32:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:32:55] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:32:55] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-31 20:32:55] [INFO ] [Nat]Added 373 Read/Feed constraints in 28 ms returned sat
[2024-05-31 20:32:55] [INFO ] Computed and/alt/rep : 262/722/262 causal constraints (skipped 133 transitions) in 21 ms.
[2024-05-31 20:32:55] [INFO ] Added : 6 causal constraints over 2 iterations in 77 ms. Result :sat
Minimization took 191 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 152/152 places, 405/405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
[2024-05-31 20:32:55] [INFO ] Invariant cache hit.
[2024-05-31 20:32:56] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-31 20:32:56] [INFO ] Invariant cache hit.
[2024-05-31 20:32:56] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-31 20:32:56] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2024-05-31 20:32:56] [INFO ] Redundant transitions in 5 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-31 20:32:56] [INFO ] Invariant cache hit.
[2024-05-31 20:32:56] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Problem TDEAD400 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 6 (OVERLAPS) 1/557 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 8 (OVERLAPS) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 535 constraints, problems are : Problem set: 1 solved, 394 unsolved in 29923 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 1 solved, 394 unsolved
Problem TDEAD139 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 393/927 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 7 (OVERLAPS) 1/557 variables, 1/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/557 variables, 0/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 928 constraints, problems are : Problem set: 2 solved, 393 unsolved in 25168 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 393/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 55183ms problems are : Problem set: 2 solved, 393 unsolved
Search for dead transitions found 2 dead transitions in 55187ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 152/152 places, 403/405 transitions.
Graph (complete) has 708 edges and 152 vertex of which 151 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 150 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 150 transition count 401
Applied a total of 3 rules in 12 ms. Remains 150 /152 variables (removed 2) and now considering 401/403 (removed 2) transitions.
// Phase 1: matrix 401 rows 150 cols
[2024-05-31 20:33:51] [INFO ] Computed 11 invariants in 4 ms
[2024-05-31 20:33:51] [INFO ] Implicit Places using invariants in 92 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 149/152 places, 401/405 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 148 transition count 408
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 148 transition count 400
Applied a total of 10 rules in 11 ms. Remains 148 /149 variables (removed 1) and now considering 400/401 (removed 1) transitions.
// Phase 1: matrix 400 rows 148 cols
[2024-05-31 20:33:51] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 20:33:51] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 20:33:51] [INFO ] Invariant cache hit.
[2024-05-31 20:33:51] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:33:52] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 148/152 places, 400/405 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 56390 ms. Remains : 148/152 places, 400/405 transitions.
[2024-05-31 20:33:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22517 resets) in 2180 ms. (458 steps per ms)
BEST_FIRST walk for 1000001 steps (2108 resets) in 469 ms. (2127 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:33:54] [INFO ] Invariant cache hit.
[2024-05-31 20:33:54] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:33:54] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:33:55] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-31 20:33:55] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:33:55] [INFO ] [Real]Added 361 Read/Feed constraints in 25 ms returned sat
[2024-05-31 20:33:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:33:55] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:33:55] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-31 20:33:55] [INFO ] [Nat]Added 361 Read/Feed constraints in 30 ms returned sat
[2024-05-31 20:33:55] [INFO ] Computed and/alt/rep : 230/576/230 causal constraints (skipped 160 transitions) in 21 ms.
[2024-05-31 20:33:55] [INFO ] Added : 13 causal constraints over 3 iterations in 103 ms. Result :sat
Minimization took 141 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 148/148 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 3 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-31 20:33:55] [INFO ] Invariant cache hit.
[2024-05-31 20:33:55] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-31 20:33:55] [INFO ] Invariant cache hit.
[2024-05-31 20:33:55] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:33:55] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2024-05-31 20:33:56] [INFO ] Redundant transitions in 4 ms returned []
Running 390 sub problems to find dead transitions.
[2024-05-31 20:33:56] [INFO ] Invariant cache hit.
[2024-05-31 20:33:56] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-31 20:33:58] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-31 20:33:58] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 521 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 390/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (OVERLAPS) 1/548 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 911 constraints, problems are : Problem set: 0 solved, 390 unsolved in 24763 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
After SMT, in 54861ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 54866ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55389 ms. Remains : 148/148 places, 400/400 transitions.
RANDOM walk for 40000 steps (899 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (82 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (83 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1252565 steps, run timeout after 3001 ms. (steps per millisecond=417 ) properties seen :0 out of 2
Probabilistic random walk after 1252565 steps, saw 152134 distinct states, run finished after 3001 ms. (steps per millisecond=417 ) properties seen :0
[2024-05-31 20:34:53] [INFO ] Invariant cache hit.
[2024-05-31 20:34:53] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/39 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 151/190 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 121/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 24/215 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 5/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 10/225 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 6/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:34:54] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 269/494 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 228/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 21 (OVERLAPS) 54/548 variables, 42/508 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 12/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/548 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 520 constraints, problems are : Problem set: 1 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/39 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/190 variables, 29/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 121/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/215 variables, 1/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 5/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/225 variables, 8/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 6/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 1/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 269/494 variables, 60/239 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 228/467 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/494 variables, 0/467 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 54/548 variables, 42/509 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 12/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/548 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/548 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 452ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 148/148 places, 400/400 transitions.
RANDOM walk for 40000 steps (896 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (83 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1734458 steps, run timeout after 3001 ms. (steps per millisecond=577 ) properties seen :0 out of 1
Probabilistic random walk after 1734458 steps, saw 210361 distinct states, run finished after 3001 ms. (steps per millisecond=577 ) properties seen :0
[2024-05-31 20:34:57] [INFO ] Invariant cache hit.
[2024-05-31 20:34:57] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/39 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/190 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 121/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/215 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 5/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/225 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 6/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 269/494 variables, 60/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/494 variables, 228/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 54/548 variables, 42/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/548 variables, 12/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/548 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/39 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/190 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 121/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/215 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 5/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/225 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 6/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:34:57] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-31 20:34:57] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 269/494 variables, 60/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 228/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/494 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 54/548 variables, 42/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 12/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/548 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/548 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 522 constraints, problems are : Problem set: 0 solved, 1 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 412ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 148/148 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-31 20:34:57] [INFO ] Invariant cache hit.
[2024-05-31 20:34:57] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-31 20:34:57] [INFO ] Invariant cache hit.
[2024-05-31 20:34:58] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:34:58] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
[2024-05-31 20:34:58] [INFO ] Redundant transitions in 4 ms returned []
Running 390 sub problems to find dead transitions.
[2024-05-31 20:34:58] [INFO ] Invariant cache hit.
[2024-05-31 20:34:58] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-31 20:35:00] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
[2024-05-31 20:35:00] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 521 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 390/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (OVERLAPS) 1/548 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 911 constraints, problems are : Problem set: 0 solved, 390 unsolved in 24205 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
After SMT, in 54303ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 54307ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54824 ms. Remains : 148/148 places, 400/400 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 148 vertex of which 108 / 148 are part of one of the 3 SCC in 0 ms
Free SCC test removed 105 places
Drop transitions (Empty/Sink Transition effects.) removed 261 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 355 transitions.
Graph (complete) has 97 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 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 21 rules applied. Total rules applied 23 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 2 transition count 3
Applied a total of 43 rules in 1 ms. Remains 2 /148 variables (removed 146) and now considering 3/400 (removed 397) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-31 20:35:52] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 20:35:52] [INFO ] After 1ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:35:52] [INFO ] After 2ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-31 20:35:52] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:35:52] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:35:52] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:35:52] [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 44 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-09 in 180665 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-31 20:35:52] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (199 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (21 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:35:52] [INFO ] Invariant cache hit.
[2024-05-31 20:35:52] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:52] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:35:52] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-31 20:35:52] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:35:52] [INFO ] [Real]Added 361 Read/Feed constraints in 25 ms returned sat
[2024-05-31 20:35:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:52] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:35:52] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-31 20:35:53] [INFO ] [Nat]Added 361 Read/Feed constraints in 26 ms returned sat
[2024-05-31 20:35:53] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 20 ms.
[2024-05-31 20:35:53] [INFO ] Added : 6 causal constraints over 2 iterations in 87 ms. Result :sat
Minimization took 178 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 153 transition count 406
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 153 transition count 405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 152 transition count 405
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 14 place count 152 transition count 405
Applied a total of 14 rules in 12 ms. Remains 152 /155 variables (removed 3) and now considering 405/408 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 152/155 places, 405/408 transitions.
// Phase 1: matrix 405 rows 152 cols
[2024-05-31 20:35:53] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20378 resets) in 2129 ms. (469 steps per ms)
BEST_FIRST walk for 1000001 steps (1967 resets) in 485 ms. (2057 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:35:55] [INFO ] Invariant cache hit.
[2024-05-31 20:35:55] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:55] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:35:56] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-31 20:35:56] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-31 20:35:56] [INFO ] [Real]Added 373 Read/Feed constraints in 28 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 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:56] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:35:56] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-31 20:35:56] [INFO ] [Nat]Added 373 Read/Feed constraints in 30 ms returned sat
[2024-05-31 20:35:56] [INFO ] Computed and/alt/rep : 262/722/262 causal constraints (skipped 133 transitions) in 21 ms.
[2024-05-31 20:35:56] [INFO ] Added : 8 causal constraints over 2 iterations in 83 ms. Result :sat
Minimization took 212 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 152/152 places, 405/405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
[2024-05-31 20:35:56] [INFO ] Invariant cache hit.
[2024-05-31 20:35:56] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-31 20:35:56] [INFO ] Invariant cache hit.
[2024-05-31 20:35:56] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-31 20:35:57] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2024-05-31 20:35:57] [INFO ] Redundant transitions in 7 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-31 20:35:57] [INFO ] Invariant cache hit.
[2024-05-31 20:35:57] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Problem TDEAD400 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 6 (OVERLAPS) 1/557 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 8 (OVERLAPS) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 535 constraints, problems are : Problem set: 1 solved, 394 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 1 solved, 394 unsolved
Problem TDEAD139 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 393/927 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 7 (OVERLAPS) 1/557 variables, 1/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/557 variables, 0/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 928 constraints, problems are : Problem set: 2 solved, 393 unsolved in 24213 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 393/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 54302ms problems are : Problem set: 2 solved, 393 unsolved
Search for dead transitions found 2 dead transitions in 54305ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 152/152 places, 403/405 transitions.
Graph (complete) has 708 edges and 152 vertex of which 151 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 150 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 150 transition count 401
Applied a total of 3 rules in 6 ms. Remains 150 /152 variables (removed 2) and now considering 401/403 (removed 2) transitions.
// Phase 1: matrix 401 rows 150 cols
[2024-05-31 20:36:51] [INFO ] Computed 11 invariants in 3 ms
[2024-05-31 20:36:51] [INFO ] Implicit Places using invariants in 84 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 149/152 places, 401/405 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 148 transition count 408
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 148 transition count 400
Applied a total of 10 rules in 11 ms. Remains 148 /149 variables (removed 1) and now considering 400/401 (removed 1) transitions.
// Phase 1: matrix 400 rows 148 cols
[2024-05-31 20:36:51] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 20:36:51] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-31 20:36:51] [INFO ] Invariant cache hit.
[2024-05-31 20:36:51] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:36:52] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 148/152 places, 400/405 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 55611 ms. Remains : 148/152 places, 400/405 transitions.
[2024-05-31 20:36:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22525 resets) in 2154 ms. (464 steps per ms)
BEST_FIRST walk for 1000001 steps (2098 resets) in 473 ms. (2109 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:36:54] [INFO ] Invariant cache hit.
[2024-05-31 20:36:54] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:36:54] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:36:54] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-31 20:36:54] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:36:54] [INFO ] [Real]Added 361 Read/Feed constraints in 24 ms returned sat
[2024-05-31 20:36:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:36:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:36:54] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:36:55] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-31 20:36:55] [INFO ] [Nat]Added 361 Read/Feed constraints in 28 ms returned sat
[2024-05-31 20:36:55] [INFO ] Computed and/alt/rep : 230/576/230 causal constraints (skipped 160 transitions) in 18 ms.
[2024-05-31 20:36:55] [INFO ] Added : 10 causal constraints over 2 iterations in 77 ms. Result :sat
Minimization took 155 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 3 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 148/148 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-31 20:36:55] [INFO ] Invariant cache hit.
[2024-05-31 20:36:55] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-31 20:36:55] [INFO ] Invariant cache hit.
[2024-05-31 20:36:55] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:36:55] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-05-31 20:36:55] [INFO ] Redundant transitions in 5 ms returned []
Running 390 sub problems to find dead transitions.
[2024-05-31 20:36:55] [INFO ] Invariant cache hit.
[2024-05-31 20:36:55] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-31 20:36:58] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-31 20:36:58] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 521 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 390/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (OVERLAPS) 1/548 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 911 constraints, problems are : Problem set: 0 solved, 390 unsolved in 23653 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
After SMT, in 53755ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 53760ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54334 ms. Remains : 148/148 places, 400/400 transitions.
RANDOM walk for 40000 steps (906 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (83 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (85 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1295874 steps, run timeout after 3001 ms. (steps per millisecond=431 ) properties seen :0 out of 2
Probabilistic random walk after 1295874 steps, saw 156730 distinct states, run finished after 3001 ms. (steps per millisecond=431 ) properties seen :0
[2024-05-31 20:37:52] [INFO ] Invariant cache hit.
[2024-05-31 20:37:52] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 23/215 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 11/226 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 268/494 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/494 variables, 227/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 20 (OVERLAPS) 54/548 variables, 42/507 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/548 variables, 12/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/548 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 519 constraints, problems are : Problem set: 1 solved, 1 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/215 variables, 1/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 4/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 1/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/215 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/226 variables, 8/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 7/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 268/494 variables, 60/239 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 227/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 0/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/548 variables, 42/508 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 12/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/548 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 520 constraints, problems are : Problem set: 1 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 396ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 148/148 places, 400/400 transitions.
RANDOM walk for 40000 steps (902 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (84 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1730172 steps, run timeout after 3001 ms. (steps per millisecond=576 ) properties seen :0 out of 1
Probabilistic random walk after 1730172 steps, saw 209571 distinct states, run finished after 3001 ms. (steps per millisecond=576 ) properties seen :0
[2024-05-31 20:37:56] [INFO ] Invariant cache hit.
[2024-05-31 20:37:56] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/215 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/226 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 268/494 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/494 variables, 227/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 54/548 variables, 42/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/548 variables, 12/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/548 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/215 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/215 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/226 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 268/494 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 227/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/548 variables, 42/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 12/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/548 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 357ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 148/148 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-31 20:37:56] [INFO ] Invariant cache hit.
[2024-05-31 20:37:56] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 20:37:56] [INFO ] Invariant cache hit.
[2024-05-31 20:37:56] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:37:57] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2024-05-31 20:37:57] [INFO ] Redundant transitions in 4 ms returned []
Running 390 sub problems to find dead transitions.
[2024-05-31 20:37:57] [INFO ] Invariant cache hit.
[2024-05-31 20:37:57] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-31 20:37:59] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:37:59] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 521 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 390/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (OVERLAPS) 1/548 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 911 constraints, problems are : Problem set: 0 solved, 390 unsolved in 23819 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
After SMT, in 53929ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 53932ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54497 ms. Remains : 148/148 places, 400/400 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 148 vertex of which 108 / 148 are part of one of the 3 SCC in 0 ms
Free SCC test removed 105 places
Drop transitions (Empty/Sink Transition effects.) removed 261 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 355 transitions.
Graph (complete) has 97 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 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 21 rules applied. Total rules applied 23 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 2 transition count 3
Applied a total of 43 rules in 2 ms. Remains 2 /148 variables (removed 146) and now considering 3/400 (removed 397) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-31 20:38:51] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 20:38:51] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:38:51] [INFO ] After 3ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-31 20:38:51] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:38:51] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:38:51] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:38:51] [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 45 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-10 in 178346 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-31 20:38:51] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (200 resets) in 28 ms. (344 steps per ms)
BEST_FIRST walk for 10001 steps (20 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:38:51] [INFO ] Invariant cache hit.
[2024-05-31 20:38:51] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-31 20:38:51] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:38:51] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-31 20:38:51] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:38:51] [INFO ] [Real]Added 361 Read/Feed constraints in 25 ms returned sat
[2024-05-31 20:38:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:51] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:38:51] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-31 20:38:51] [INFO ] [Nat]Added 361 Read/Feed constraints in 26 ms returned sat
[2024-05-31 20:38:51] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 24 ms.
[2024-05-31 20:38:51] [INFO ] Added : 6 causal constraints over 2 iterations in 84 ms. Result :sat
Minimization took 174 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 153 transition count 406
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 153 transition count 405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 152 transition count 405
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 14 place count 152 transition count 405
Applied a total of 14 rules in 11 ms. Remains 152 /155 variables (removed 3) and now considering 405/408 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 152/155 places, 405/408 transitions.
// Phase 1: matrix 405 rows 152 cols
[2024-05-31 20:38:51] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20393 resets) in 2136 ms. (467 steps per ms)
BEST_FIRST walk for 1000000 steps (1986 resets) in 483 ms. (2066 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:38:54] [INFO ] Invariant cache hit.
[2024-05-31 20:38:54] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:54] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:38:54] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-31 20:38:54] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-31 20:38:54] [INFO ] [Real]Added 373 Read/Feed constraints in 35 ms returned sat
[2024-05-31 20:38:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:54] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:38:54] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-31 20:38:54] [INFO ] [Nat]Added 373 Read/Feed constraints in 27 ms returned sat
[2024-05-31 20:38:54] [INFO ] Computed and/alt/rep : 262/722/262 causal constraints (skipped 133 transitions) in 20 ms.
[2024-05-31 20:38:54] [INFO ] Added : 8 causal constraints over 2 iterations in 78 ms. Result :sat
Minimization took 229 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 152/152 places, 405/405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
[2024-05-31 20:38:54] [INFO ] Invariant cache hit.
[2024-05-31 20:38:54] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-31 20:38:54] [INFO ] Invariant cache hit.
[2024-05-31 20:38:55] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-31 20:38:55] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2024-05-31 20:38:55] [INFO ] Redundant transitions in 4 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-31 20:38:55] [INFO ] Invariant cache hit.
[2024-05-31 20:38:55] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Problem TDEAD400 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 6 (OVERLAPS) 1/557 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 8 (OVERLAPS) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 535 constraints, problems are : Problem set: 1 solved, 394 unsolved in 29036 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 1 solved, 394 unsolved
Problem TDEAD139 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 393/927 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 7 (OVERLAPS) 1/557 variables, 1/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/557 variables, 0/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 928 constraints, problems are : Problem set: 2 solved, 393 unsolved in 25107 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 393/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 54229ms problems are : Problem set: 2 solved, 393 unsolved
Search for dead transitions found 2 dead transitions in 54233ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 152/152 places, 403/405 transitions.
Graph (complete) has 708 edges and 152 vertex of which 151 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 150 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 150 transition count 401
Applied a total of 3 rules in 5 ms. Remains 150 /152 variables (removed 2) and now considering 401/403 (removed 2) transitions.
// Phase 1: matrix 401 rows 150 cols
[2024-05-31 20:39:49] [INFO ] Computed 11 invariants in 3 ms
[2024-05-31 20:39:49] [INFO ] Implicit Places using invariants in 84 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 149/152 places, 401/405 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 148 transition count 408
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 148 transition count 400
Applied a total of 10 rules in 11 ms. Remains 148 /149 variables (removed 1) and now considering 400/401 (removed 1) transitions.
// Phase 1: matrix 400 rows 148 cols
[2024-05-31 20:39:49] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 20:39:49] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 20:39:49] [INFO ] Invariant cache hit.
[2024-05-31 20:39:49] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:39:50] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 148/152 places, 400/405 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 55393 ms. Remains : 148/152 places, 400/405 transitions.
[2024-05-31 20:39:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22520 resets) in 2167 ms. (461 steps per ms)
BEST_FIRST walk for 1000000 steps (2104 resets) in 469 ms. (2127 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:39:52] [INFO ] Invariant cache hit.
[2024-05-31 20:39:52] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:39:52] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:39:53] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-31 20:39:53] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:39:53] [INFO ] [Real]Added 361 Read/Feed constraints in 24 ms returned sat
[2024-05-31 20:39:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:39:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-31 20:39:53] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:39:53] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-31 20:39:53] [INFO ] [Nat]Added 361 Read/Feed constraints in 27 ms returned sat
[2024-05-31 20:39:53] [INFO ] Computed and/alt/rep : 230/576/230 causal constraints (skipped 160 transitions) in 21 ms.
[2024-05-31 20:39:53] [INFO ] Added : 8 causal constraints over 2 iterations in 77 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 148/148 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 3 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-31 20:39:53] [INFO ] Invariant cache hit.
[2024-05-31 20:39:53] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 20:39:53] [INFO ] Invariant cache hit.
[2024-05-31 20:39:53] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:39:53] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2024-05-31 20:39:53] [INFO ] Redundant transitions in 2 ms returned []
Running 390 sub problems to find dead transitions.
[2024-05-31 20:39:53] [INFO ] Invariant cache hit.
[2024-05-31 20:39:53] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-31 20:39:56] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-31 20:39:56] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 521 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 390/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (OVERLAPS) 1/548 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 911 constraints, problems are : Problem set: 0 solved, 390 unsolved in 23664 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
After SMT, in 53750ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 53753ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54256 ms. Remains : 148/148 places, 400/400 transitions.
RANDOM walk for 40000 steps (901 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (80 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (84 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1177819 steps, run timeout after 3007 ms. (steps per millisecond=391 ) properties seen :0 out of 2
Probabilistic random walk after 1177819 steps, saw 144321 distinct states, run finished after 3007 ms. (steps per millisecond=391 ) properties seen :0
[2024-05-31 20:40:50] [INFO ] Invariant cache hit.
[2024-05-31 20:40:50] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 24/216 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 10/226 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 268/494 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/494 variables, 227/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 20 (OVERLAPS) 54/548 variables, 42/507 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/548 variables, 12/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/548 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 519 constraints, problems are : Problem set: 1 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/216 variables, 1/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 5/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/226 variables, 8/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 6/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 1/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 268/494 variables, 60/239 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 227/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 0/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/548 variables, 42/508 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 12/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/548 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 520 constraints, problems are : Problem set: 1 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 375ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 148/148 places, 400/400 transitions.
RANDOM walk for 40000 steps (899 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (83 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1738698 steps, run timeout after 3001 ms. (steps per millisecond=579 ) properties seen :0 out of 1
Probabilistic random walk after 1738698 steps, saw 210932 distinct states, run finished after 3001 ms. (steps per millisecond=579 ) properties seen :0
[2024-05-31 20:40:54] [INFO ] Invariant cache hit.
[2024-05-31 20:40:54] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/216 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/226 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 268/494 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/494 variables, 227/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 54/548 variables, 42/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/548 variables, 12/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/548 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/216 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/226 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 268/494 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 227/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/548 variables, 42/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 12/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/548 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 327ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 10 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 148/148 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-31 20:40:54] [INFO ] Invariant cache hit.
[2024-05-31 20:40:54] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-31 20:40:54] [INFO ] Invariant cache hit.
[2024-05-31 20:40:54] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:40:55] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2024-05-31 20:40:55] [INFO ] Redundant transitions in 4 ms returned []
Running 390 sub problems to find dead transitions.
[2024-05-31 20:40:55] [INFO ] Invariant cache hit.
[2024-05-31 20:40:55] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-31 20:40:57] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-31 20:40:57] [INFO ] Deduced a trap composed of 12 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 521 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 390/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (OVERLAPS) 1/548 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 911 constraints, problems are : Problem set: 0 solved, 390 unsolved in 24352 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
After SMT, in 54454ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 54459ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54950 ms. Remains : 148/148 places, 400/400 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 148 vertex of which 108 / 148 are part of one of the 3 SCC in 1 ms
Free SCC test removed 105 places
Drop transitions (Empty/Sink Transition effects.) removed 261 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 355 transitions.
Graph (complete) has 97 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 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 21 rules applied. Total rules applied 23 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 2 transition count 3
Applied a total of 43 rules in 4 ms. Remains 2 /148 variables (removed 146) and now considering 3/400 (removed 397) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-31 20:41:49] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 20:41:49] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:41:49] [INFO ] After 3ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-31 20:41:49] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:41:49] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:41:49] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:41:49] [INFO ] After 19ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 44 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-11 in 178515 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-31 20:41:49] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (202 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (19 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:41:49] [INFO ] Invariant cache hit.
[2024-05-31 20:41:49] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:41:49] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:41:49] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-31 20:41:49] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-31 20:41:49] [INFO ] [Real]Added 361 Read/Feed constraints in 26 ms returned sat
[2024-05-31 20:41:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:41:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:41:49] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:41:49] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-31 20:41:49] [INFO ] [Nat]Added 361 Read/Feed constraints in 28 ms returned sat
[2024-05-31 20:41:49] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 22 ms.
[2024-05-31 20:41:49] [INFO ] Added : 7 causal constraints over 2 iterations in 85 ms. Result :sat
Minimization took 180 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 405
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 152 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 151 transition count 404
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 151 transition count 404
Applied a total of 15 rules in 12 ms. Remains 151 /155 variables (removed 4) and now considering 404/408 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 151/155 places, 404/408 transitions.
// Phase 1: matrix 404 rows 151 cols
[2024-05-31 20:41:50] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20423 resets) in 2146 ms. (465 steps per ms)
BEST_FIRST walk for 1000001 steps (1955 resets) in 485 ms. (2057 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:41:52] [INFO ] Invariant cache hit.
[2024-05-31 20:41:52] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:41:52] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:41:52] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-31 20:41:52] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-31 20:41:52] [INFO ] [Real]Added 374 Read/Feed constraints in 26 ms returned sat
[2024-05-31 20:41:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:41:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:41:53] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:41:53] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-31 20:41:53] [INFO ] [Nat]Added 374 Read/Feed constraints in 28 ms returned sat
[2024-05-31 20:41:53] [INFO ] Computed and/alt/rep : 261/724/261 causal constraints (skipped 133 transitions) in 22 ms.
[2024-05-31 20:41:53] [INFO ] Added : 7 causal constraints over 2 iterations in 84 ms. Result :sat
Minimization took 278 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 3 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 151/151 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 3 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-31 20:41:53] [INFO ] Invariant cache hit.
[2024-05-31 20:41:53] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-31 20:41:53] [INFO ] Invariant cache hit.
[2024-05-31 20:41:53] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-31 20:41:54] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2024-05-31 20:41:54] [INFO ] Redundant transitions in 3 ms returned []
Running 394 sub problems to find dead transitions.
[2024-05-31 20:41:54] [INFO ] Invariant cache hit.
[2024-05-31 20:41:54] [INFO ] State equation strengthened by 374 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Problem TDEAD399 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 1/555 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 535 constraints, problems are : Problem set: 1 solved, 393 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 1 solved, 393 unsolved
Problem TDEAD136 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 392/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 1/555 variables, 1/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 927 constraints, problems are : Problem set: 2 solved, 392 unsolved in 25803 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 392/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 55898ms problems are : Problem set: 2 solved, 392 unsolved
Search for dead transitions found 2 dead transitions in 55903ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 151/151 places, 402/404 transitions.
Graph (complete) has 708 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 149 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 149 transition count 400
Applied a total of 3 rules in 9 ms. Remains 149 /151 variables (removed 2) and now considering 400/402 (removed 2) transitions.
// Phase 1: matrix 400 rows 149 cols
[2024-05-31 20:42:50] [INFO ] Computed 11 invariants in 1 ms
[2024-05-31 20:42:50] [INFO ] Implicit Places using invariants in 82 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 148/151 places, 400/404 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 147 transition count 399
Applied a total of 10 rules in 16 ms. Remains 147 /148 variables (removed 1) and now considering 399/400 (removed 1) transitions.
// Phase 1: matrix 399 rows 147 cols
[2024-05-31 20:42:50] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 20:42:50] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-31 20:42:50] [INFO ] Invariant cache hit.
[2024-05-31 20:42:50] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-31 20:42:50] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 147/151 places, 399/404 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 57236 ms. Remains : 147/151 places, 399/404 transitions.
[2024-05-31 20:42:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22588 resets) in 2181 ms. (458 steps per ms)
BEST_FIRST walk for 1000001 steps (2080 resets) in 471 ms. (2118 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-31 20:42:53] [INFO ] Invariant cache hit.
[2024-05-31 20:42:53] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:42:53] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:42:53] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-31 20:42:53] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-31 20:42:53] [INFO ] [Real]Added 362 Read/Feed constraints in 25 ms returned sat
[2024-05-31 20:42:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:42:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-31 20:42:53] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:42:53] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-31 20:42:53] [INFO ] [Nat]Added 362 Read/Feed constraints in 26 ms returned sat
[2024-05-31 20:42:53] [INFO ] Computed and/alt/rep : 229/578/229 causal constraints (skipped 160 transitions) in 20 ms.
[2024-05-31 20:42:53] [INFO ] Added : 5 causal constraints over 1 iterations in 64 ms. Result :sat
Minimization took 162 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-31 20:42:53] [INFO ] Invariant cache hit.
[2024-05-31 20:42:53] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-31 20:42:53] [INFO ] Invariant cache hit.
[2024-05-31 20:42:54] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-31 20:42:54] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2024-05-31 20:42:54] [INFO ] Redundant transitions in 5 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-31 20:42:54] [INFO ] Invariant cache hit.
[2024-05-31 20:42:54] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-31 20:42:56] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-31 20:42:57] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 23720 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 53814ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 53818ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54394 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (891 resets) in 518 ms. (77 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (77 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (80 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1141260 steps, run timeout after 3001 ms. (steps per millisecond=380 ) properties seen :0 out of 2
Probabilistic random walk after 1141260 steps, saw 139599 distinct states, run finished after 3001 ms. (steps per millisecond=380 ) properties seen :0
[2024-05-31 20:43:51] [INFO ] Invariant cache hit.
[2024-05-31 20:43:51] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 143/199 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 114/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 23/222 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/233 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/233 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 271/504 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/504 variables, 233/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 19 (OVERLAPS) 42/546 variables, 36/513 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 6/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 519 constraints, problems are : Problem set: 1 solved, 1 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 143/199 variables, 30/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 114/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/222 variables, 1/160 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 4/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/233 variables, 8/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 7/180 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 20:43:51] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/233 variables, 1/181 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/233 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 271/504 variables, 65/246 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 233/479 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/504 variables, 0/479 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/546 variables, 36/515 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 6/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 415ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (899 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (81 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1766537 steps, run timeout after 3001 ms. (steps per millisecond=588 ) properties seen :0 out of 1
Probabilistic random walk after 1766537 steps, saw 214525 distinct states, run finished after 3001 ms. (steps per millisecond=588 ) properties seen :0
[2024-05-31 20:43:54] [INFO ] Invariant cache hit.
[2024-05-31 20:43:54] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 143/199 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 114/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/222 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/233 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/233 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 271/504 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/504 variables, 233/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/546 variables, 36/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 143/199 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 114/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/222 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/233 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:43:55] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/233 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/233 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 271/504 variables, 65/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 233/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/504 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/546 variables, 36/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 350ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-31 20:43:55] [INFO ] Invariant cache hit.
[2024-05-31 20:43:55] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 20:43:55] [INFO ] Invariant cache hit.
[2024-05-31 20:43:55] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-31 20:43:55] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-05-31 20:43:55] [INFO ] Redundant transitions in 4 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-31 20:43:55] [INFO ] Invariant cache hit.
[2024-05-31 20:43:55] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-31 20:43:57] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-31 20:43:58] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 24379 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 54478ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 54483ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55015 ms. Remains : 147/147 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 325 edges and 147 vertex of which 107 / 147 are part of one of the 3 SCC in 0 ms
Free SCC test removed 104 places
Drop transitions (Empty/Sink Transition effects.) removed 260 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 354 transitions.
Graph (complete) has 97 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 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 21 rules applied. Total rules applied 23 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 2 transition count 3
Applied a total of 43 rules in 3 ms. Remains 2 /147 variables (removed 145) and now considering 3/399 (removed 396) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-31 20:44:50] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 20:44:50] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:44:50] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:44:50] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:44:50] [INFO ] After 18ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 45 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-14 in 180788 ms.
[2024-05-31 20:44:50] [INFO ] Flatten gal took : 46 ms
[2024-05-31 20:44:50] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-31 20:44:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 155 places, 408 transitions and 1599 arcs took 5 ms.
Total runtime 1991213 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-010-UpperBounds-00
Could not compute solution for formula : CANInsertWithFailure-PT-010-UpperBounds-01
Could not compute solution for formula : CANInsertWithFailure-PT-010-UpperBounds-02
Could not compute solution for formula : CANInsertWithFailure-PT-010-UpperBounds-03
Could not compute solution for formula : CANInsertWithFailure-PT-010-UpperBounds-05
Could not compute solution for formula : CANInsertWithFailure-PT-010-UpperBounds-07
Could not compute solution for formula : CANInsertWithFailure-PT-010-UpperBounds-09
Could not compute solution for formula : CANInsertWithFailure-PT-010-UpperBounds-10
Could not compute solution for formula : CANInsertWithFailure-PT-010-UpperBounds-11
Could not compute solution for formula : CANInsertWithFailure-PT-010-UpperBounds-14

BK_STOP 1717188290871

--------------------
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-010-UpperBounds-00
ub formula formula --maxsum=/tmp/3042/ub_0_
ub formula name CANInsertWithFailure-PT-010-UpperBounds-01
ub formula formula --maxsum=/tmp/3042/ub_1_
ub formula name CANInsertWithFailure-PT-010-UpperBounds-02
ub formula formula --maxsum=/tmp/3042/ub_2_
ub formula name CANInsertWithFailure-PT-010-UpperBounds-03
ub formula formula --maxsum=/tmp/3042/ub_3_
ub formula name CANInsertWithFailure-PT-010-UpperBounds-05
ub formula formula --maxsum=/tmp/3042/ub_4_
ub formula name CANInsertWithFailure-PT-010-UpperBounds-07
ub formula formula --maxsum=/tmp/3042/ub_5_
ub formula name CANInsertWithFailure-PT-010-UpperBounds-09
ub formula formula --maxsum=/tmp/3042/ub_6_
ub formula name CANInsertWithFailure-PT-010-UpperBounds-10
ub formula formula --maxsum=/tmp/3042/ub_7_
ub formula name CANInsertWithFailure-PT-010-UpperBounds-11
ub formula formula --maxsum=/tmp/3042/ub_8_
ub formula name CANInsertWithFailure-PT-010-UpperBounds-14
ub formula formula --maxsum=/tmp/3042/ub_9_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-010"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CANInsertWithFailure-PT-010, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505100101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-010.tgz
mv CANInsertWithFailure-PT-010 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;