fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r480-tall-171624189500525
Last Updated
July 7, 2024

About the Execution of LTSMin+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
538.527 112653.00 145427.00 324.20 ? ? 0 0 1 0 0 0 1 0 0 ? ? ? 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.r480-tall-171624189500525.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is DBSingleClientW-PT-d1m08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189500525
=====================================================================

--------------------
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 1717189701785

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:08:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 21:08:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:08:23] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-05-31 21:08:23] [INFO ] Transformed 1440 places.
[2024-05-31 21:08:23] [INFO ] Transformed 672 transitions.
[2024-05-31 21:08:23] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Deduced a syphon composed of 1093 places in 6 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-31 21:08:23] [INFO ] Computed 6 invariants in 38 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 (2343 resets) in 149 ms. (66 steps per ms)
BEST_FIRST walk for 70003 steps (6537 resets) in 266 ms. (262 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 8, 7, 8, 1547, 10, 1547]
[2024-05-31 21:08:24] [INFO ] Invariant cache hit.
[2024-05-31 21:08:24] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-31 21:08:24] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-31 21:08:24] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2024-05-31 21:08:24] [INFO ] State equation strengthened by 418 read => feed constraints.
[2024-05-31 21:08:24] [INFO ] [Real]Added 418 Read/Feed constraints in 83 ms returned sat
[2024-05-31 21:08:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:08:24] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-31 21:08:25] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-05-31 21:08:25] [INFO ] [Nat]Added 418 Read/Feed constraints in 90 ms returned sat
[2024-05-31 21:08:25] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 136 ms.
[2024-05-31 21:08:25] [INFO ] Added : 8 causal constraints over 2 iterations in 292 ms. Result :sat
Minimization took 529 ms.
[2024-05-31 21:08:26] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-31 21:08:26] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:08:26] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-05-31 21:08:26] [INFO ] [Real]Added 418 Read/Feed constraints in 110 ms returned sat
[2024-05-31 21:08:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:08:26] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:08:26] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2024-05-31 21:08:26] [INFO ] [Nat]Added 418 Read/Feed constraints in 70 ms returned sat
[2024-05-31 21:08:26] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 71 ms.
[2024-05-31 21:08:27] [INFO ] Added : 5 causal constraints over 1 iterations in 179 ms. Result :sat
Minimization took 513 ms.
[2024-05-31 21:08:27] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-31 21:08:27] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:08:27] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-05-31 21:08:27] [INFO ] [Real]Added 418 Read/Feed constraints in 76 ms returned sat
[2024-05-31 21:08:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:08:28] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:08:28] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-31 21:08:28] [INFO ] [Nat]Added 418 Read/Feed constraints in 67 ms returned sat
[2024-05-31 21:08:28] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 61 ms.
[2024-05-31 21:08:28] [INFO ] Added : 2 causal constraints over 1 iterations in 156 ms. Result :sat
Minimization took 503 ms.
[2024-05-31 21:08:28] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:08:28] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:08:29] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-31 21:08:29] [INFO ] [Real]Added 418 Read/Feed constraints in 74 ms returned sat
[2024-05-31 21:08:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:08:29] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:08:29] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-05-31 21:08:29] [INFO ] [Nat]Added 418 Read/Feed constraints in 81 ms returned sat
[2024-05-31 21:08:29] [INFO ] Deduced a trap composed of 102 places in 221 ms of which 47 ms to minimize.
[2024-05-31 21:08:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2024-05-31 21:08:29] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 64 ms.
[2024-05-31 21:08:30] [INFO ] Added : 5 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 502 ms.
[2024-05-31 21:08:30] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:08:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:08:30] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-31 21:08:30] [INFO ] [Real]Added 418 Read/Feed constraints in 71 ms returned sat
[2024-05-31 21:08:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:08:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:08:31] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-31 21:08:31] [INFO ] [Nat]Added 418 Read/Feed constraints in 79 ms returned sat
[2024-05-31 21:08:31] [INFO ] Deduced a trap composed of 103 places in 157 ms of which 2 ms to minimize.
[2024-05-31 21:08:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2024-05-31 21:08:31] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 54 ms.
[2024-05-31 21:08:31] [INFO ] Added : 11 causal constraints over 3 iterations in 253 ms. Result :sat
Minimization took 502 ms.
[2024-05-31 21:08:32] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 21:08:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:08:32] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-05-31 21:08:32] [INFO ] [Real]Added 418 Read/Feed constraints in 125 ms returned sat
[2024-05-31 21:08:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:08:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:08:32] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-31 21:08:32] [INFO ] [Nat]Added 418 Read/Feed constraints in 80 ms returned sat
[2024-05-31 21:08:32] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 57 ms.
[2024-05-31 21:08:33] [INFO ] Added : 5 causal constraints over 2 iterations in 176 ms. Result :sat
Minimization took 597 ms.
[2024-05-31 21:08:33] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:08:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-31 21:08:33] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-31 21:08:33] [INFO ] [Real]Added 418 Read/Feed constraints in 84 ms returned sat
[2024-05-31 21:08:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 21:08:34] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2024-05-31 21:08:34] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-31 21:08:34] [INFO ] [Nat]Added 418 Read/Feed constraints in 80 ms returned sat
[2024-05-31 21:08:34] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 59 ms.
[2024-05-31 21:08:34] [INFO ] Added : 12 causal constraints over 3 iterations in 237 ms. Result :sat
Minimization took 545 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 8, 7, 8, 1547, 10, 1547]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 8, 7, 8, 1547, 10, 1547]
Support contains 7 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.3 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 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 352 place count 160 transition count 258
Iterating global reduction 2 with 71 rules applied. Total rules applied 423 place count 160 transition count 258
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 429 place count 160 transition count 252
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 467 place count 122 transition count 190
Iterating global reduction 3 with 38 rules applied. Total rules applied 505 place count 122 transition count 190
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 525 place count 122 transition count 170
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 535 place count 112 transition count 157
Iterating global reduction 4 with 10 rules applied. Total rules applied 545 place count 112 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 547 place count 112 transition count 155
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 554 place count 105 transition count 148
Iterating global reduction 5 with 7 rules applied. Total rules applied 561 place count 105 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 564 place count 105 transition count 145
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 569 place count 100 transition count 140
Iterating global reduction 6 with 5 rules applied. Total rules applied 574 place count 100 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 575 place count 100 transition count 139
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 576 place count 99 transition count 137
Iterating global reduction 7 with 1 rules applied. Total rules applied 577 place count 99 transition count 137
Applied a total of 577 rules in 99 ms. Remains 99 /347 variables (removed 248) and now considering 137/672 (removed 535) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 99/347 places, 137/672 transitions.
// Phase 1: matrix 137 rows 99 cols
[2024-05-31 21:08:35] [INFO ] Computed 2 invariants in 2 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 1000000 steps (229112 resets) in 2300 ms. (434 steps per ms)
BEST_FIRST walk for 7000004 steps (686625 resets) in 7269 ms. (962 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 1, 0, 0, 0] Max Struct:[7, 8, 7, 8, 1547, 10, 1547]
[2024-05-31 21:08:44] [INFO ] Invariant cache hit.
[2024-05-31 21:08:44] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-31 21:08:44] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-31 21:08:44] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-31 21:08:44] [INFO ] [Real]Added 50 Read/Feed constraints in 20 ms returned sat
[2024-05-31 21:08:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:44] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:08:44] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-31 21:08:44] [INFO ] [Nat]Added 50 Read/Feed constraints in 7 ms returned sat
[2024-05-31 21:08:44] [INFO ] Computed and/alt/rep : 34/85/34 causal constraints (skipped 102 transitions) in 11 ms.
[2024-05-31 21:08:45] [INFO ] Added : 7 causal constraints over 2 iterations in 42 ms. Result :sat
Minimization took 72 ms.
[2024-05-31 21:08:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:08:45] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 21:08:45] [INFO ] [Real]Added 50 Read/Feed constraints in 8 ms returned sat
[2024-05-31 21:08:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:08:45] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-31 21:08:45] [INFO ] [Nat]Added 50 Read/Feed constraints in 7 ms returned sat
[2024-05-31 21:08:45] [INFO ] Computed and/alt/rep : 34/85/34 causal constraints (skipped 102 transitions) in 10 ms.
[2024-05-31 21:08:45] [INFO ] Added : 5 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 68 ms.
[2024-05-31 21:08:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:08:45] [INFO ] [Real]Absence check using state equation in 22 ms returned unsat
[2024-05-31 21:08:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:08:45] [INFO ] [Real]Absence check using state equation in 28 ms returned unsat
[2024-05-31 21:08:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-31 21:08:45] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-31 21:08:45] [INFO ] [Real]Added 50 Read/Feed constraints in 7 ms returned sat
[2024-05-31 21:08:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:08:45] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-31 21:08:45] [INFO ] [Nat]Added 50 Read/Feed constraints in 10 ms returned sat
[2024-05-31 21:08:45] [INFO ] Computed and/alt/rep : 34/85/34 causal constraints (skipped 102 transitions) in 11 ms.
[2024-05-31 21:08:45] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-05-31 21:08:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-31 21:08:45] [INFO ] Added : 12 causal constraints over 3 iterations in 123 ms. Result :sat
Minimization took 61 ms.
[2024-05-31 21:08:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:08:45] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-31 21:08:45] [INFO ] [Real]Added 50 Read/Feed constraints in 8 ms returned sat
[2024-05-31 21:08:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:08:45] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-31 21:08:46] [INFO ] [Nat]Added 50 Read/Feed constraints in 12 ms returned sat
[2024-05-31 21:08:46] [INFO ] Computed and/alt/rep : 34/85/34 causal constraints (skipped 102 transitions) in 10 ms.
[2024-05-31 21:08:46] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-31 21:08:46] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-31 21:08:46] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:08:46] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:08:46] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
[2024-05-31 21:08:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 308 ms
[2024-05-31 21:08:46] [INFO ] Added : 17 causal constraints over 6 iterations in 398 ms. Result :sat
Minimization took 108 ms.
[2024-05-31 21:08:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:08:46] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-31 21:08:46] [INFO ] [Real]Added 50 Read/Feed constraints in 7 ms returned sat
[2024-05-31 21:08:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:08:46] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-31 21:08:46] [INFO ] [Nat]Added 50 Read/Feed constraints in 8 ms returned sat
[2024-05-31 21:08:46] [INFO ] Computed and/alt/rep : 34/85/34 causal constraints (skipped 102 transitions) in 10 ms.
[2024-05-31 21:08:46] [INFO ] Added : 12 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 1, 0, 0, 0] Max Struct:[7, 8, 1, 1, 1547, 10, 1547]
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
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] Max Struct:[7, 8, 1547, 10, 1547]
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 137/137 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 97 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 97 transition count 135
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 95 transition count 132
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 95 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 95 transition count 131
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 93 transition count 129
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 93 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 93 transition count 128
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 91 transition count 125
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 91 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 91 transition count 123
Applied a total of 20 rules in 28 ms. Remains 91 /99 variables (removed 8) and now considering 123/137 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 91/99 places, 123/137 transitions.
// Phase 1: matrix 123 rows 91 cols
[2024-05-31 21:08:47] [INFO ] Computed 2 invariants in 1 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 (229736 resets) in 2067 ms. (483 steps per ms)
BEST_FIRST walk for 5000004 steps (492620 resets) in 4858 ms. (1029 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-31 21:08:53] [INFO ] Invariant cache hit.
[2024-05-31 21:08:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:08:54] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 21:08:54] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 21:08:54] [INFO ] [Real]Added 44 Read/Feed constraints in 7 ms returned sat
[2024-05-31 21:08:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:08:54] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 21:08:54] [INFO ] [Nat]Added 44 Read/Feed constraints in 7 ms returned sat
[2024-05-31 21:08:54] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 91 transitions) in 8 ms.
[2024-05-31 21:08:54] [INFO ] Added : 8 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 53 ms.
[2024-05-31 21:08:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:08:54] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 21:08:54] [INFO ] [Real]Added 44 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:08:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:08:54] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 21:08:54] [INFO ] [Nat]Added 44 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:08:54] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 91 transitions) in 8 ms.
[2024-05-31 21:08:54] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-31 21:08:54] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 5 ms to minimize.
[2024-05-31 21:08:54] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-31 21:08:54] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:08:54] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:08:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 340 ms
[2024-05-31 21:08:54] [INFO ] Added : 14 causal constraints over 4 iterations in 393 ms. Result :sat
Minimization took 95 ms.
[2024-05-31 21:08:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:08:54] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 21:08:54] [INFO ] [Real]Added 44 Read/Feed constraints in 8 ms returned sat
[2024-05-31 21:08:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 6 ms returned sat
[2024-05-31 21:08:54] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-31 21:08:54] [INFO ] [Nat]Added 44 Read/Feed constraints in 7 ms returned sat
[2024-05-31 21:08:55] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 91 transitions) in 9 ms.
[2024-05-31 21:08:55] [INFO ] Added : 10 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 57 ms.
[2024-05-31 21:08:55] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:08:55] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 21:08:55] [INFO ] [Real]Added 44 Read/Feed constraints in 6 ms returned sat
[2024-05-31 21:08:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:55] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:08:55] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 21:08:55] [INFO ] [Nat]Added 44 Read/Feed constraints in 7 ms returned sat
[2024-05-31 21:08:55] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 91 transitions) in 9 ms.
[2024-05-31 21:08:55] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:08:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-31 21:08:55] [INFO ] Added : 4 causal constraints over 2 iterations in 99 ms. Result :sat
Minimization took 73 ms.
[2024-05-31 21:08:55] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:08:55] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-31 21:08:55] [INFO ] [Real]Added 44 Read/Feed constraints in 9 ms returned sat
[2024-05-31 21:08:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:08:55] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:08:55] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-31 21:08:55] [INFO ] [Nat]Added 44 Read/Feed constraints in 9 ms returned sat
[2024-05-31 21:08:55] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 91 transitions) in 10 ms.
[2024-05-31 21:08:55] [INFO ] Added : 9 causal constraints over 2 iterations in 41 ms. Result :sat
Minimization took 54 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 5 ms. Remains 91 /91 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-31 21:08:55] [INFO ] Invariant cache hit.
[2024-05-31 21:08:55] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 21:08:55] [INFO ] Invariant cache hit.
[2024-05-31 21:08:55] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 21:08:56] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-31 21:08:56] [INFO ] Redundant transitions in 3 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-31 21:08:56] [INFO ] Invariant cache hit.
[2024-05-31 21:08:56] [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 2561 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 5935 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 8701ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 8714ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8977 ms. Remains : 91/91 places, 123/123 transitions.
RANDOM walk for 40000 steps (9162 resets) in 1710 ms. (23 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (3982 resets) in 279 ms. (142 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (3923 resets) in 200 ms. (199 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (3980 resets) in 191 ms. (208 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (3975 resets) in 139 ms. (285 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (3897 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (3990 resets) in 208 ms. (191 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (3911 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (3877 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (4016 resets) in 171 ms. (232 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (3977 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 557085 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :5 out of 10
Probabilistic random walk after 557085 steps, saw 214580 distinct states, run finished after 3004 ms. (steps per millisecond=185 ) properties seen :5
[2024-05-31 21:09:09] [INFO ] Invariant cache hit.
[2024-05-31 21:09:09] [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-31 21:09:09] [INFO ] Deduced a trap composed of 11 places in 54 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 232 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 237ms 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-31 21:09:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2286 resets) in 22 ms. (434 steps per ms)
BEST_FIRST walk for 10000 steps (938 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-31 21:09:09] [INFO ] Invariant cache hit.
[2024-05-31 21:09:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:09:09] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 21:09:09] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 21:09:09] [INFO ] [Real]Added 44 Read/Feed constraints in 6 ms returned sat
[2024-05-31 21:09:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:09:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:09:09] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 21:09:09] [INFO ] [Nat]Added 44 Read/Feed constraints in 6 ms returned sat
[2024-05-31 21:09:09] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 91 transitions) in 8 ms.
[2024-05-31 21:09:09] [INFO ] Added : 8 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 50 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 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-31 21:09:09] [INFO ] Computed 2 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229655 resets) in 1865 ms. (535 steps per ms)
BEST_FIRST walk for 1000000 steps (98302 resets) in 869 ms. (1149 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-31 21:09:12] [INFO ] Invariant cache hit.
[2024-05-31 21:09:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:09:12] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 21:09:12] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-31 21:09:12] [INFO ] [Real]Added 29 Read/Feed constraints in 14 ms returned sat
[2024-05-31 21:09:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:09:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:09:12] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 21:09:12] [INFO ] [Nat]Added 29 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:09:12] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 7 ms.
[2024-05-31 21:09:12] [INFO ] Added : 7 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 35 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 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 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 3 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-31 21:09:12] [INFO ] Invariant cache hit.
[2024-05-31 21:09:12] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-31 21:09:12] [INFO ] Invariant cache hit.
[2024-05-31 21:09:12] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-31 21:09:12] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-31 21:09:12] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-31 21:09:12] [INFO ] Invariant cache hit.
[2024-05-31 21:09:12] [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 1668 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 3678 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 5451ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 5453ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5658 ms. Remains : 82/82 places, 99/99 transitions.
RANDOM walk for 40000 steps (9215 resets) in 238 ms. (167 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4043 resets) in 58 ms. (677 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4004 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2226787 steps, run timeout after 3001 ms. (steps per millisecond=742 ) properties seen :1 out of 2
Probabilistic random walk after 2226787 steps, saw 888315 distinct states, run finished after 3003 ms. (steps per millisecond=741 ) properties seen :1
[2024-05-31 21:09:21] [INFO ] Invariant cache hit.
[2024-05-31 21:09:21] [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 65 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 70ms 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 12144 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-31 21:09:21] [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 (2319 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (920 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2024-05-31 21:09:21] [INFO ] Invariant cache hit.
[2024-05-31 21:09:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:09:21] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 21:09:21] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 21:09:21] [INFO ] [Real]Added 44 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:09:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:09:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:09:21] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 21:09:21] [INFO ] [Nat]Added 44 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:09:21] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 91 transitions) in 9 ms.
[2024-05-31 21:09:21] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-31 21:09:21] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:09:21] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:09:21] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:09:22] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:09:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 308 ms
[2024-05-31 21:09:22] [INFO ] Added : 14 causal constraints over 4 iterations in 365 ms. Result :sat
Minimization took 95 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 15 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 15 ms. Remains : 88/91 places, 112/123 transitions.
// Phase 1: matrix 112 rows 88 cols
[2024-05-31 21:09:22] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 1000000 steps (229899 resets) in 1957 ms. (510 steps per ms)
BEST_FIRST walk for 1000001 steps (98621 resets) in 885 ms. (1128 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2024-05-31 21:09:25] [INFO ] Invariant cache hit.
[2024-05-31 21:09:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:09:25] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-31 21:09:25] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:09:25] [INFO ] [Real]Added 36 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:09:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:09:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:09:25] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 21:09:25] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:09:25] [INFO ] Computed and/alt/rep : 31/67/31 causal constraints (skipped 80 transitions) in 8 ms.
[2024-05-31 21:09:25] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:09:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-31 21:09:25] [INFO ] Added : 13 causal constraints over 4 iterations in 115 ms. Result :sat
Minimization took 76 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 6 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 6 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-31 21:09:25] [INFO ] Invariant cache hit.
[2024-05-31 21:09:25] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-31 21:09:25] [INFO ] Invariant cache hit.
[2024-05-31 21:09:25] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:09:25] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-05-31 21:09:25] [INFO ] Redundant transitions in 2 ms returned []
Running 111 sub problems to find dead transitions.
[2024-05-31 21:09:25] [INFO ] Invariant cache hit.
[2024-05-31 21:09:25] [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 2126 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 4993 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 7227ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 7229ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7467 ms. Remains : 88/88 places, 112/112 transitions.
RANDOM walk for 40000 steps (9172 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3943 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3905 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2365812 steps, run timeout after 3001 ms. (steps per millisecond=788 ) properties seen :1 out of 2
Probabilistic random walk after 2365812 steps, saw 880633 distinct states, run finished after 3002 ms. (steps per millisecond=788 ) properties seen :1
[2024-05-31 21:09:36] [INFO ] Invariant cache hit.
[2024-05-31 21:09:36] [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-31 21:09:36] [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 137 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 142ms 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 14677 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-31 21:09:36] [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 (2254 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (999 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1547]
[2024-05-31 21:09:36] [INFO ] Invariant cache hit.
[2024-05-31 21:09:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:09:36] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 21:09:36] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 21:09:36] [INFO ] [Real]Added 44 Read/Feed constraints in 8 ms returned sat
[2024-05-31 21:09:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:09:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:09:36] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 21:09:36] [INFO ] [Nat]Added 44 Read/Feed constraints in 7 ms returned sat
[2024-05-31 21:09:36] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 91 transitions) in 9 ms.
[2024-05-31 21:09:36] [INFO ] Added : 10 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 54 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 20 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 21 ms. Remains : 84/91 places, 108/123 transitions.
// Phase 1: matrix 108 rows 84 cols
[2024-05-31 21:09:36] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1547]
RANDOM walk for 1000000 steps (229943 resets) in 1910 ms. (523 steps per ms)
BEST_FIRST walk for 1000001 steps (98708 resets) in 884 ms. (1129 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1547]
[2024-05-31 21:09:39] [INFO ] Invariant cache hit.
[2024-05-31 21:09:39] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:09:39] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 21:09:39] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:09:39] [INFO ] [Real]Added 36 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:09:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:09:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:09:39] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 21:09:39] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2024-05-31 21:09:39] [INFO ] Computed and/alt/rep : 29/65/29 causal constraints (skipped 78 transitions) in 8 ms.
[2024-05-31 21:09:39] [INFO ] Added : 9 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 31 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 2 ms. Remains 84 /84 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-31 21:09:39] [INFO ] Invariant cache hit.
[2024-05-31 21:09:39] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-31 21:09:39] [INFO ] Invariant cache hit.
[2024-05-31 21:09:39] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:09:39] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-31 21:09:39] [INFO ] Redundant transitions in 3 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-31 21:09:39] [INFO ] Invariant cache hit.
[2024-05-31 21:09:39] [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 1837 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 3764 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 5933 ms. Remains : 84/84 places, 108/108 transitions.
RANDOM walk for 40000 steps (9210 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3859 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3860 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2142241 steps, run timeout after 3001 ms. (steps per millisecond=713 ) properties seen :1 out of 2
Probabilistic random walk after 2142241 steps, saw 845365 distinct states, run finished after 3001 ms. (steps per millisecond=713 ) properties seen :1
[2024-05-31 21:09:48] [INFO ] Invariant cache hit.
[2024-05-31 21:09:48] [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 92 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 99ms 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 12463 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-31 21:09:48] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (2272 resets) in 22 ms. (434 steps per ms)
BEST_FIRST walk for 10001 steps (1026 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2024-05-31 21:09:48] [INFO ] Invariant cache hit.
[2024-05-31 21:09:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:09:48] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-31 21:09:48] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 21:09:48] [INFO ] [Real]Added 44 Read/Feed constraints in 9 ms returned sat
[2024-05-31 21:09:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:09:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:09:48] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 21:09:48] [INFO ] [Nat]Added 44 Read/Feed constraints in 7 ms returned sat
[2024-05-31 21:09:48] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 91 transitions) in 9 ms.
[2024-05-31 21:09:48] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-31 21:09:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-31 21:09:48] [INFO ] Added : 4 causal constraints over 2 iterations in 111 ms. Result :sat
Minimization took 77 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 11 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 11 ms. Remains : 82/91 places, 99/123 transitions.
// Phase 1: matrix 99 rows 82 cols
[2024-05-31 21:09:49] [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 (229446 resets) in 1821 ms. (548 steps per ms)
BEST_FIRST walk for 1000001 steps (98769 resets) in 838 ms. (1191 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2024-05-31 21:09:51] [INFO ] Invariant cache hit.
[2024-05-31 21:09:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:09:51] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-31 21:09:51] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-31 21:09:51] [INFO ] [Real]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:09:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:09:51] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:09:51] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 21:09:51] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:09:51] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 7 ms.
[2024-05-31 21:09:51] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-31 21:09:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-31 21:09:52] [INFO ] Added : 6 causal constraints over 4 iterations in 95 ms. Result :sat
Minimization took 48 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-31 21:09:52] [INFO ] Invariant cache hit.
[2024-05-31 21:09:52] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-31 21:09:52] [INFO ] Invariant cache hit.
[2024-05-31 21:09:52] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-31 21:09:52] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-31 21:09:52] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-31 21:09:52] [INFO ] Invariant cache hit.
[2024-05-31 21:09:52] [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 1790 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 3669 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 5539ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 5540ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5743 ms. Remains : 82/82 places, 99/99 transitions.
RANDOM walk for 40000 steps (9159 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3850 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3940 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2338812 steps, run timeout after 3001 ms. (steps per millisecond=779 ) properties seen :1 out of 2
Probabilistic random walk after 2338812 steps, saw 939466 distinct states, run finished after 3001 ms. (steps per millisecond=779 ) properties seen :1
[2024-05-31 21:10:00] [INFO ] Invariant cache hit.
[2024-05-31 21:10:00] [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 75 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 78ms 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 12321 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-31 21:10:00] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1547]
RANDOM walk for 10000 steps (2313 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10000 steps (1037 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1547]
[2024-05-31 21:10:01] [INFO ] Invariant cache hit.
[2024-05-31 21:10:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:10:01] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 21:10:01] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 21:10:01] [INFO ] [Real]Added 44 Read/Feed constraints in 6 ms returned sat
[2024-05-31 21:10:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:10:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:10:01] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 21:10:01] [INFO ] [Nat]Added 44 Read/Feed constraints in 8 ms returned sat
[2024-05-31 21:10:01] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 91 transitions) in 10 ms.
[2024-05-31 21:10:01] [INFO ] Added : 9 causal constraints over 2 iterations in 41 ms. Result :sat
Minimization took 50 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 20 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 21 ms. Remains : 84/91 places, 107/123 transitions.
// Phase 1: matrix 107 rows 84 cols
[2024-05-31 21:10:01] [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 (229583 resets) in 1885 ms. (530 steps per ms)
BEST_FIRST walk for 1000001 steps (98701 resets) in 869 ms. (1149 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1547]
[2024-05-31 21:10:04] [INFO ] Invariant cache hit.
[2024-05-31 21:10:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:10:04] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 21:10:04] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:10:04] [INFO ] [Real]Added 36 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:10:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:10:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:10:04] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 21:10:04] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2024-05-31 21:10:04] [INFO ] Computed and/alt/rep : 29/63/29 causal constraints (skipped 77 transitions) in 7 ms.
[2024-05-31 21:10:04] [INFO ] Added : 9 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 31 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 2 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 2 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-31 21:10:04] [INFO ] Invariant cache hit.
[2024-05-31 21:10:04] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-31 21:10:04] [INFO ] Invariant cache hit.
[2024-05-31 21:10:04] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:10:04] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-31 21:10:04] [INFO ] Redundant transitions in 5 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-31 21:10:04] [INFO ] Invariant cache hit.
[2024-05-31 21:10:04] [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 1951 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 4010 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 6075ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 6076ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6297 ms. Remains : 84/84 places, 107/107 transitions.
RANDOM walk for 40000 steps (9127 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3946 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4029 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2289678 steps, run timeout after 3001 ms. (steps per millisecond=762 ) properties seen :1 out of 2
Probabilistic random walk after 2289678 steps, saw 901924 distinct states, run finished after 3003 ms. (steps per millisecond=762 ) properties seen :1
[2024-05-31 21:10:13] [INFO ] Invariant cache hit.
[2024-05-31 21:10:13] [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 145 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 165ms 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 12888 ms.
[2024-05-31 21:10:14] [INFO ] Flatten gal took : 60 ms
[2024-05-31 21:10:14] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 16 ms.
[2024-05-31 21:10:14] [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 110994 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DBSingleClientW-PT-d1m08-UpperBounds-00
Could not compute solution for formula : DBSingleClientW-PT-d1m08-UpperBounds-01
Could not compute solution for formula : DBSingleClientW-PT-d1m08-UpperBounds-11
Could not compute solution for formula : DBSingleClientW-PT-d1m08-UpperBounds-12
Could not compute solution for formula : DBSingleClientW-PT-d1m08-UpperBounds-13

BK_STOP 1717189814438

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name DBSingleClientW-PT-d1m08-UpperBounds-00
ub formula formula --maxsum=/tmp/901/ub_0_
ub formula name DBSingleClientW-PT-d1m08-UpperBounds-01
ub formula formula --maxsum=/tmp/901/ub_1_
ub formula name DBSingleClientW-PT-d1m08-UpperBounds-11
ub formula formula --maxsum=/tmp/901/ub_2_
ub formula name DBSingleClientW-PT-d1m08-UpperBounds-12
ub formula formula --maxsum=/tmp/901/ub_3_
ub formula name DBSingleClientW-PT-d1m08-UpperBounds-13
ub formula formula --maxsum=/tmp/901/ub_4_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is 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 r480-tall-171624189500525"
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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;