About the Execution of GreatSPN+red for DBSingleClientW-PT-d1m08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 660.756 | 97642.00 | 147882.00 | 326.80 | 1 5 0 0 1 0 0 0 1 0 0 1 3 1 0 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.r091-tall-171624187900525.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 DBSingleClientW-PT-d1m08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187900525
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K 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 DBSingleClientW-PT-d1m08-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716292853121
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 12:00:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 12:00:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 12:00:54] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-05-21 12:00:54] [INFO ] Transformed 1440 places.
[2024-05-21 12:00:54] [INFO ] Transformed 672 transitions.
[2024-05-21 12:00:54] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 672 rows 347 cols
[2024-05-21 12:00:54] [INFO ] Computed 6 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 8, 7, 8, 1547, 10, 1547]
RANDOM walk for 10000 steps (2282 resets) in 119 ms. (83 steps per ms)
BEST_FIRST walk for 70006 steps (6691 resets) in 243 ms. (286 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 0, 0, 0] Max Struct:[7, 8, 7, 8, 1547, 10, 1547]
[2024-05-21 12:00:55] [INFO ] Invariant cache hit.
[2024-05-21 12:00:55] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 12:00:55] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 12:00:55] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-21 12:00:55] [INFO ] State equation strengthened by 418 read => feed constraints.
[2024-05-21 12:00:55] [INFO ] [Real]Added 418 Read/Feed constraints in 83 ms returned sat
[2024-05-21 12:00:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:00:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-21 12:00:55] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 12:00:55] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-21 12:00:55] [INFO ] [Nat]Added 418 Read/Feed constraints in 85 ms returned sat
[2024-05-21 12:00:56] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 116 ms.
[2024-05-21 12:00:56] [INFO ] Added : 8 causal constraints over 2 iterations in 290 ms. Result :sat
Minimization took 512 ms.
[2024-05-21 12:00:56] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 12:00:56] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 12:00:56] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-21 12:00:57] [INFO ] [Real]Added 418 Read/Feed constraints in 108 ms returned sat
[2024-05-21 12:00:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:00:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 12:00:57] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-21 12:00:57] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-21 12:00:57] [INFO ] [Nat]Added 418 Read/Feed constraints in 67 ms returned sat
[2024-05-21 12:00:57] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 60 ms.
[2024-05-21 12:00:57] [INFO ] Added : 5 causal constraints over 1 iterations in 154 ms. Result :sat
Minimization took 528 ms.
[2024-05-21 12:00:58] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 12:00:58] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned unsat
[2024-05-21 12:00:58] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 12:00:58] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-21 12:00:58] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-21 12:00:58] [INFO ] [Real]Added 418 Read/Feed constraints in 71 ms returned sat
[2024-05-21 12:00:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:00:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-21 12:00:58] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-21 12:00:58] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-05-21 12:00:58] [INFO ] [Nat]Added 418 Read/Feed constraints in 70 ms returned sat
[2024-05-21 12:00:58] [INFO ] Deduced a trap composed of 102 places in 162 ms of which 23 ms to minimize.
[2024-05-21 12:00:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2024-05-21 12:00:59] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 79 ms.
[2024-05-21 12:00:59] [INFO ] Added : 5 causal constraints over 1 iterations in 173 ms. Result :sat
Minimization took 522 ms.
[2024-05-21 12:00:59] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-21 12:00:59] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 12:00:59] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-21 12:00:59] [INFO ] [Real]Added 418 Read/Feed constraints in 72 ms returned sat
[2024-05-21 12:00:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:01:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 12:01:00] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-21 12:01:00] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-21 12:01:00] [INFO ] [Nat]Added 418 Read/Feed constraints in 77 ms returned sat
[2024-05-21 12:01:00] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 3 ms to minimize.
[2024-05-21 12:01:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2024-05-21 12:01:00] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 61 ms.
[2024-05-21 12:01:00] [INFO ] Added : 11 causal constraints over 3 iterations in 247 ms. Result :sat
Minimization took 514 ms.
[2024-05-21 12:01:01] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 12:01:01] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 12:01:01] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-21 12:01:01] [INFO ] [Real]Added 418 Read/Feed constraints in 126 ms returned sat
[2024-05-21 12:01:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:01:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-21 12:01:01] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 12:01:01] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-21 12:01:01] [INFO ] [Nat]Added 418 Read/Feed constraints in 71 ms returned sat
[2024-05-21 12:01:01] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 62 ms.
[2024-05-21 12:01:02] [INFO ] Added : 5 causal constraints over 2 iterations in 191 ms. Result :sat
Minimization took 505 ms.
[2024-05-21 12:01:02] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 12:01:02] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 12:01:02] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-21 12:01:02] [INFO ] [Real]Added 418 Read/Feed constraints in 71 ms returned sat
[2024-05-21 12:01:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:01:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 12:01:02] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-21 12:01:03] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-21 12:01:03] [INFO ] [Nat]Added 418 Read/Feed constraints in 85 ms returned sat
[2024-05-21 12:01:03] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 58 ms.
[2024-05-21 12:01:03] [INFO ] Added : 12 causal constraints over 3 iterations in 220 ms. Result :sat
Minimization took 519 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 0, 0, 0] Max Struct:[7, 8, 1, 8, 1547, 10, 1547]
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[7, 8, 8, 1547, 10, 1547]
Support contains 6 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 325 transition count 584
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 183 place count 231 transition count 333
Iterating global reduction 1 with 94 rules applied. Total rules applied 277 place count 231 transition count 333
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 281 place count 231 transition count 329
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 353 place count 159 transition count 257
Iterating global reduction 2 with 72 rules applied. Total rules applied 425 place count 159 transition count 257
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 431 place count 159 transition count 251
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 470 place count 120 transition count 187
Iterating global reduction 3 with 39 rules applied. Total rules applied 509 place count 120 transition count 187
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 530 place count 120 transition count 166
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 540 place count 110 transition count 153
Iterating global reduction 4 with 10 rules applied. Total rules applied 550 place count 110 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 552 place count 110 transition count 151
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 560 place count 102 transition count 143
Iterating global reduction 5 with 8 rules applied. Total rules applied 568 place count 102 transition count 143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 571 place count 102 transition count 140
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 577 place count 96 transition count 134
Iterating global reduction 6 with 6 rules applied. Total rules applied 583 place count 96 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 586 place count 96 transition count 131
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 587 place count 95 transition count 129
Iterating global reduction 7 with 1 rules applied. Total rules applied 588 place count 95 transition count 129
Applied a total of 588 rules in 112 ms. Remains 95 /347 variables (removed 252) and now considering 129/672 (removed 543) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 95/347 places, 129/672 transitions.
// Phase 1: matrix 129 rows 95 cols
[2024-05-21 12:01:04] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[7, 8, 8, 1547, 10, 1547]
RANDOM walk for 1000000 steps (229497 resets) in 1082 ms. (923 steps per ms)
BEST_FIRST walk for 6000004 steps (590772 resets) in 2996 ms. (2002 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 0, 0] Max Struct:[7, 8, 8, 1547, 10, 1547]
[2024-05-21 12:01:08] [INFO ] Invariant cache hit.
[2024-05-21 12:01:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-21 12:01:08] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-21 12:01:08] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 12:01:08] [INFO ] [Real]Added 48 Read/Feed constraints in 7 ms returned sat
[2024-05-21 12:01:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:01:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 12:01:08] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-21 12:01:08] [INFO ] [Nat]Added 48 Read/Feed constraints in 7 ms returned sat
[2024-05-21 12:01:08] [INFO ] Computed and/alt/rep : 32/76/32 causal constraints (skipped 96 transitions) in 8 ms.
[2024-05-21 12:01:08] [INFO ] Added : 7 causal constraints over 2 iterations in 38 ms. Result :sat
Minimization took 66 ms.
[2024-05-21 12:01:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:08] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-21 12:01:08] [INFO ] [Real]Added 48 Read/Feed constraints in 5 ms returned sat
[2024-05-21 12:01:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:01:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:08] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-21 12:01:08] [INFO ] [Nat]Added 48 Read/Feed constraints in 5 ms returned sat
[2024-05-21 12:01:08] [INFO ] Computed and/alt/rep : 32/76/32 causal constraints (skipped 96 transitions) in 8 ms.
[2024-05-21 12:01:08] [INFO ] Added : 5 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 76 ms.
[2024-05-21 12:01:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 12:01:08] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2024-05-21 12:01:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:08] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-21 12:01:08] [INFO ] [Real]Added 48 Read/Feed constraints in 5 ms returned sat
[2024-05-21 12:01:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:01:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:08] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-21 12:01:08] [INFO ] [Nat]Added 48 Read/Feed constraints in 8 ms returned sat
[2024-05-21 12:01:08] [INFO ] Computed and/alt/rep : 32/76/32 causal constraints (skipped 96 transitions) in 8 ms.
[2024-05-21 12:01:08] [INFO ] Added : 10 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 61 ms.
[2024-05-21 12:01:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:08] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-21 12:01:09] [INFO ] [Real]Added 48 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:01:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:01:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:09] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-21 12:01:09] [INFO ] [Nat]Added 48 Read/Feed constraints in 9 ms returned sat
[2024-05-21 12:01:09] [INFO ] Computed and/alt/rep : 32/76/32 causal constraints (skipped 96 transitions) in 7 ms.
[2024-05-21 12:01:09] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-21 12:01:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-21 12:01:09] [INFO ] Added : 6 causal constraints over 4 iterations in 108 ms. Result :sat
Minimization took 84 ms.
[2024-05-21 12:01:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 12:01:09] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-21 12:01:09] [INFO ] [Real]Added 48 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:01:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:01:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:09] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-21 12:01:09] [INFO ] [Nat]Added 48 Read/Feed constraints in 7 ms returned sat
[2024-05-21 12:01:09] [INFO ] Computed and/alt/rep : 32/76/32 causal constraints (skipped 96 transitions) in 6 ms.
[2024-05-21 12:01:09] [INFO ] Added : 10 causal constraints over 2 iterations in 37 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 0, 0] Max Struct:[7, 8, 1, 1547, 10, 1547]
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[7, 8, 1547, 10, 1547]
Support contains 5 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 129/129 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 94 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 94 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 93 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 93 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 92 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 92 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 92 transition count 125
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 91 transition count 123
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 91 transition count 123
Applied a total of 9 rules in 16 ms. Remains 91 /95 variables (removed 4) and now considering 123/129 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 91/95 places, 123/129 transitions.
// Phase 1: matrix 123 rows 91 cols
[2024-05-21 12:01:09] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[7, 8, 1547, 10, 1547]
RANDOM walk for 1000000 steps (229457 resets) in 1006 ms. (993 steps per ms)
BEST_FIRST walk for 5000004 steps (492700 resets) in 2405 ms. (2078 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[7, 8, 1547, 10, 1547]
[2024-05-21 12:01:13] [INFO ] Invariant cache hit.
[2024-05-21 12:01:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:13] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-21 12:01:13] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 12:01:13] [INFO ] [Real]Added 44 Read/Feed constraints in 7 ms returned sat
[2024-05-21 12:01:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:01:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 12:01:13] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-21 12:01:13] [INFO ] [Nat]Added 44 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:01:13] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 91 transitions) in 6 ms.
[2024-05-21 12:01:13] [INFO ] Added : 8 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 63 ms.
[2024-05-21 12:01:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:13] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-21 12:01:13] [INFO ] [Real]Added 44 Read/Feed constraints in 5 ms returned sat
[2024-05-21 12:01:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:01:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:13] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-21 12:01:13] [INFO ] [Nat]Added 44 Read/Feed constraints in 5 ms returned sat
[2024-05-21 12:01:13] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 91 transitions) in 8 ms.
[2024-05-21 12:01:13] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-21 12:01:13] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 12:01:13] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 12:01:13] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 6 ms to minimize.
[2024-05-21 12:01:13] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-21 12:01:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 293 ms
[2024-05-21 12:01:13] [INFO ] Added : 14 causal constraints over 4 iterations in 357 ms. Result :sat
Minimization took 97 ms.
[2024-05-21 12:01:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:13] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-21 12:01:13] [INFO ] [Real]Added 44 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:01:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:01:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:14] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-21 12:01:14] [INFO ] [Nat]Added 44 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:01:14] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 91 transitions) in 6 ms.
[2024-05-21 12:01:14] [INFO ] Added : 10 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 55 ms.
[2024-05-21 12:01:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:14] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-21 12:01:14] [INFO ] [Real]Added 44 Read/Feed constraints in 8 ms returned sat
[2024-05-21 12:01:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:01:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:14] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-21 12:01:14] [INFO ] [Nat]Added 44 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:01:14] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 91 transitions) in 7 ms.
[2024-05-21 12:01:14] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-21 12:01:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-05-21 12:01:14] [INFO ] Added : 4 causal constraints over 2 iterations in 97 ms. Result :sat
Minimization took 75 ms.
[2024-05-21 12:01:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 12:01:14] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-21 12:01:14] [INFO ] [Real]Added 44 Read/Feed constraints in 8 ms returned sat
[2024-05-21 12:01:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:01:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 12:01:14] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-21 12:01:14] [INFO ] [Nat]Added 44 Read/Feed constraints in 8 ms returned sat
[2024-05-21 12:01:14] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 91 transitions) in 8 ms.
[2024-05-21 12:01:14] [INFO ] Added : 9 causal constraints over 2 iterations in 34 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[7, 8, 1547, 10, 1547]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[7, 8, 1547, 10, 1547]
Support contains 5 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 123/123 transitions.
Applied a total of 0 rules in 6 ms. Remains 91 /91 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 91/91 places, 123/123 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 123/123 transitions.
Applied a total of 0 rules in 6 ms. Remains 91 /91 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-21 12:01:14] [INFO ] Invariant cache hit.
[2024-05-21 12:01:14] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 12:01:14] [INFO ] Invariant cache hit.
[2024-05-21 12:01:14] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 12:01:15] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-21 12:01:15] [INFO ] Redundant transitions in 2 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-21 12:01:15] [INFO ] Invariant cache hit.
[2024-05-21 12:01:15] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/214 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 44/137 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/214 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 137 constraints, problems are : Problem set: 0 solved, 122 unsolved in 2524 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/214 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 44/137 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 122/259 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/214 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 259 constraints, problems are : Problem set: 0 solved, 122 unsolved in 6133 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 8888ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 8915ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9156 ms. Remains : 91/91 places, 123/123 transitions.
RANDOM walk for 40000 steps (9152 resets) in 1458 ms. (27 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (3873 resets) in 278 ms. (143 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (4011 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (4007 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (3959 resets) in 138 ms. (287 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (3968 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (3959 resets) in 166 ms. (239 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (3962 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (3926 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (3946 resets) in 136 ms. (291 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (3963 resets) in 146 ms. (272 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 496257 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :5 out of 10
Probabilistic random walk after 496257 steps, saw 188177 distinct states, run finished after 3004 ms. (steps per millisecond=165 ) properties seen :5
[2024-05-21 12:01:28] [INFO ] Invariant cache hit.
[2024-05-21 12:01:28] [INFO ] State equation strengthened by 44 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) 54/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 93/159 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem MAX0 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
At refinement iteration 7 (OVERLAPS) 46/205 variables, 20/88 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 40/128 constraints. Problems are: Problem set: 4 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/128 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/214 variables, 5/133 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 4/137 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-21 12:01:28] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
Problem MAX1 is UNSAT
After SMT solving in domain Real declared 214/214 variables, and 138 constraints, problems are : Problem set: 5 solved, 0 unsolved in 203 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 207ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[7, 8, 1547, 10, 1547]
Starting property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
[2024-05-21 12:01:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2303 resets) in 11 ms. (833 steps per ms)
BEST_FIRST walk for 10000 steps (966 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 12:01:28] [INFO ] Invariant cache hit.
[2024-05-21 12:01:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:28] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-21 12:01:28] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 12:01:28] [INFO ] [Real]Added 44 Read/Feed constraints in 7 ms returned sat
[2024-05-21 12:01:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:01:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 12:01:28] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-21 12:01:28] [INFO ] [Nat]Added 44 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:01:28] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 91 transitions) in 11 ms.
[2024-05-21 12:01:28] [INFO ] Added : 8 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 123/123 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 88 transition count 115
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 88 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 88 transition count 113
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 86 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 86 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 85 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 85 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 84 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 84 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 83 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 83 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 82 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 82 transition count 99
Applied a total of 20 rules in 14 ms. Remains 82 /91 variables (removed 9) and now considering 99/123 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 82/91 places, 99/123 transitions.
// Phase 1: matrix 99 rows 82 cols
[2024-05-21 12:01:28] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229932 resets) in 811 ms. (1231 steps per ms)
BEST_FIRST walk for 1000001 steps (99226 resets) in 391 ms. (2551 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 12:01:29] [INFO ] Invariant cache hit.
[2024-05-21 12:01:29] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:29] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-21 12:01:29] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 12:01:29] [INFO ] [Real]Added 29 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:01:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:01:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:29] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 12:01:29] [INFO ] [Nat]Added 29 Read/Feed constraints in 5 ms returned sat
[2024-05-21 12:01:29] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 5 ms.
[2024-05-21 12:01:29] [INFO ] Added : 7 causal constraints over 2 iterations in 32 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-21 12:01:30] [INFO ] Invariant cache hit.
[2024-05-21 12:01:30] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 12:01:30] [INFO ] Invariant cache hit.
[2024-05-21 12:01:30] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 12:01:30] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-05-21 12:01:30] [INFO ] Redundant transitions in 2 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-21 12:01:30] [INFO ] Invariant cache hit.
[2024-05-21 12:01:30] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/181 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 113 constraints, problems are : Problem set: 0 solved, 98 unsolved in 1625 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/181 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 98/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 211 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3661 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 5374ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 5375ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5556 ms. Remains : 82/82 places, 99/99 transitions.
RANDOM walk for 40000 steps (9181 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3998 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3911 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2725467 steps, run timeout after 3001 ms. (steps per millisecond=908 ) properties seen :1 out of 2
Probabilistic random walk after 2725467 steps, saw 1105789 distinct states, run finished after 3006 ms. (steps per millisecond=906 ) properties seen :1
[2024-05-21 12:01:38] [INFO ] Invariant cache hit.
[2024-05-21 12:01:38] [INFO ] State equation strengthened by 29 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) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 75/134 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 172/181 variables, and 79 constraints, problems are : Problem set: 1 solved, 0 unsolved in 64 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/82 constraints, ReadFeed: 0/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-00 in 10413 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m08-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:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
// Phase 1: matrix 123 rows 91 cols
[2024-05-21 12:01:38] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2315 resets) in 11 ms. (833 steps per ms)
BEST_FIRST walk for 10001 steps (1027 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2024-05-21 12:01:38] [INFO ] Invariant cache hit.
[2024-05-21 12:01:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:38] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-21 12:01:38] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 12:01:38] [INFO ] [Real]Added 44 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:01:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:01:38] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:38] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-21 12:01:38] [INFO ] [Nat]Added 44 Read/Feed constraints in 4 ms returned sat
[2024-05-21 12:01:38] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 91 transitions) in 8 ms.
[2024-05-21 12:01:38] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-21 12:01:39] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 12:01:39] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 12:01:39] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-21 12:01:39] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-21 12:01:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 266 ms
[2024-05-21 12:01:39] [INFO ] Added : 14 causal constraints over 4 iterations in 318 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 123/123 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 89 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 89 transition count 120
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 89 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 88 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 88 transition count 112
Applied a total of 8 rules in 9 ms. Remains 88 /91 variables (removed 3) and now considering 112/123 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 88/91 places, 112/123 transitions.
// Phase 1: matrix 112 rows 88 cols
[2024-05-21 12:01:39] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 1000000 steps (229952 resets) in 879 ms. (1136 steps per ms)
BEST_FIRST walk for 1000000 steps (98770 resets) in 419 ms. (2380 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2024-05-21 12:01:40] [INFO ] Invariant cache hit.
[2024-05-21 12:01:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:40] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-21 12:01:40] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 12:01:40] [INFO ] [Real]Added 36 Read/Feed constraints in 5 ms returned sat
[2024-05-21 12:01:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:01:40] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:40] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-21 12:01:40] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2024-05-21 12:01:40] [INFO ] Computed and/alt/rep : 31/67/31 causal constraints (skipped 80 transitions) in 6 ms.
[2024-05-21 12:01:40] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-21 12:01:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-21 12:01:40] [INFO ] Added : 13 causal constraints over 4 iterations in 111 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 112/112 transitions.
Applied a total of 0 rules in 7 ms. Remains 88 /88 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 88/88 places, 112/112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 112/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-05-21 12:01:40] [INFO ] Invariant cache hit.
[2024-05-21 12:01:41] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 12:01:41] [INFO ] Invariant cache hit.
[2024-05-21 12:01:41] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 12:01:41] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-21 12:01:41] [INFO ] Redundant transitions in 2 ms returned []
Running 111 sub problems to find dead transitions.
[2024-05-21 12:01:41] [INFO ] Invariant cache hit.
[2024-05-21 12:01:41] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/200 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 126 constraints, problems are : Problem set: 0 solved, 111 unsolved in 1931 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/200 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 111/237 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 237 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4933 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
After SMT, in 6979ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 6980ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7191 ms. Remains : 88/88 places, 112/112 transitions.
RANDOM walk for 40000 steps (9277 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3981 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3918 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 3008157 steps, run timeout after 3001 ms. (steps per millisecond=1002 ) properties seen :1 out of 2
Probabilistic random walk after 3008157 steps, saw 1155775 distinct states, run finished after 3001 ms. (steps per millisecond=1002 ) properties seen :1
[2024-05-21 12:01:51] [INFO ] Invariant cache hit.
[2024-05-21 12:01:51] [INFO ] State equation strengthened by 36 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) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/23 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 84/107 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 45/152 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/159 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/159 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/159 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 41/200 variables, 36/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/200 variables, 24/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 12:01:51] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 200/200 variables, and 127 constraints, problems are : Problem set: 1 solved, 0 unsolved in 136 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 140ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[8]
Ending property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-01 in 12631 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m08-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:[1547]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1547]
// Phase 1: matrix 123 rows 91 cols
[2024-05-21 12:01:51] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1547]
RANDOM walk for 10000 steps (2285 resets) in 11 ms. (833 steps per ms)
BEST_FIRST walk for 10001 steps (965 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1547]
[2024-05-21 12:01:51] [INFO ] Invariant cache hit.
[2024-05-21 12:01:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:51] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-21 12:01:51] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 12:01:51] [INFO ] [Real]Added 44 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:01:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:01:51] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:51] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-21 12:01:51] [INFO ] [Nat]Added 44 Read/Feed constraints in 7 ms returned sat
[2024-05-21 12:01:51] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 91 transitions) in 7 ms.
[2024-05-21 12:01:51] [INFO ] Added : 10 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1547]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1547]
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 123/123 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 89 transition count 117
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 89 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 89 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 88 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 88 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 87 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 87 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 86 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 86 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 85 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 85 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 84 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 84 transition count 108
Applied a total of 15 rules in 24 ms. Remains 84 /91 variables (removed 7) and now considering 108/123 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 84/91 places, 108/123 transitions.
// Phase 1: matrix 108 rows 84 cols
[2024-05-21 12:01:51] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1547]
RANDOM walk for 1000000 steps (229497 resets) in 881 ms. (1133 steps per ms)
BEST_FIRST walk for 1000001 steps (98410 resets) in 421 ms. (2369 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1547]
[2024-05-21 12:01:52] [INFO ] Invariant cache hit.
[2024-05-21 12:01:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:53] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-21 12:01:53] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 12:01:53] [INFO ] [Real]Added 36 Read/Feed constraints in 5 ms returned sat
[2024-05-21 12:01:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:01:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:01:53] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 12:01:53] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2024-05-21 12:01:53] [INFO ] Computed and/alt/rep : 29/65/29 causal constraints (skipped 78 transitions) in 6 ms.
[2024-05-21 12:01:53] [INFO ] Added : 9 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1547]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1547]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 84/84 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-21 12:01:53] [INFO ] Invariant cache hit.
[2024-05-21 12:01:53] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 12:01:53] [INFO ] Invariant cache hit.
[2024-05-21 12:01:53] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 12:01:53] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-21 12:01:53] [INFO ] Redundant transitions in 4 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-21 12:01:53] [INFO ] Invariant cache hit.
[2024-05-21 12:01:53] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/192 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 122 constraints, problems are : Problem set: 0 solved, 107 unsolved in 1770 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/192 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 107/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 229 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3817 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 5687ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 5689ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5889 ms. Remains : 84/84 places, 108/108 transitions.
RANDOM walk for 40000 steps (9125 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3970 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3949 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 3032028 steps, run timeout after 3001 ms. (steps per millisecond=1010 ) properties seen :1 out of 2
Probabilistic random walk after 3032028 steps, saw 1188112 distinct states, run finished after 3001 ms. (steps per millisecond=1010 ) properties seen :1
[2024-05-21 12:02:02] [INFO ] Invariant cache hit.
[2024-05-21 12:02:02] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/85 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 49/134 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/141 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 192/192 variables, and 93 constraints, problems are : Problem set: 1 solved, 0 unsolved in 75 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 7/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 80ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1547]
Ending property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-11 in 10833 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 123 rows 91 cols
[2024-05-21 12:02:02] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (2270 resets) in 11 ms. (833 steps per ms)
BEST_FIRST walk for 10000 steps (1013 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2024-05-21 12:02:02] [INFO ] Invariant cache hit.
[2024-05-21 12:02:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:02:02] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-21 12:02:02] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 12:02:02] [INFO ] [Real]Added 44 Read/Feed constraints in 8 ms returned sat
[2024-05-21 12:02:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:02:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:02:02] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-21 12:02:02] [INFO ] [Nat]Added 44 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:02:02] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 91 transitions) in 7 ms.
[2024-05-21 12:02:02] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-21 12:02:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-21 12:02:02] [INFO ] Added : 4 causal constraints over 2 iterations in 97 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[10]
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 123/123 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 88 transition count 115
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 88 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 88 transition count 113
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 86 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 86 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 85 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 85 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 84 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 84 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 83 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 83 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 82 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 82 transition count 99
Applied a total of 20 rules in 12 ms. Remains 82 /91 variables (removed 9) and now considering 99/123 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 82/91 places, 99/123 transitions.
// Phase 1: matrix 99 rows 82 cols
[2024-05-21 12:02:02] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 1000000 steps (230046 resets) in 790 ms. (1264 steps per ms)
BEST_FIRST walk for 1000000 steps (98206 resets) in 383 ms. (2604 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2024-05-21 12:02:03] [INFO ] Invariant cache hit.
[2024-05-21 12:02:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:02:03] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-21 12:02:03] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 12:02:03] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-21 12:02:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:02:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:02:03] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-21 12:02:03] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-21 12:02:03] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 4 ms.
[2024-05-21 12:02:03] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-21 12:02:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-21 12:02:03] [INFO ] Added : 6 causal constraints over 4 iterations in 105 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[10]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-21 12:02:04] [INFO ] Invariant cache hit.
[2024-05-21 12:02:04] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 12:02:04] [INFO ] Invariant cache hit.
[2024-05-21 12:02:04] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 12:02:04] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-21 12:02:04] [INFO ] Redundant transitions in 2 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-21 12:02:04] [INFO ] Invariant cache hit.
[2024-05-21 12:02:04] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/181 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 113 constraints, problems are : Problem set: 0 solved, 98 unsolved in 1648 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/181 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 98/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 211 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3590 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 5318ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 5319ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5493 ms. Remains : 82/82 places, 99/99 transitions.
RANDOM walk for 40000 steps (9174 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3920 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4004 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2709803 steps, run timeout after 3001 ms. (steps per millisecond=902 ) properties seen :1 out of 2
Probabilistic random walk after 2709803 steps, saw 1098987 distinct states, run finished after 3001 ms. (steps per millisecond=902 ) properties seen :1
[2024-05-21 12:02:12] [INFO ] Invariant cache hit.
[2024-05-21 12:02:12] [INFO ] State equation strengthened by 29 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) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 75/134 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 172/181 variables, and 79 constraints, problems are : Problem set: 1 solved, 0 unsolved in 59 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/82 constraints, ReadFeed: 0/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 64ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[10]
Ending property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-12 in 10461 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1547]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1547]
// Phase 1: matrix 123 rows 91 cols
[2024-05-21 12:02:12] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1547]
RANDOM walk for 10000 steps (2285 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (985 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1547]
[2024-05-21 12:02:12] [INFO ] Invariant cache hit.
[2024-05-21 12:02:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:02:12] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-21 12:02:12] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 12:02:12] [INFO ] [Real]Added 44 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:02:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:02:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 12:02:12] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-21 12:02:12] [INFO ] [Nat]Added 44 Read/Feed constraints in 8 ms returned sat
[2024-05-21 12:02:12] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 91 transitions) in 9 ms.
[2024-05-21 12:02:12] [INFO ] Added : 9 causal constraints over 2 iterations in 35 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1547]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1547]
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 123/123 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 89 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 89 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 89 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 88 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 88 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 87 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 87 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 86 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 86 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 85 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 85 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 84 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 84 transition count 107
Applied a total of 15 rules in 8 ms. Remains 84 /91 variables (removed 7) and now considering 107/123 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 84/91 places, 107/123 transitions.
// Phase 1: matrix 107 rows 84 cols
[2024-05-21 12:02:12] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1547]
RANDOM walk for 1000000 steps (229655 resets) in 832 ms. (1200 steps per ms)
BEST_FIRST walk for 1000000 steps (98546 resets) in 406 ms. (2457 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1547]
[2024-05-21 12:02:14] [INFO ] Invariant cache hit.
[2024-05-21 12:02:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:02:14] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-21 12:02:14] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 12:02:14] [INFO ] [Real]Added 36 Read/Feed constraints in 5 ms returned sat
[2024-05-21 12:02:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:02:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:02:14] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-21 12:02:14] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:02:14] [INFO ] Computed and/alt/rep : 29/63/29 causal constraints (skipped 77 transitions) in 7 ms.
[2024-05-21 12:02:14] [INFO ] Added : 9 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1547]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1547]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 84/84 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-21 12:02:14] [INFO ] Invariant cache hit.
[2024-05-21 12:02:14] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 12:02:14] [INFO ] Invariant cache hit.
[2024-05-21 12:02:14] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 12:02:14] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-21 12:02:14] [INFO ] Redundant transitions in 2 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-21 12:02:14] [INFO ] Invariant cache hit.
[2024-05-21 12:02:14] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 122 constraints, problems are : Problem set: 0 solved, 106 unsolved in 1946 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 106/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 228 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3905 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 5952ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 5954ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6145 ms. Remains : 84/84 places, 107/107 transitions.
RANDOM walk for 40000 steps (9205 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3996 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (4002 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2706536 steps, run timeout after 3001 ms. (steps per millisecond=901 ) properties seen :1 out of 2
Probabilistic random walk after 2706536 steps, saw 1048376 distinct states, run finished after 3001 ms. (steps per millisecond=901 ) properties seen :1
[2024-05-21 12:02:23] [INFO ] Invariant cache hit.
[2024-05-21 12:02:23] [INFO ] State equation strengthened by 36 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) 80/83 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 50/133 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/140 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 191/191 variables, and 93 constraints, problems are : Problem set: 1 solved, 0 unsolved in 66 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 7/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 75ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1547]
Ending property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-13 in 11010 ms.
[2024-05-21 12:02:23] [INFO ] Flatten gal took : 42 ms
[2024-05-21 12:02:23] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2024-05-21 12:02:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 91 places, 123 transitions and 484 arcs took 4 ms.
Total runtime 89655 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DBSingleClientW-PT-d1m08
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/403/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 91
TRANSITIONS: 123
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.004s]
SAVING FILE /home/mcc/execution/403/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: 904
MODEL NAME: /home/mcc/execution/403/model
91 places, 123 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-01 5 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-12 3 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-11 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716292950763
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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="DBSingleClientW-PT-d1m08"
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 DBSingleClientW-PT-d1m08, 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 r091-tall-171624187900525"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m08.tgz
mv DBSingleClientW-PT-d1m08 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 ;