About the Execution of GreatSPN+red for FunctionPointer-PT-b004
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1442.815 | 645995.00 | 796075.00 | 1565.90 | 0 ? inf ? inf ? 0 ? 0 inf ? inf 0 inf 1 0 | normal |
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.r179-tall-171640601100229.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 greatspnxred
Input is FunctionPointer-PT-b004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601100229
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 11 16:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b004-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716431730217
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:35:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 02:35:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:35:31] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-23 02:35:31] [INFO ] Transformed 306 places.
[2024-05-23 02:35:31] [INFO ] Transformed 840 transitions.
[2024-05-23 02:35:31] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 84 places in 12 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b004-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:35:31] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2024-05-23 02:35:31] [INFO ] Computed 4 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 1]
RANDOM walk for 10002 steps (23 resets) in 57 ms. (172 steps per ms)
FORMULA FunctionPointer-PT-b004-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100009 steps (27 resets) in 109 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 2, 4, 5, 5, 5, 15, 3, 5, 6] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:35:31] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
[2024-05-23 02:35:31] [INFO ] Invariant cache hit.
[2024-05-23 02:35:32] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 02:35:32] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-23 02:35:32] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-23 02:35:32] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-23 02:35:32] [INFO ] [Real]Added 65 Read/Feed constraints in 15 ms returned sat
[2024-05-23 02:35:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:35:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-05-23 02:35:32] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:35:32] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-23 02:35:32] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-23 02:35:32] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 34 ms to minimize.
[2024-05-23 02:35:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
[2024-05-23 02:35:32] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 56 ms.
[2024-05-23 02:35:32] [INFO ] Added : 1 causal constraints over 1 iterations in 118 ms. Result :sat
Minimization took 76 ms.
[2024-05-23 02:35:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:35:33] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-05-23 02:35:33] [INFO ] [Real]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-23 02:35:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:35:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 02:35:33] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:35:33] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-23 02:35:33] [INFO ] [Nat]Added 65 Read/Feed constraints in 19 ms returned sat
[2024-05-23 02:35:33] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 2 ms to minimize.
[2024-05-23 02:35:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2024-05-23 02:35:33] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 70 ms.
[2024-05-23 02:35:33] [INFO ] Added : 4 causal constraints over 2 iterations in 147 ms. Result :sat
Minimization took 83 ms.
[2024-05-23 02:35:33] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 02:35:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:35:33] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-23 02:35:33] [INFO ] [Real]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-23 02:35:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:35:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:35:34] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-23 02:35:34] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-23 02:35:34] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 2 ms to minimize.
[2024-05-23 02:35:34] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 2 ms to minimize.
[2024-05-23 02:35:34] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 3 ms to minimize.
[2024-05-23 02:35:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 380 ms
[2024-05-23 02:35:34] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 35 ms.
[2024-05-23 02:35:34] [INFO ] Added : 3 causal constraints over 1 iterations in 88 ms. Result :sat
Minimization took 76 ms.
[2024-05-23 02:35:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:35:34] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-23 02:35:34] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-23 02:35:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:35:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:35:34] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-23 02:35:34] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-23 02:35:35] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 5 ms to minimize.
[2024-05-23 02:35:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2024-05-23 02:35:35] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 42 ms.
[2024-05-23 02:35:35] [INFO ] Added : 1 causal constraints over 1 iterations in 101 ms. Result :sat
Minimization took 79 ms.
[2024-05-23 02:35:35] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:35] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:35:35] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-23 02:35:35] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-23 02:35:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:35:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:35] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:35:35] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-23 02:35:35] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-23 02:35:35] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 2 ms to minimize.
[2024-05-23 02:35:35] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-05-23 02:35:35] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2024-05-23 02:35:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 362 ms
[2024-05-23 02:35:35] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 32 ms.
[2024-05-23 02:35:36] [INFO ] Added : 2 causal constraints over 1 iterations in 96 ms. Result :sat
Minimization took 82 ms.
[2024-05-23 02:35:36] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 02:35:36] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:35:36] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-23 02:35:36] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-23 02:35:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:35:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:36] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:35:36] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-23 02:35:36] [INFO ] [Nat]Added 65 Read/Feed constraints in 22 ms returned sat
[2024-05-23 02:35:36] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 2 ms to minimize.
[2024-05-23 02:35:36] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-23 02:35:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2024-05-23 02:35:36] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 26 ms.
[2024-05-23 02:35:36] [INFO ] Added : 2 causal constraints over 1 iterations in 75 ms. Result :sat
Minimization took 84 ms.
[2024-05-23 02:35:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:36] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:35:36] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-23 02:35:37] [INFO ] [Real]Added 65 Read/Feed constraints in 19 ms returned sat
[2024-05-23 02:35:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:35:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:37] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:35:37] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-23 02:35:37] [INFO ] [Nat]Added 65 Read/Feed constraints in 16 ms returned sat
[2024-05-23 02:35:37] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-23 02:35:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2024-05-23 02:35:37] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 29 ms.
[2024-05-23 02:35:37] [INFO ] Added : 1 causal constraints over 1 iterations in 82 ms. Result :sat
Minimization took 75 ms.
[2024-05-23 02:35:37] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:37] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:35:37] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-23 02:35:37] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-23 02:35:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:35:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:37] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:35:37] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-23 02:35:37] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-23 02:35:37] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-23 02:35:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2024-05-23 02:35:37] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 28 ms.
[2024-05-23 02:35:37] [INFO ] Added : 1 causal constraints over 1 iterations in 69 ms. Result :sat
Minimization took 89 ms.
[2024-05-23 02:35:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:35:38] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-23 02:35:38] [INFO ] [Real]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-23 02:35:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:35:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:35:38] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-23 02:35:38] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-23 02:35:38] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 25 ms.
[2024-05-23 02:35:38] [INFO ] Added : 2 causal constraints over 1 iterations in 66 ms. Result :sat
Minimization took 79 ms.
[2024-05-23 02:35:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:35:38] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-23 02:35:38] [INFO ] [Real]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-23 02:35:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:35:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:35:38] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-23 02:35:38] [INFO ] [Nat]Added 65 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:35:38] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-05-23 02:35:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2024-05-23 02:35:38] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 28 ms.
[2024-05-23 02:35:38] [INFO ] Added : 1 causal constraints over 1 iterations in 71 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 2, 4, 5, 5, 5, 15, 3, 5, 6] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 2, 4, 5, 5, 5, 15, 3, 5, 6] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 10 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 195 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.3 ms
Discarding 27 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 195 transition count 611
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 63 place count 170 transition count 455
Iterating global reduction 1 with 25 rules applied. Total rules applied 88 place count 170 transition count 455
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 112 place count 170 transition count 431
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 127 place count 155 transition count 401
Iterating global reduction 2 with 15 rules applied. Total rules applied 142 place count 155 transition count 401
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 146 place count 155 transition count 397
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 152 place count 149 transition count 385
Iterating global reduction 3 with 6 rules applied. Total rules applied 158 place count 149 transition count 385
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 164 place count 143 transition count 361
Iterating global reduction 3 with 6 rules applied. Total rules applied 170 place count 143 transition count 361
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 175 place count 138 transition count 351
Iterating global reduction 3 with 5 rules applied. Total rules applied 180 place count 138 transition count 351
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 184 place count 134 transition count 335
Iterating global reduction 3 with 4 rules applied. Total rules applied 188 place count 134 transition count 335
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 192 place count 130 transition count 319
Iterating global reduction 3 with 4 rules applied. Total rules applied 196 place count 130 transition count 319
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 200 place count 126 transition count 311
Iterating global reduction 3 with 4 rules applied. Total rules applied 204 place count 126 transition count 311
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 208 place count 122 transition count 303
Iterating global reduction 3 with 4 rules applied. Total rules applied 212 place count 122 transition count 303
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 216 place count 118 transition count 295
Iterating global reduction 3 with 4 rules applied. Total rules applied 220 place count 118 transition count 295
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 224 place count 114 transition count 287
Iterating global reduction 3 with 4 rules applied. Total rules applied 228 place count 114 transition count 287
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 231 place count 111 transition count 281
Iterating global reduction 3 with 3 rules applied. Total rules applied 234 place count 111 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 242 place count 111 transition count 273
Applied a total of 242 rules in 123 ms. Remains 111 /222 variables (removed 111) and now considering 273/648 (removed 375) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 111/222 places, 273/648 transitions.
[2024-05-23 02:35:39] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
Found an invariant !
This invariant on transitions {35=1, 90=1, 126=1, 162=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {31=1, 86=1, 138=1, 170=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 4 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :[2, 25, 1, 4, 1, 1, 4, 1, 3, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[6, 25, 4, 5, 5, 5, 15, 3, 5, 6] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:35:39] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
// Phase 1: matrix 178 rows 111 cols
[2024-05-23 02:35:39] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6, 25, 4, 5, 5, 5, 15, 3, 5, 6] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000002 steps (2 resets) in 1231 ms. (811 steps per ms)
BEST_FIRST walk for 10000010 steps (22 resets) in 4635 ms. (2157 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501, 8020, 4, 5, 5, 5, 1174, 795, 5, 8568] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:35:45] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
[2024-05-23 02:35:45] [INFO ] Invariant cache hit.
[2024-05-23 02:35:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:35:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:35:45] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-23 02:35:45] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 02:35:45] [INFO ] [Real]Added 33 Read/Feed constraints in 8 ms returned sat
[2024-05-23 02:35:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:35:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:35:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:35:45] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-23 02:35:45] [INFO ] [Nat]Added 33 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:35:45] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 10 ms.
[2024-05-23 02:35:45] [INFO ] Added : 19 causal constraints over 6 iterations in 93 ms. Result :sat
Minimization took 35 ms.
[2024-05-23 02:35:45] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:35:45] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:35:45] [INFO ] [Real]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:35:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:35:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:35:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:35:45] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:35:45] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:35:45] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 13 ms.
[2024-05-23 02:35:45] [INFO ] Added : 30 causal constraints over 7 iterations in 106 ms. Result :sat
Minimization took 37 ms.
[2024-05-23 02:35:45] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:35:45] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:35:45] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:35:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:35:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:35:45] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 02:35:45] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:35:45] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 10 ms.
[2024-05-23 02:35:45] [INFO ] Added : 2 causal constraints over 1 iterations in 29 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 02:35:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:35:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:35:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Nat]Added 33 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:35:46] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 10 ms.
[2024-05-23 02:35:46] [INFO ] Added : 9 causal constraints over 4 iterations in 61 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 02:35:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:35:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:35:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:35:46] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 11 ms.
[2024-05-23 02:35:46] [INFO ] Added : 6 causal constraints over 3 iterations in 58 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 02:35:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:35:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:35:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:35:46] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 9 ms.
[2024-05-23 02:35:46] [INFO ] Added : 7 causal constraints over 2 iterations in 37 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 02:35:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Real]Added 33 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:35:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:35:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-23 02:35:46] [INFO ] [Nat]Added 33 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:35:46] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 13 ms.
[2024-05-23 02:35:46] [INFO ] Added : 4 causal constraints over 2 iterations in 43 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 02:35:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:35:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-23 02:35:47] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-23 02:35:47] [INFO ] [Real]Added 33 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:35:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:35:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:35:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:35:47] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-23 02:35:47] [INFO ] [Nat]Added 33 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:35:47] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 11 ms.
[2024-05-23 02:35:47] [INFO ] Added : 11 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 35 ms.
[2024-05-23 02:35:47] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:35:47] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:35:47] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:35:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:35:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:35:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 02:35:47] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-23 02:35:47] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:35:47] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 10 ms.
[2024-05-23 02:35:47] [INFO ] Added : 21 causal constraints over 5 iterations in 81 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 02:35:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:35:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:35:47] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:35:47] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:35:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:35:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 02:35:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:35:47] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:35:47] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:35:47] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 9 ms.
[2024-05-23 02:35:47] [INFO ] Added : 9 causal constraints over 4 iterations in 60 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501, 8020, 4, 5, 5, 5, 1174, 795, 5, 8568] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501, 99116, 4, 5, 5, 6, 1174, 795, 5, 8568] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 10 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 273/273 transitions.
Applied a total of 0 rules in 23 ms. Remains 111 /111 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 111/111 places, 273/273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 273/273 transitions.
Applied a total of 0 rules in 8 ms. Remains 111 /111 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2024-05-23 02:36:29] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
[2024-05-23 02:36:29] [INFO ] Invariant cache hit.
[2024-05-23 02:36:30] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-23 02:36:30] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
[2024-05-23 02:36:30] [INFO ] Invariant cache hit.
[2024-05-23 02:36:30] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 02:36:30] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-05-23 02:36:30] [INFO ] Redundant transitions in 10 ms returned []
Running 271 sub problems to find dead transitions.
[2024-05-23 02:36:30] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
[2024-05-23 02:36:30] [INFO ] Invariant cache hit.
[2024-05-23 02:36:30] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 178/288 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 33/145 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 271 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/289 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 0/289 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 146 constraints, problems are : Problem set: 0 solved, 271 unsolved in 7290 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 178/288 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 33/145 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 32/177 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 1/289 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 239/417 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 417 constraints, problems are : Problem set: 0 solved, 271 unsolved in 10590 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints]
After SMT, in 18402ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 18419ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18861 ms. Remains : 111/111 places, 273/273 transitions.
[2024-05-23 02:36:48] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
Found an invariant !
This invariant on transitions {35=1, 90=1, 126=1, 162=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 86=1, 138=1, 170=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 10) seen :[2, 37, 0, 0, 0, 0, 2147483647, 2, 0, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[501, 99116, 4, 5, 5, 6, +inf, 795, 5, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:36:48] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
[2024-05-23 02:36:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501, 99116, 4, 5, 5, 6, +inf, 795, 5, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1181 ms. (846 steps per ms)
FORMULA FunctionPointer-PT-b004-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-UpperBounds-09 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 8000007 steps (18 resets) in 3906 ms. (2047 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[750, 99116, 4, 8, 5, 6, 795, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:36:54] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
[2024-05-23 02:36:54] [INFO ] Invariant cache hit.
[2024-05-23 02:36:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:36:54] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 02:36:54] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:36:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:36:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Nat]Added 33 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:36:54] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 10 ms.
[2024-05-23 02:36:54] [INFO ] Added : 19 causal constraints over 6 iterations in 83 ms. Result :sat
Minimization took 35 ms.
[2024-05-23 02:36:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:36:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:36:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:36:54] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 11 ms.
[2024-05-23 02:36:54] [INFO ] Added : 30 causal constraints over 7 iterations in 93 ms. Result :sat
Minimization took 37 ms.
[2024-05-23 02:36:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:36:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:36:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:36:54] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 11 ms.
[2024-05-23 02:36:54] [INFO ] Added : 2 causal constraints over 1 iterations in 29 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 02:36:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:36:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:36:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:36:54] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:36:54] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 11 ms.
[2024-05-23 02:36:55] [INFO ] Added : 7 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 02:36:55] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Real]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:36:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:36:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:36:55] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 13 ms.
[2024-05-23 02:36:55] [INFO ] Added : 6 causal constraints over 3 iterations in 53 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 02:36:55] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:36:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:36:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:36:55] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 12 ms.
[2024-05-23 02:36:55] [INFO ] Added : 7 causal constraints over 2 iterations in 37 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 02:36:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Real]Added 33 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:36:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:36:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Nat]Added 33 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:36:55] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 11 ms.
[2024-05-23 02:36:55] [INFO ] Added : 11 causal constraints over 3 iterations in 48 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 02:36:55] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:36:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:36:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:36:55] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:36:55] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 11 ms.
[2024-05-23 02:36:56] [INFO ] Added : 20 causal constraints over 5 iterations in 70 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[750, 99116, 4, 8, 5, 6, 795, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[750, 128054, 4, 8, 5, 6, 795, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 273/273 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 109 transition count 269
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 109 transition count 269
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 109 transition count 267
Applied a total of 6 rules in 11 ms. Remains 109 /111 variables (removed 2) and now considering 267/273 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 109/111 places, 267/273 transitions.
[2024-05-23 02:37:26] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
Found an invariant !
This invariant on transitions {29=1, 81=1, 133=1, 172=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {36=1, 88=1, 140=1, 168=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :[1, 2, 1, 2, 1, 1, 3, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[750, 128054, 4, 8, 5, 6, 795, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:37:26] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
// Phase 1: matrix 173 rows 109 cols
[2024-05-23 02:37:26] [INFO ] Computed 2 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[750, 128054, 4, 8, 5, 6, 795, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1139 ms. (877 steps per ms)
BEST_FIRST walk for 8000008 steps (22 resets) in 3741 ms. (2137 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[750, 128054, 4, 8, 5, 6, 997, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:37:31] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:37:31] [INFO ] Invariant cache hit.
[2024-05-23 02:37:31] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:37:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:37:31] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:37:31] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-23 02:37:31] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:37:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:37:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:37:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:37:31] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:37:31] [INFO ] [Nat]Added 31 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:37:31] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 11 ms.
[2024-05-23 02:37:31] [INFO ] Added : 11 causal constraints over 4 iterations in 54 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 02:37:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:37:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-23 02:37:31] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:37:31] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:37:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:37:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:37:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:37:31] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:37:31] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:37:32] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:37:32] [INFO ] Added : 33 causal constraints over 8 iterations in 103 ms. Result :sat
Minimization took 37 ms.
[2024-05-23 02:37:32] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:37:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:37:32] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:37:32] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:37:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:37:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:37:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:37:32] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:37:32] [INFO ] [Nat]Added 31 Read/Feed constraints in 7 ms returned sat
[2024-05-23 02:37:32] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 11 ms.
[2024-05-23 02:37:32] [INFO ] Added : 6 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 02:37:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:37:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:37:32] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:37:32] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:37:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:37:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:37:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:37:32] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:37:32] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:37:32] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:37:32] [INFO ] Added : 28 causal constraints over 8 iterations in 94 ms. Result :sat
Minimization took 36 ms.
[2024-05-23 02:37:32] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:37:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:37:32] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:37:32] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:37:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:37:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:37:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:37:32] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:37:32] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:37:32] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:37:32] [INFO ] Added : 11 causal constraints over 4 iterations in 54 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 02:37:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:37:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:37:32] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:37:32] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:37:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:37:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:37:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:37:33] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:37:33] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:37:33] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 11 ms.
[2024-05-23 02:37:33] [INFO ] Added : 10 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 02:37:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:37:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:37:33] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-23 02:37:33] [INFO ] [Real]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:37:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:37:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:37:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:37:33] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:37:33] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:37:33] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:37:33] [INFO ] Added : 11 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 02:37:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:37:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:37:33] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:37:33] [INFO ] [Real]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:37:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:37:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:37:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:37:33] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:37:33] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:37:33] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:37:33] [INFO ] Added : 11 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[750, 128054, 4, 8, 5, 6, 997, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[750, 128054, 4, 8, 5, 6, 997, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Applied a total of 0 rules in 20 ms. Remains 109 /109 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 109/109 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Applied a total of 0 rules in 7 ms. Remains 109 /109 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-23 02:38:06] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:38:06] [INFO ] Invariant cache hit.
[2024-05-23 02:38:06] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-23 02:38:06] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:38:06] [INFO ] Invariant cache hit.
[2024-05-23 02:38:07] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-23 02:38:07] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-05-23 02:38:07] [INFO ] Redundant transitions in 4 ms returned []
Running 265 sub problems to find dead transitions.
[2024-05-23 02:38:07] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:38:07] [INFO ] Invariant cache hit.
[2024-05-23 02:38:07] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 173/281 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 31/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/282 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 142 constraints, problems are : Problem set: 0 solved, 265 unsolved in 6761 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 173/281 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 31/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 32/173 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/282 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 233/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (OVERLAPS) 0/282 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 407 constraints, problems are : Problem set: 0 solved, 265 unsolved in 9613 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints]
After SMT, in 16603ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 16607ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16847 ms. Remains : 109/109 places, 267/267 transitions.
[2024-05-23 02:38:23] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
Found an invariant !
This invariant on transitions {29=1, 81=1, 133=1, 172=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {36=1, 88=1, 140=1, 168=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :[1, 3, 1, 2, 3, 4, 3, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[750, 128054, 4, 8, 5, 6, 997, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:38:23] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:38:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[750, 128054, 4, 8, 5, 6, 997, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1216 ms. (821 steps per ms)
BEST_FIRST walk for 8000008 steps (18 resets) in 3906 ms. (2047 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[751, 128054, 4, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:38:28] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:38:28] [INFO ] Invariant cache hit.
[2024-05-23 02:38:28] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:38:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:38:29] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-23 02:38:29] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:38:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:38:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Nat]Added 31 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:38:29] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 12 ms.
[2024-05-23 02:38:29] [INFO ] Added : 11 causal constraints over 4 iterations in 60 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 02:38:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Real]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:38:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:38:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:38:29] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 12 ms.
[2024-05-23 02:38:29] [INFO ] Added : 33 causal constraints over 8 iterations in 108 ms. Result :sat
Minimization took 38 ms.
[2024-05-23 02:38:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:38:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:38:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Nat]Added 31 Read/Feed constraints in 7 ms returned sat
[2024-05-23 02:38:29] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 11 ms.
[2024-05-23 02:38:29] [INFO ] Added : 6 causal constraints over 3 iterations in 48 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 02:38:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:38:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:38:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:38:29] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:38:29] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:38:30] [INFO ] Added : 24 causal constraints over 7 iterations in 89 ms. Result :sat
Minimization took 36 ms.
[2024-05-23 02:38:30] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:38:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:38:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:38:30] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:38:30] [INFO ] Added : 11 causal constraints over 4 iterations in 50 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 02:38:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:38:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:38:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:38:30] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 11 ms.
[2024-05-23 02:38:30] [INFO ] Added : 10 causal constraints over 3 iterations in 48 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 02:38:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Real]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:38:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:38:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:38:30] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 9 ms.
[2024-05-23 02:38:30] [INFO ] Added : 11 causal constraints over 3 iterations in 45 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 02:38:30] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Real]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:38:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:38:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:38:30] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:38:30] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:38:31] [INFO ] Added : 11 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[751, 128054, 4, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[751, 128054, 4, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Applied a total of 0 rules in 6 ms. Remains 109 /109 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 109/109 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-23 02:39:06] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:39:06] [INFO ] Invariant cache hit.
[2024-05-23 02:39:06] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-23 02:39:06] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:39:06] [INFO ] Invariant cache hit.
[2024-05-23 02:39:06] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-23 02:39:06] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2024-05-23 02:39:06] [INFO ] Redundant transitions in 5 ms returned []
Running 265 sub problems to find dead transitions.
[2024-05-23 02:39:06] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:39:06] [INFO ] Invariant cache hit.
[2024-05-23 02:39:06] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 173/281 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 31/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/282 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 142 constraints, problems are : Problem set: 0 solved, 265 unsolved in 6876 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 173/281 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 31/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 32/173 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/282 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 233/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (OVERLAPS) 0/282 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 407 constraints, problems are : Problem set: 0 solved, 265 unsolved in 9738 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints]
After SMT, in 16842ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 16847ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17165 ms. Remains : 109/109 places, 267/267 transitions.
[2024-05-23 02:39:23] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
Found an invariant !
This invariant on transitions {29=1, 81=1, 133=1, 172=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {36=1, 88=1, 140=1, 168=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :[4, 83, 1, 1, 1, 2, 2, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[751, 128054, 4, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:39:23] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:39:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[751, 128054, 4, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1211 ms. (825 steps per ms)
BEST_FIRST walk for 8000006 steps (16 resets) in 3933 ms. (2033 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[751, 128054, 5, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:39:28] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:39:28] [INFO ] Invariant cache hit.
[2024-05-23 02:39:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:39:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:39:29] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-23 02:39:29] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-23 02:39:29] [INFO ] [Real]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:39:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:39:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:39:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:39:29] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-23 02:39:29] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:39:29] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:39:29] [INFO ] Added : 11 causal constraints over 4 iterations in 59 ms. Result :sat
Minimization took 35 ms.
[2024-05-23 02:39:29] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:39:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:39:29] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:39:29] [INFO ] [Real]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:39:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:39:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:39:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:39:29] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:39:29] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:39:29] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 11 ms.
[2024-05-23 02:39:29] [INFO ] Added : 33 causal constraints over 8 iterations in 116 ms. Result :sat
Minimization took 37 ms.
[2024-05-23 02:39:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:39:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:39:29] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:39:29] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:39:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:39:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:39:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:39:29] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:39:29] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:39:29] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:39:29] [INFO ] Added : 10 causal constraints over 3 iterations in 47 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 02:39:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:39:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:39:29] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:39:29] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:39:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:39:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:39:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:39:29] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Nat]Added 31 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:39:30] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 17 ms.
[2024-05-23 02:39:30] [INFO ] Added : 24 causal constraints over 7 iterations in 93 ms. Result :sat
Minimization took 35 ms.
[2024-05-23 02:39:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:39:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:39:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:39:30] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 11 ms.
[2024-05-23 02:39:30] [INFO ] Added : 11 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 02:39:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:39:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:39:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:39:30] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 11 ms.
[2024-05-23 02:39:30] [INFO ] Added : 10 causal constraints over 3 iterations in 45 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 02:39:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Real]Added 31 Read/Feed constraints in 7 ms returned sat
[2024-05-23 02:39:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:39:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:39:30] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 11 ms.
[2024-05-23 02:39:30] [INFO ] Added : 11 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 02:39:30] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:39:30] [INFO ] [Real]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:39:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:39:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:39:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:39:31] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:39:31] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:39:31] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:39:31] [INFO ] Added : 11 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[751, 128054, 5, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[751, 128054, 5, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Applied a total of 0 rules in 6 ms. Remains 109 /109 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 109/109 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Applied a total of 0 rules in 7 ms. Remains 109 /109 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-23 02:40:06] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:40:06] [INFO ] Invariant cache hit.
[2024-05-23 02:40:06] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-23 02:40:06] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:40:06] [INFO ] Invariant cache hit.
[2024-05-23 02:40:06] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-23 02:40:06] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-05-23 02:40:06] [INFO ] Redundant transitions in 4 ms returned []
Running 265 sub problems to find dead transitions.
[2024-05-23 02:40:06] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:40:06] [INFO ] Invariant cache hit.
[2024-05-23 02:40:06] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 173/281 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 31/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/282 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 142 constraints, problems are : Problem set: 0 solved, 265 unsolved in 6758 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 173/281 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 31/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 32/173 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/282 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 233/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (OVERLAPS) 0/282 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 407 constraints, problems are : Problem set: 0 solved, 265 unsolved in 9642 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints]
After SMT, in 16563ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 16570ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16861 ms. Remains : 109/109 places, 267/267 transitions.
[2024-05-23 02:40:23] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
Found an invariant !
This invariant on transitions {29=1, 81=1, 133=1, 172=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {36=1, 88=1, 140=1, 168=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :[0, 0, 0, 2, 2, 2, 0, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[751, 128054, 5, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:40:23] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:40:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[751, 128054, 5, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1056 ms. (946 steps per ms)
BEST_FIRST walk for 8000008 steps (18 resets) in 3721 ms. (2149 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1682, 128054, 5, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:40:28] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:40:28] [INFO ] Invariant cache hit.
[2024-05-23 02:40:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:40:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:40:28] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-23 02:40:28] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-23 02:40:28] [INFO ] [Real]Added 31 Read/Feed constraints in 9 ms returned sat
[2024-05-23 02:40:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:40:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:40:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:40:28] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-23 02:40:28] [INFO ] [Nat]Added 31 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:40:28] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 9 ms.
[2024-05-23 02:40:28] [INFO ] Added : 11 causal constraints over 4 iterations in 50 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 02:40:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:40:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:40:28] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:40:28] [INFO ] [Real]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:40:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:40:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:40:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:40:28] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-23 02:40:28] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:40:28] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 9 ms.
[2024-05-23 02:40:28] [INFO ] Added : 33 causal constraints over 8 iterations in 93 ms. Result :sat
Minimization took 35 ms.
[2024-05-23 02:40:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:40:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:40:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:40:29] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:40:29] [INFO ] Added : 10 causal constraints over 3 iterations in 45 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 02:40:29] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:40:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:40:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:40:29] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 8 ms.
[2024-05-23 02:40:29] [INFO ] Added : 24 causal constraints over 7 iterations in 80 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 02:40:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Real]Added 31 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:40:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:40:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:40:29] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:40:29] [INFO ] Added : 11 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 02:40:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:40:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:40:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:40:29] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:40:29] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 9 ms.
[2024-05-23 02:40:29] [INFO ] Added : 10 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 02:40:30] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:40:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:40:30] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:40:30] [INFO ] [Real]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:40:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:40:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:40:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:40:30] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:40:30] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:40:30] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 11 ms.
[2024-05-23 02:40:30] [INFO ] Added : 11 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 36 ms.
[2024-05-23 02:40:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:40:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:40:30] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-23 02:40:30] [INFO ] [Real]Added 31 Read/Feed constraints in 21 ms returned sat
[2024-05-23 02:40:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:40:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:40:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:40:30] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:40:30] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:40:30] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 11 ms.
[2024-05-23 02:40:30] [INFO ] Added : 11 causal constraints over 3 iterations in 53 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1682, 128054, 5, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1682, 128054, 5, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 109/109 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-23 02:41:06] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:41:06] [INFO ] Invariant cache hit.
[2024-05-23 02:41:06] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-23 02:41:06] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:41:06] [INFO ] Invariant cache hit.
[2024-05-23 02:41:06] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-23 02:41:06] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-23 02:41:06] [INFO ] Redundant transitions in 0 ms returned []
Running 265 sub problems to find dead transitions.
[2024-05-23 02:41:06] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:41:06] [INFO ] Invariant cache hit.
[2024-05-23 02:41:06] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 173/281 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 31/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/282 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 142 constraints, problems are : Problem set: 0 solved, 265 unsolved in 7015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 173/281 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 31/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 32/173 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/282 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 233/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (OVERLAPS) 0/282 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 407 constraints, problems are : Problem set: 0 solved, 265 unsolved in 9603 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints]
After SMT, in 16791ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 16793ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17053 ms. Remains : 109/109 places, 267/267 transitions.
[2024-05-23 02:41:23] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
Found an invariant !
This invariant on transitions {29=1, 81=1, 133=1, 172=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {36=1, 88=1, 140=1, 168=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :[3, 56, 1, 1, 1, 1, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[1682, 128054, 5, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:41:23] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:41:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1682, 128054, 5, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (3 resets) in 1175 ms. (850 steps per ms)
BEST_FIRST walk for 8000008 steps (18 resets) in 4072 ms. (1964 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1682, 128054, 5, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:41:28] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:41:28] [INFO ] Invariant cache hit.
[2024-05-23 02:41:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:41:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:41:28] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:41:28] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-23 02:41:28] [INFO ] [Real]Added 31 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:41:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:41:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:41:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:41:28] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:41:28] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:41:28] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:41:28] [INFO ] Added : 11 causal constraints over 4 iterations in 56 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 02:41:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:41:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:41:28] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:41:28] [INFO ] [Real]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:41:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:41:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:41:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:41:28] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:41:28] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:41:28] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 11 ms.
[2024-05-23 02:41:29] [INFO ] Added : 33 causal constraints over 8 iterations in 105 ms. Result :sat
Minimization took 40 ms.
[2024-05-23 02:41:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:41:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:41:29] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:41:29] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:41:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:41:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:41:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:41:29] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:41:29] [INFO ] [Nat]Added 31 Read/Feed constraints in 7 ms returned sat
[2024-05-23 02:41:29] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 11 ms.
[2024-05-23 02:41:29] [INFO ] Added : 10 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 02:41:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:41:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:41:29] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:41:29] [INFO ] [Real]Added 31 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:41:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:41:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:41:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:41:29] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:41:29] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:41:29] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 11 ms.
[2024-05-23 02:41:29] [INFO ] Added : 24 causal constraints over 7 iterations in 90 ms. Result :sat
Minimization took 37 ms.
[2024-05-23 02:41:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:41:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:41:29] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:41:29] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:41:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:41:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:41:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:41:29] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:41:29] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:41:29] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:41:29] [INFO ] Added : 11 causal constraints over 4 iterations in 56 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 02:41:29] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:41:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:41:29] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:41:29] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:41:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:41:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:41:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:41:30] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-23 02:41:30] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:41:30] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 11 ms.
[2024-05-23 02:41:30] [INFO ] Added : 10 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 02:41:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:41:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:41:30] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:41:30] [INFO ] [Real]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:41:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:41:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:41:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:41:30] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:41:30] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:41:30] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:41:30] [INFO ] Added : 11 causal constraints over 3 iterations in 49 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 02:41:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:41:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:41:30] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:41:30] [INFO ] [Real]Added 31 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:41:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:41:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:41:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:41:30] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:41:30] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:41:30] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 11 ms.
[2024-05-23 02:41:30] [INFO ] Added : 11 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1682, 128054, 5, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1682, 203634, 5, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 109/109 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-23 02:42:07] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:42:07] [INFO ] Invariant cache hit.
[2024-05-23 02:42:07] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-23 02:42:07] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:42:07] [INFO ] Invariant cache hit.
[2024-05-23 02:42:07] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-23 02:42:08] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-05-23 02:42:08] [INFO ] Redundant transitions in 1 ms returned []
Running 265 sub problems to find dead transitions.
[2024-05-23 02:42:08] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:42:08] [INFO ] Invariant cache hit.
[2024-05-23 02:42:08] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 173/281 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 31/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/282 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 142 constraints, problems are : Problem set: 0 solved, 265 unsolved in 6777 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 173/281 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 31/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 32/173 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/282 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 233/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (OVERLAPS) 0/282 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 407 constraints, problems are : Problem set: 0 solved, 265 unsolved in 9883 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints]
After SMT, in 16819ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 16822ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17071 ms. Remains : 109/109 places, 267/267 transitions.
[2024-05-23 02:42:24] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
Found an invariant !
This invariant on transitions {29=1, 81=1, 133=1, 172=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {36=1, 88=1, 140=1, 168=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :[3, 21, 0, 3, 0, 0, 0, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[1682, 203634, 5, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:42:24] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:42:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1682, 203634, 5, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1087 ms. (919 steps per ms)
BEST_FIRST walk for 8000008 steps (17 resets) in 3701 ms. (2160 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1682, 203634, 5, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:42:29] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:42:29] [INFO ] Invariant cache hit.
[2024-05-23 02:42:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:42:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-23 02:42:29] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:42:29] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-23 02:42:29] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:42:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:42:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:42:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:42:29] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:42:29] [INFO ] [Nat]Added 31 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:42:29] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 9 ms.
[2024-05-23 02:42:29] [INFO ] Added : 11 causal constraints over 4 iterations in 53 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 02:42:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Real]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:42:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:42:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:42:30] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 11 ms.
[2024-05-23 02:42:30] [INFO ] Added : 33 causal constraints over 8 iterations in 102 ms. Result :sat
Minimization took 45 ms.
[2024-05-23 02:42:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:42:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:42:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:42:30] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 11 ms.
[2024-05-23 02:42:30] [INFO ] Added : 10 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 02:42:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:42:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:42:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Nat]Added 31 Read/Feed constraints in 7 ms returned sat
[2024-05-23 02:42:30] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 11 ms.
[2024-05-23 02:42:30] [INFO ] Added : 24 causal constraints over 7 iterations in 84 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 02:42:30] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:42:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:42:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:42:30] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:42:30] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 9 ms.
[2024-05-23 02:42:31] [INFO ] Added : 11 causal constraints over 4 iterations in 53 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 02:42:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:42:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:42:31] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:42:31] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:42:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:42:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:42:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:42:31] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:42:31] [INFO ] [Nat]Added 31 Read/Feed constraints in 7 ms returned sat
[2024-05-23 02:42:31] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:42:31] [INFO ] Added : 10 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 02:42:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:42:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:42:31] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:42:31] [INFO ] [Real]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:42:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:42:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:42:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:42:31] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:42:31] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:42:31] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:42:31] [INFO ] Added : 11 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 37 ms.
[2024-05-23 02:42:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:42:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:42:31] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:42:31] [INFO ] [Real]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:42:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:42:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:42:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:42:31] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:42:31] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:42:31] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:42:31] [INFO ] Added : 11 causal constraints over 3 iterations in 53 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1682, 203634, 5, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1682, 203634, 5, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 109/109 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-23 02:43:08] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:43:08] [INFO ] Invariant cache hit.
[2024-05-23 02:43:08] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-23 02:43:08] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:43:08] [INFO ] Invariant cache hit.
[2024-05-23 02:43:08] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-23 02:43:08] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-23 02:43:08] [INFO ] Redundant transitions in 1 ms returned []
Running 265 sub problems to find dead transitions.
[2024-05-23 02:43:08] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:43:08] [INFO ] Invariant cache hit.
[2024-05-23 02:43:08] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 173/281 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 31/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/282 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 142 constraints, problems are : Problem set: 0 solved, 265 unsolved in 6714 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 173/281 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 31/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 32/173 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/282 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 233/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (OVERLAPS) 0/282 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 407 constraints, problems are : Problem set: 0 solved, 265 unsolved in 9470 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints]
After SMT, in 16353ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 16357ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16594 ms. Remains : 109/109 places, 267/267 transitions.
[2024-05-23 02:43:24] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
Found an invariant !
This invariant on transitions {29=1, 81=1, 133=1, 172=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {36=1, 88=1, 140=1, 168=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :[4, 113, 1, 2, 1, 1, 3, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[1682, 203634, 5, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40002 steps (10 resets) in 1296 ms. (30 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (10 resets) in 180 ms. (221 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (10 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
[2024-05-23 02:43:25] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:43:25] [INFO ] Invariant cache hit.
[2024-05-23 02:43:25] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 114/133 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 11/144 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 119/263 variables, 73/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 29/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 6/269 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 12/281 variables, 12/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/281 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 1/282 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/282 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/282 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 142 constraints, problems are : Problem set: 0 solved, 6 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 114/133 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 11/144 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 119/263 variables, 73/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 29/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 6/269 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 12/281 variables, 12/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/281 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 1/282 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/282 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/282 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 148 constraints, problems are : Problem set: 0 solved, 6 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 531ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 30001 ms.
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Graph (complete) has 455 edges and 109 vertex of which 106 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 106 transition count 261
Applied a total of 7 rules in 17 ms. Remains 106 /109 variables (removed 3) and now considering 261/267 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 106/109 places, 261/267 transitions.
RANDOM walk for 40009 steps (8 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 28 ms. (1379 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
[2024-05-23 02:43:56] [INFO ] Flow matrix only has 167 transitions (discarded 94 similar events)
// Phase 1: matrix 167 rows 106 cols
[2024-05-23 02:43:56] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:43:56] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 108/124 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 13/137 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 115/252 variables, 70/95 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 26/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 6/258 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 14/272 variables, 13/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/272 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/272 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 1/273 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/273 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/273 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 137 constraints, problems are : Problem set: 0 solved, 5 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 108/124 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 13/137 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 115/252 variables, 70/100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 26/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 6/258 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 14/272 variables, 13/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/272 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/272 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 1/273 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/273 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/273 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 142 constraints, problems are : Problem set: 0 solved, 5 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 449ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 261/261 transitions.
Graph (complete) has 446 edges and 106 vertex of which 103 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 103 transition count 256
Applied a total of 6 rules in 7 ms. Remains 103 /106 variables (removed 3) and now considering 256/261 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 103/106 places, 256/261 transitions.
RANDOM walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 4/5 properties
[2024-05-23 02:43:57] [INFO ] Flow matrix only has 162 transitions (discarded 94 similar events)
// Phase 1: matrix 162 rows 103 cols
[2024-05-23 02:43:57] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:43:57] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 99/111 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 13/124 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 117/241 variables, 69/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 24/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 6/247 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 15/262 variables, 14/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/262 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 3/265 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/265 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/265 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 131 constraints, problems are : Problem set: 0 solved, 4 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 99/111 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 13/124 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 117/241 variables, 69/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 24/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 6/247 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 15/262 variables, 14/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/262 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/265 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/265 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/265 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 135 constraints, problems are : Problem set: 0 solved, 4 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 327ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 256/256 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 102 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 101 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 101 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 100 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 100 transition count 248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 99 transition count 246
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 99 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 98 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 98 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 97 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 97 transition count 242
Applied a total of 12 rules in 18 ms. Remains 97 /103 variables (removed 6) and now considering 242/256 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 97/103 places, 242/256 transitions.
RANDOM walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 339399 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 4
Probabilistic random walk after 339399 steps, saw 225141 distinct states, run finished after 3005 ms. (steps per millisecond=112 ) properties seen :0
[2024-05-23 02:44:00] [INFO ] Flow matrix only has 153 transitions (discarded 89 similar events)
// Phase 1: matrix 153 rows 97 cols
[2024-05-23 02:44:00] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:44:00] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 95/107 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 11/118 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 110/228 variables, 65/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 23/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 6/234 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 13/247 variables, 12/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 3/250 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/250 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/250 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 124 constraints, problems are : Problem set: 0 solved, 4 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 95/107 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 11/118 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 110/228 variables, 65/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 23/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 6/234 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 13/247 variables, 12/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/250 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/250 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/250 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 128 constraints, problems are : Problem set: 0 solved, 4 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 331ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 30001 ms.
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 242/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 97 /97 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 97/97 places, 242/242 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-23 02:44:31] [INFO ] Flow matrix only has 153 transitions (discarded 89 similar events)
[2024-05-23 02:44:31] [INFO ] Invariant cache hit.
[2024-05-23 02:44:31] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-23 02:44:31] [INFO ] Flow matrix only has 153 transitions (discarded 89 similar events)
[2024-05-23 02:44:31] [INFO ] Invariant cache hit.
[2024-05-23 02:44:31] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 02:44:31] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-23 02:44:31] [INFO ] Redundant transitions in 1 ms returned []
Running 240 sub problems to find dead transitions.
[2024-05-23 02:44:31] [INFO ] Flow matrix only has 153 transitions (discarded 89 similar events)
[2024-05-23 02:44:31] [INFO ] Invariant cache hit.
[2024-05-23 02:44:31] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 153/249 variables, 96/99 constraints. Problems are: Problem set: 0 solved, 240 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 24/123 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 1/250 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 0/250 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 124 constraints, problems are : Problem set: 0 solved, 240 unsolved in 4763 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 153/249 variables, 96/99 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 24/123 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 1/250 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 208/364 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 364 constraints, problems are : Problem set: 0 solved, 240 unsolved in 7679 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints]
After SMT, in 12621ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 12625ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12838 ms. Remains : 97/97 places, 242/242 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 97 transition count 145
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 105 place count 89 transition count 145
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 105 place count 89 transition count 127
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 141 place count 71 transition count 127
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 175 place count 54 transition count 110
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 182 place count 47 transition count 96
Iterating global reduction 2 with 7 rules applied. Total rules applied 189 place count 47 transition count 96
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 196 place count 40 transition count 82
Iterating global reduction 2 with 7 rules applied. Total rules applied 203 place count 40 transition count 82
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 210 place count 33 transition count 68
Iterating global reduction 2 with 7 rules applied. Total rules applied 217 place count 33 transition count 68
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 224 place count 33 transition count 61
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 224 place count 33 transition count 60
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 226 place count 32 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 230 place count 30 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 234 place count 30 transition count 56
Applied a total of 234 rules in 22 ms. Remains 30 /97 variables (removed 67) and now considering 56/242 (removed 186) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 56 rows 30 cols
[2024-05-23 02:44:43] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:44:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:44:43] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-23 02:44:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:44:43] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 02:44:43] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 02:44:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 02:44:43] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-23 02:44:43] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-23 02:44:44] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-23 02:44:44] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 154 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1682, 203634, 5, 848, 5, 6, 1444, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-b004-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 02:44:44] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
// Phase 1: matrix 173 rows 109 cols
[2024-05-23 02:44:44] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15] Max Struct:[+inf]
[2024-05-23 02:44:44] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:44:44] [INFO ] Invariant cache hit.
[2024-05-23 02:44:44] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:44:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:44:44] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:44:44] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-23 02:44:44] [INFO ] [Real]Added 31 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:44:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:44:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:44:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:44:44] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:44:44] [INFO ] [Nat]Added 31 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:44:44] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 9 ms.
[2024-05-23 02:44:44] [INFO ] Added : 11 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] Max Struct:[+inf]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Graph (complete) has 455 edges and 109 vertex of which 102 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 102 transition count 256
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 98 transition count 246
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 98 transition count 246
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 98 transition count 244
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 95 transition count 236
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 95 transition count 236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 92 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 92 transition count 230
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 89 transition count 222
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 89 transition count 222
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 86 transition count 216
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 86 transition count 216
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 83 transition count 208
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 83 transition count 208
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 80 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 80 transition count 202
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 78 transition count 198
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 78 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 77 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 77 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 76 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 76 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 75 transition count 192
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 75 transition count 192
Applied a total of 68 rules in 39 ms. Remains 75 /109 variables (removed 34) and now considering 192/267 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 75/109 places, 192/267 transitions.
[2024-05-23 02:44:44] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
Found an invariant !
This invariant on transitions {27=1, 55=1, 100=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {25=1, 53=1, 98=1, 115=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[15] Max Struct:[+inf]
[2024-05-23 02:44:44] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
// Phase 1: matrix 117 rows 75 cols
[2024-05-23 02:44:44] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[15] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 917 ms. (1089 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 414 ms. (2409 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[827] Max Struct:[+inf]
[2024-05-23 02:44:45] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:44:45] [INFO ] Invariant cache hit.
[2024-05-23 02:44:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:44:45] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 02:44:45] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 02:44:45] [INFO ] [Real]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:44:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:44:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:44:45] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-23 02:44:45] [INFO ] [Nat]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:44:45] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 6 ms.
[2024-05-23 02:44:45] [INFO ] Added : 7 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[827] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[827] Max Struct:[+inf]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-23 02:44:46] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:44:46] [INFO ] Invariant cache hit.
[2024-05-23 02:44:46] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 02:44:46] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:44:46] [INFO ] Invariant cache hit.
[2024-05-23 02:44:46] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 02:44:46] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-23 02:44:46] [INFO ] Redundant transitions in 0 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-23 02:44:46] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:44:46] [INFO ] Invariant cache hit.
[2024-05-23 02:44:46] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 190 unsolved in 2530 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 190/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 285 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4279 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 6913ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 6915ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7091 ms. Remains : 75/75 places, 192/192 transitions.
[2024-05-23 02:44:53] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
Found an invariant !
This invariant on transitions {27=1, 55=1, 100=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {25=1, 53=1, 98=1, 115=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[827] Max Struct:[+inf]
[2024-05-23 02:44:53] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:44:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[827] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 962 ms. (1038 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 429 ms. (2325 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1349] Max Struct:[+inf]
[2024-05-23 02:44:55] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:44:55] [INFO ] Invariant cache hit.
[2024-05-23 02:44:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:44:55] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:44:55] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 02:44:55] [INFO ] [Real]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:44:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:44:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:44:55] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-23 02:44:55] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:44:55] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 6 ms.
[2024-05-23 02:44:55] [INFO ] Added : 7 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1349] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1349] Max Struct:[+inf]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-23 02:44:56] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:44:56] [INFO ] Invariant cache hit.
[2024-05-23 02:44:56] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 02:44:56] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:44:56] [INFO ] Invariant cache hit.
[2024-05-23 02:44:56] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 02:44:56] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-23 02:44:56] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-23 02:44:56] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:44:56] [INFO ] Invariant cache hit.
[2024-05-23 02:44:56] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 190 unsolved in 2577 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 190/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 285 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4313 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 6995ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 7000ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7186 ms. Remains : 75/75 places, 192/192 transitions.
[2024-05-23 02:45:03] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
Found an invariant !
This invariant on transitions {27=1, 55=1, 100=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {25=1, 53=1, 98=1, 115=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1349] Max Struct:[+inf]
[2024-05-23 02:45:03] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:45:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1349] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 897 ms. (1113 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 433 ms. (2304 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1349] Max Struct:[+inf]
[2024-05-23 02:45:05] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:45:05] [INFO ] Invariant cache hit.
[2024-05-23 02:45:05] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:45:05] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-23 02:45:05] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 02:45:05] [INFO ] [Real]Added 17 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:45:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:45:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:45:05] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-23 02:45:05] [INFO ] [Nat]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:45:05] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 6 ms.
[2024-05-23 02:45:05] [INFO ] Added : 7 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1349] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1349] Max Struct:[+inf]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-23 02:45:06] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:45:06] [INFO ] Invariant cache hit.
[2024-05-23 02:45:06] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-23 02:45:06] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:45:06] [INFO ] Invariant cache hit.
[2024-05-23 02:45:06] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 02:45:06] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-23 02:45:06] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-23 02:45:06] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:45:06] [INFO ] Invariant cache hit.
[2024-05-23 02:45:06] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 190 unsolved in 2492 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 190/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 285 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4176 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 6813ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 6815ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6996 ms. Remains : 75/75 places, 192/192 transitions.
[2024-05-23 02:45:13] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
Found an invariant !
This invariant on transitions {27=1, 55=1, 100=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {25=1, 53=1, 98=1, 115=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[1349] Max Struct:[+inf]
RANDOM walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2153371 steps, run timeout after 3001 ms. (steps per millisecond=717 ) properties seen :0 out of 1
Probabilistic random walk after 2153371 steps, saw 1328017 distinct states, run finished after 3001 ms. (steps per millisecond=717 ) properties seen :0
[2024-05-23 02:45:16] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:45:16] [INFO ] Invariant cache hit.
[2024-05-23 02:45:16] [INFO ] State equation strengthened by 17 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/76 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/79 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 90/169 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 6/175 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/175 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/185 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/189 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/189 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/192 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/76 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/79 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 90/169 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/169 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/175 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/175 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 10/185 variables, 9/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/189 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 3/192 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 244ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 859 ms.
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 75/75 places, 192/192 transitions.
RANDOM walk for 40001 steps (8 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2098633 steps, run timeout after 3001 ms. (steps per millisecond=699 ) properties seen :0 out of 1
Probabilistic random walk after 2098633 steps, saw 1294720 distinct states, run finished after 3002 ms. (steps per millisecond=699 ) properties seen :0
[2024-05-23 02:45:20] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:45:20] [INFO ] Invariant cache hit.
[2024-05-23 02:45:20] [INFO ] State equation strengthened by 17 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/76 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/79 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 90/169 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 6/175 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/175 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/185 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/189 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/189 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/192 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/76 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/79 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 90/169 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/169 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/175 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/175 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 10/185 variables, 9/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/189 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 3/192 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 172ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 838 ms.
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-23 02:45:21] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:45:21] [INFO ] Invariant cache hit.
[2024-05-23 02:45:22] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-23 02:45:22] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:45:22] [INFO ] Invariant cache hit.
[2024-05-23 02:45:22] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 02:45:22] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-23 02:45:22] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-23 02:45:22] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:45:22] [INFO ] Invariant cache hit.
[2024-05-23 02:45:22] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 190 unsolved in 2575 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 190/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 285 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4145 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 6817ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 6819ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7008 ms. Remains : 75/75 places, 192/192 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 75 transition count 111
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 87 place count 69 transition count 111
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 87 place count 69 transition count 100
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 109 place count 58 transition count 100
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 143 place count 41 transition count 83
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 150 place count 34 transition count 69
Iterating global reduction 2 with 7 rules applied. Total rules applied 157 place count 34 transition count 69
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 164 place count 27 transition count 55
Iterating global reduction 2 with 7 rules applied. Total rules applied 171 place count 27 transition count 55
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 178 place count 20 transition count 41
Iterating global reduction 2 with 7 rules applied. Total rules applied 185 place count 20 transition count 41
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 192 place count 20 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 192 place count 20 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 19 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 196 place count 18 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 199 place count 18 transition count 30
Applied a total of 199 rules in 17 ms. Remains 18 /75 variables (removed 57) and now considering 30/192 (removed 162) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 30 rows 18 cols
[2024-05-23 02:45:28] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:45:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:45:29] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:45:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:45:29] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:45:29] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:45:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 02:45:29] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:45:29] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 02:45:29] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:45:29] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 97 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1349] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-01 in 45051 ms.
Starting property specific reduction for FunctionPointer-PT-b004-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 02:45:29] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
// Phase 1: matrix 173 rows 109 cols
[2024-05-23 02:45:29] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10000 steps (3 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[56] Max Struct:[+inf]
[2024-05-23 02:45:29] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:45:29] [INFO ] Invariant cache hit.
[2024-05-23 02:45:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:45:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:45:29] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:45:29] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-23 02:45:29] [INFO ] [Real]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:45:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:45:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:45:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:45:29] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:45:29] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:45:29] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 14 ms.
[2024-05-23 02:45:29] [INFO ] Added : 33 causal constraints over 8 iterations in 106 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[56] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[56] Max Struct:[+inf]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Graph (complete) has 455 edges and 109 vertex of which 103 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 103 transition count 256
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 99 transition count 246
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 99 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 24 place count 99 transition count 242
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 97 transition count 236
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 97 transition count 236
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 95 transition count 232
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 95 transition count 232
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 93 transition count 228
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 93 transition count 228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 91 transition count 224
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 91 transition count 224
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 89 transition count 220
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 89 transition count 220
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 87 transition count 216
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 87 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 86 transition count 214
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 86 transition count 214
Applied a total of 50 rules in 18 ms. Remains 86 /109 variables (removed 23) and now considering 214/267 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 86/109 places, 214/267 transitions.
[2024-05-23 02:45:29] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
Found an invariant !
This invariant on transitions {27=1, 62=1, 94=1, 128=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 65=1, 97=1, 128=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-23 02:45:29] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
// Phase 1: matrix 133 rows 86 cols
[2024-05-23 02:45:29] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 984 ms. (1015 steps per ms)
FORMULA FunctionPointer-PT-b004-UpperBounds-02 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-02 in 1555 ms.
Starting property specific reduction for FunctionPointer-PT-b004-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 02:45:30] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
// Phase 1: matrix 173 rows 109 cols
[2024-05-23 02:45:30] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2024-05-23 02:45:30] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:45:30] [INFO ] Invariant cache hit.
[2024-05-23 02:45:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:45:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:45:30] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:45:30] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-23 02:45:30] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:45:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:45:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:45:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:45:30] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:45:30] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:45:30] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 11 ms.
[2024-05-23 02:45:30] [INFO ] Added : 6 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Graph (complete) has 455 edges and 109 vertex of which 105 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 105 transition count 261
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 100 transition count 249
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 100 transition count 249
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 21 place count 100 transition count 245
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 97 transition count 237
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 97 transition count 237
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 30 place count 94 transition count 231
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 94 transition count 231
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 91 transition count 223
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 91 transition count 223
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 42 place count 88 transition count 217
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 88 transition count 217
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 85 transition count 209
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 85 transition count 209
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 82 transition count 203
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 82 transition count 203
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 80 transition count 199
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 80 transition count 199
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 79 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 79 transition count 197
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 78 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 78 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 77 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 77 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 76 transition count 191
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 76 transition count 191
Applied a total of 69 rules in 16 ms. Remains 76 /109 variables (removed 33) and now considering 191/267 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 76/109 places, 191/267 transitions.
[2024-05-23 02:45:30] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {32=1, 57=1, 87=1, 113=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 55=1, 101=1, 114=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2024-05-23 02:45:30] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2024-05-23 02:45:30] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 946 ms. (1055 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 440 ms. (2267 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2024-05-23 02:45:32] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 02:45:32] [INFO ] Invariant cache hit.
[2024-05-23 02:45:32] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:45:32] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 02:45:32] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:45:32] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:45:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:45:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:45:32] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-23 02:45:32] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:45:32] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-23 02:45:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-23 02:45:32] [INFO ] Computed and/alt/rep : 61/197/52 causal constraints (skipped 63 transitions) in 7 ms.
[2024-05-23 02:45:32] [INFO ] Added : 6 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-23 02:45:32] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 02:45:32] [INFO ] Invariant cache hit.
[2024-05-23 02:45:32] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 02:45:32] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 02:45:32] [INFO ] Invariant cache hit.
[2024-05-23 02:45:32] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:45:32] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-23 02:45:32] [INFO ] Redundant transitions in 0 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-23 02:45:32] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 02:45:32] [INFO ] Invariant cache hit.
[2024-05-23 02:45:32] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 189 unsolved in 2510 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 189/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 286 constraints, problems are : Problem set: 0 solved, 189 unsolved in 4278 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
After SMT, in 6898ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 6901ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7064 ms. Remains : 76/76 places, 191/191 transitions.
[2024-05-23 02:45:39] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {32=1, 57=1, 87=1, 113=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 55=1, 101=1, 114=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1987899 steps, run timeout after 3001 ms. (steps per millisecond=662 ) properties seen :0 out of 1
Probabilistic random walk after 1987899 steps, saw 1230160 distinct states, run finished after 3002 ms. (steps per millisecond=662 ) properties seen :0
[2024-05-23 02:45:42] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 02:45:42] [INFO ] Invariant cache hit.
[2024-05-23 02:45:42] [INFO ] State equation strengthened by 18 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/69 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/75 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 94/169 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/175 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/175 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 11/186 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/186 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/190 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/190 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 3/193 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/69 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/75 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 94/169 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 17/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/175 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/175 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 11/186 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/186 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/190 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/193 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/193 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/193 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 198ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 191/191 transitions.
RANDOM walk for 33392 steps (7 resets) in 55 ms. (596 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-03 in 12427 ms.
Starting property specific reduction for FunctionPointer-PT-b004-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 02:45:43] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
// Phase 1: matrix 173 rows 109 cols
[2024-05-23 02:45:43] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-23 02:45:43] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:45:43] [INFO ] Invariant cache hit.
[2024-05-23 02:45:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:45:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:45:43] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:45:43] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-23 02:45:43] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:45:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:45:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:45:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:45:43] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:45:43] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:45:43] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 11 ms.
[2024-05-23 02:45:43] [INFO ] Added : 4 causal constraints over 2 iterations in 39 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Graph (complete) has 455 edges and 109 vertex of which 102 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 102 transition count 256
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 98 transition count 246
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 98 transition count 246
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 98 transition count 244
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 95 transition count 236
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 95 transition count 236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 92 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 92 transition count 230
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 89 transition count 222
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 89 transition count 222
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 86 transition count 216
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 86 transition count 216
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 83 transition count 208
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 83 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 81 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 81 transition count 204
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 79 transition count 200
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 79 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 78 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 78 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 77 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 77 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 76 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 76 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 75 transition count 192
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 75 transition count 192
Applied a total of 68 rules in 16 ms. Remains 75 /109 variables (removed 34) and now considering 192/267 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 75/109 places, 192/267 transitions.
[2024-05-23 02:45:43] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
Found an invariant !
This invariant on transitions {27=1, 55=1, 100=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {25=1, 53=1, 98=1, 115=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-23 02:45:43] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
// Phase 1: matrix 117 rows 75 cols
[2024-05-23 02:45:43] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000007 steps (2 resets) in 957 ms. (1043 steps per ms)
FORMULA FunctionPointer-PT-b004-UpperBounds-04 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-04 in 1325 ms.
Starting property specific reduction for FunctionPointer-PT-b004-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 02:45:44] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
// Phase 1: matrix 173 rows 109 cols
[2024-05-23 02:45:44] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (3 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-23 02:45:44] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:45:44] [INFO ] Invariant cache hit.
[2024-05-23 02:45:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:45:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:45:44] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:45:44] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-23 02:45:44] [INFO ] [Real]Added 31 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:45:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:45:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:45:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:45:44] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:45:44] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:45:44] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:45:44] [INFO ] Added : 6 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Graph (complete) has 455 edges and 109 vertex of which 105 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 105 transition count 261
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 100 transition count 249
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 100 transition count 249
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 21 place count 100 transition count 245
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 97 transition count 237
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 97 transition count 237
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 30 place count 94 transition count 231
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 94 transition count 231
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 91 transition count 223
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 91 transition count 223
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 42 place count 88 transition count 217
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 88 transition count 217
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 85 transition count 209
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 85 transition count 209
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 82 transition count 203
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 82 transition count 203
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 80 transition count 199
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 80 transition count 199
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 79 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 79 transition count 197
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 78 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 78 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 77 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 77 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 76 transition count 191
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 76 transition count 191
Applied a total of 69 rules in 15 ms. Remains 76 /109 variables (removed 33) and now considering 191/267 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 76/109 places, 191/267 transitions.
[2024-05-23 02:45:44] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {31=1, 56=1, 102=1, 115=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 56=1, 86=1, 112=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2024-05-23 02:45:44] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2024-05-23 02:45:44] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 875 ms. (1141 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 410 ms. (2433 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2024-05-23 02:45:46] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 02:45:46] [INFO ] Invariant cache hit.
[2024-05-23 02:45:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:45:46] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 02:45:46] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:45:46] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:45:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:45:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:45:46] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-23 02:45:46] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:45:46] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-23 02:45:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-23 02:45:46] [INFO ] Computed and/alt/rep : 61/197/52 causal constraints (skipped 63 transitions) in 8 ms.
[2024-05-23 02:45:46] [INFO ] Added : 14 causal constraints over 5 iterations in 43 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-23 02:45:46] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 02:45:46] [INFO ] Invariant cache hit.
[2024-05-23 02:45:46] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-23 02:45:46] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 02:45:46] [INFO ] Invariant cache hit.
[2024-05-23 02:45:46] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:45:46] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-23 02:45:46] [INFO ] Redundant transitions in 1 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-23 02:45:46] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 02:45:46] [INFO ] Invariant cache hit.
[2024-05-23 02:45:46] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 189 unsolved in 2536 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 189/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 286 constraints, problems are : Problem set: 0 solved, 189 unsolved in 4236 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
After SMT, in 6870ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 6872ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7046 ms. Remains : 76/76 places, 191/191 transitions.
[2024-05-23 02:45:53] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {31=1, 56=1, 102=1, 115=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 56=1, 86=1, 112=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 30086 steps (6 resets) in 91 ms. (327 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-05 in 9104 ms.
Starting property specific reduction for FunctionPointer-PT-b004-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 02:45:53] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
// Phase 1: matrix 173 rows 109 cols
[2024-05-23 02:45:53] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2024-05-23 02:45:53] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:45:53] [INFO ] Invariant cache hit.
[2024-05-23 02:45:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:45:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:45:53] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:45:53] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-23 02:45:53] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:45:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:45:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:45:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:45:53] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:45:53] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:45:53] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:45:53] [INFO ] Added : 3 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Graph (complete) has 455 edges and 109 vertex of which 105 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 105 transition count 262
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 100 transition count 250
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 100 transition count 250
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 100 transition count 246
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 23 place count 97 transition count 238
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 97 transition count 238
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 94 transition count 232
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 94 transition count 232
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 91 transition count 224
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 91 transition count 224
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 88 transition count 218
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 88 transition count 218
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 85 transition count 210
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 85 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 82 transition count 204
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 82 transition count 204
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 80 transition count 200
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 80 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 79 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 79 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 78 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 78 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 77 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 77 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 76 transition count 192
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 76 transition count 192
Applied a total of 68 rules in 15 ms. Remains 76 /109 variables (removed 33) and now considering 192/267 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 76/109 places, 192/267 transitions.
[2024-05-23 02:45:53] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {32=1, 57=1, 103=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 54=1, 84=1, 113=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2024-05-23 02:45:53] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
// Phase 1: matrix 118 rows 76 cols
[2024-05-23 02:45:53] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 869 ms. (1149 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 423 ms. (2358 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2024-05-23 02:45:55] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:45:55] [INFO ] Invariant cache hit.
[2024-05-23 02:45:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:45:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:45:55] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 02:45:55] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:45:55] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:45:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:45:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:45:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:45:55] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-23 02:45:55] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:45:55] [INFO ] Computed and/alt/rep : 62/198/53 causal constraints (skipped 63 transitions) in 7 ms.
[2024-05-23 02:45:55] [INFO ] Added : 3 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-23 02:45:55] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:45:55] [INFO ] Invariant cache hit.
[2024-05-23 02:45:55] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-23 02:45:55] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:45:55] [INFO ] Invariant cache hit.
[2024-05-23 02:45:55] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:45:55] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-23 02:45:55] [INFO ] Redundant transitions in 0 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-23 02:45:55] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:45:55] [INFO ] Invariant cache hit.
[2024-05-23 02:45:55] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 118/194 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 18/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 96 constraints, problems are : Problem set: 0 solved, 190 unsolved in 3608 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 118/194 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 18/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 190/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 286 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4186 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 7902ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 7906ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8088 ms. Remains : 76/76 places, 192/192 transitions.
[2024-05-23 02:46:03] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {32=1, 57=1, 103=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 54=1, 84=1, 113=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 36720 steps (8 resets) in 62 ms. (582 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-07 in 10000 ms.
Starting property specific reduction for FunctionPointer-PT-b004-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 02:46:03] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
// Phase 1: matrix 173 rows 109 cols
[2024-05-23 02:46:03] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10002 steps (2 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-23 02:46:03] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:46:03] [INFO ] Invariant cache hit.
[2024-05-23 02:46:03] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:46:03] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:46:03] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-23 02:46:03] [INFO ] [Real]Added 31 Read/Feed constraints in 10 ms returned sat
[2024-05-23 02:46:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:46:03] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-23 02:46:03] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:46:03] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:46:03] [INFO ] Added : 11 causal constraints over 3 iterations in 55 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Graph (complete) has 455 edges and 109 vertex of which 102 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 102 transition count 256
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 98 transition count 246
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 98 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 24 place count 98 transition count 242
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 96 transition count 238
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 96 transition count 238
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 94 transition count 234
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 94 transition count 234
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 92 transition count 228
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 92 transition count 228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 90 transition count 224
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 90 transition count 224
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 88 transition count 218
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 88 transition count 218
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 86 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 86 transition count 214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 85 transition count 212
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 85 transition count 212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 84 transition count 210
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 84 transition count 210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 83 transition count 208
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 83 transition count 208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 82 transition count 206
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 82 transition count 206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 81 transition count 204
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 81 transition count 204
Applied a total of 58 rules in 17 ms. Remains 81 /109 variables (removed 28) and now considering 204/267 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 81/109 places, 204/267 transitions.
[2024-05-23 02:46:03] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-23 02:46:03] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
// Phase 1: matrix 125 rows 81 cols
[2024-05-23 02:46:03] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000003 steps (2 resets) in 896 ms. (1114 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 423 ms. (2358 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-23 02:46:05] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-23 02:46:05] [INFO ] Invariant cache hit.
[2024-05-23 02:46:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:46:05] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:46:05] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:46:05] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:46:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:46:05] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 02:46:05] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:46:05] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-23 02:46:05] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-23 02:46:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
[2024-05-23 02:46:05] [INFO ] Computed and/alt/rep : 59/193/53 causal constraints (skipped 70 transitions) in 9 ms.
[2024-05-23 02:46:05] [INFO ] Added : 12 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 81/81 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-23 02:46:05] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-23 02:46:05] [INFO ] Invariant cache hit.
[2024-05-23 02:46:05] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-23 02:46:05] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-23 02:46:05] [INFO ] Invariant cache hit.
[2024-05-23 02:46:05] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:46:05] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-23 02:46:05] [INFO ] Redundant transitions in 1 ms returned []
Running 202 sub problems to find dead transitions.
[2024-05-23 02:46:05] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-23 02:46:05] [INFO ] Invariant cache hit.
[2024-05-23 02:46:05] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 102 constraints, problems are : Problem set: 0 solved, 202 unsolved in 3303 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 202/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 304 constraints, problems are : Problem set: 0 solved, 202 unsolved in 4601 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 8009ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 8013ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8202 ms. Remains : 81/81 places, 204/204 transitions.
[2024-05-23 02:46:13] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 22094 steps (4 resets) in 46 ms. (470 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-10 in 10378 ms.
Starting property specific reduction for FunctionPointer-PT-b004-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 02:46:13] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
// Phase 1: matrix 173 rows 109 cols
[2024-05-23 02:46:13] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (3 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11] Max Struct:[+inf]
[2024-05-23 02:46:13] [INFO ] Flow matrix only has 173 transitions (discarded 94 similar events)
[2024-05-23 02:46:13] [INFO ] Invariant cache hit.
[2024-05-23 02:46:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:46:13] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:46:13] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-23 02:46:13] [INFO ] [Real]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:46:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 02:46:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:46:14] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:46:14] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:46:14] [INFO ] Computed and/alt/rep : 72/394/68 causal constraints (skipped 103 transitions) in 10 ms.
[2024-05-23 02:46:14] [INFO ] Added : 11 causal constraints over 3 iterations in 49 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] Max Struct:[+inf]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Graph (complete) has 455 edges and 109 vertex of which 102 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 102 transition count 256
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 98 transition count 248
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 98 transition count 248
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 24 place count 98 transition count 244
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 96 transition count 238
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 96 transition count 238
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 94 transition count 234
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 94 transition count 234
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 92 transition count 228
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 92 transition count 228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 90 transition count 224
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 90 transition count 224
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 88 transition count 218
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 88 transition count 218
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 86 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 86 transition count 214
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 84 transition count 210
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 84 transition count 210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 83 transition count 208
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 83 transition count 208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 82 transition count 206
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 82 transition count 206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 81 transition count 204
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 81 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 80 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 80 transition count 202
Applied a total of 60 rules in 20 ms. Remains 80 /109 variables (removed 29) and now considering 202/267 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 80/109 places, 202/267 transitions.
[2024-05-23 02:46:14] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
Found an invariant !
This invariant on transitions {27=1, 58=1, 104=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 60=1, 90=1, 119=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-23 02:46:14] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
// Phase 1: matrix 124 rows 80 cols
[2024-05-23 02:46:14] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 925 ms. (1079 steps per ms)
FORMULA FunctionPointer-PT-b004-UpperBounds-11 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-11 in 1317 ms.
[2024-05-23 02:46:15] [INFO ] Flatten gal took : 46 ms
[2024-05-23 02:46:15] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-23 02:46:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 109 places, 267 transitions and 1084 arcs took 4 ms.
Total runtime 644042 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running FunctionPointer-PT-b004
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 109
TRANSITIONS: 267
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]
SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1635
MODEL NAME: /home/mcc/execution/415/model
109 places, 267 transitions.
Enabling coverability test.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
Start RS construction.
coverability test failed!!
Convergence in 11 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716432376212
--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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
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="FunctionPointer-PT-b004"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FunctionPointer-PT-b004, 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 r179-tall-171640601100229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b004.tgz
mv FunctionPointer-PT-b004 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 '
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 ;