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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 12:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 12 12:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 12 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717191467921

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-d2m10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:37:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 21:37:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:37:49] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2024-05-31 21:37:49] [INFO ] Transformed 4763 places.
[2024-05-31 21:37:49] [INFO ] Transformed 2478 transitions.
[2024-05-31 21:37:49] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 373 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Deduced a syphon composed of 3580 places in 26 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-31 21:37:49] [INFO ] Computed 6 invariants in 147 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[3255, 10, 3255]
RANDOM walk for 10000 steps (2268 resets) in 363 ms. (27 steps per ms)
BEST_FIRST walk for 30000 steps (2806 resets) in 209 ms. (142 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 2, 0] Max Struct:[3255, 10, 3255]
[2024-05-31 21:37:50] [INFO ] Invariant cache hit.
[2024-05-31 21:37:51] [INFO ] [Real]Absence check using 2 positive place invariants in 18 ms returned sat
[2024-05-31 21:37:51] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-31 21:37:51] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2024-05-31 21:37:52] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2024-05-31 21:37:52] [INFO ] [Real]Added 1588 Read/Feed constraints in 730 ms returned sat
[2024-05-31 21:37:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:37:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2024-05-31 21:37:53] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2024-05-31 21:37:53] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2024-05-31 21:37:54] [INFO ] [Nat]Added 1588 Read/Feed constraints in 881 ms returned sat
[2024-05-31 21:37:55] [INFO ] Deduced a trap composed of 194 places in 933 ms of which 152 ms to minimize.
[2024-05-31 21:37:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1132 ms
[2024-05-31 21:37:56] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 680 ms.
[2024-05-31 21:37:57] [INFO ] Added : 14 causal constraints over 3 iterations in 1519 ms. Result :sat
Minimization took 564 ms.
[2024-05-31 21:37:58] [INFO ] [Real]Absence check using 2 positive place invariants in 17 ms returned sat
[2024-05-31 21:37:58] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-31 21:37:58] [INFO ] [Real]Absence check using state equation in 698 ms returned sat
[2024-05-31 21:37:59] [INFO ] [Real]Added 1588 Read/Feed constraints in 855 ms returned sat
[2024-05-31 21:37:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:38:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-31 21:38:00] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:38:00] [INFO ] [Nat]Absence check using state equation in 647 ms returned sat
[2024-05-31 21:38:01] [INFO ] [Nat]Added 1588 Read/Feed constraints in 764 ms returned sat
[2024-05-31 21:38:02] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 649 ms.
[2024-05-31 21:38:02] [INFO ] Added : 1 causal constraints over 1 iterations in 918 ms. Result :sat
Minimization took 625 ms.
[2024-05-31 21:38:03] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-31 21:38:03] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:38:03] [INFO ] [Real]Absence check using state equation in 729 ms returned sat
[2024-05-31 21:38:04] [INFO ] [Real]Added 1588 Read/Feed constraints in 712 ms returned sat
[2024-05-31 21:38:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:38:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2024-05-31 21:38:04] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:38:05] [INFO ] [Nat]Absence check using state equation in 701 ms returned sat
[2024-05-31 21:38:06] [INFO ] [Nat]Added 1588 Read/Feed constraints in 933 ms returned sat
[2024-05-31 21:38:07] [INFO ] Deduced a trap composed of 202 places in 764 ms of which 9 ms to minimize.
[2024-05-31 21:38:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 906 ms
[2024-05-31 21:38:07] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 400 ms.
[2024-05-31 21:38:08] [INFO ] Added : 12 causal constraints over 3 iterations in 919 ms. Result :sat
Minimization took 613 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 2, 0] Max Struct:[3255, 10, 3255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 2, 0] Max Struct:[3255, 10, 3255]
Support contains 3 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.7 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 391 places :
Symmetric choice reduction at 1 with 391 rule applications. Total rules 609 place count 745 transition count 1200
Iterating global reduction 1 with 391 rules applied. Total rules applied 1000 place count 745 transition count 1200
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1009 place count 745 transition count 1191
Discarding 316 places :
Symmetric choice reduction at 2 with 316 rule applications. Total rules 1325 place count 429 transition count 875
Iterating global reduction 2 with 316 rules applied. Total rules applied 1641 place count 429 transition count 875
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1653 place count 429 transition count 863
Discarding 240 places :
Symmetric choice reduction at 3 with 240 rule applications. Total rules 1893 place count 189 transition count 522
Iterating global reduction 3 with 240 rules applied. Total rules applied 2133 place count 189 transition count 522
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Iterating post reduction 3 with 211 rules applied. Total rules applied 2344 place count 189 transition count 311
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2369 place count 164 transition count 271
Iterating global reduction 4 with 25 rules applied. Total rules applied 2394 place count 164 transition count 271
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2400 place count 164 transition count 265
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2417 place count 147 transition count 248
Iterating global reduction 5 with 17 rules applied. Total rules applied 2434 place count 147 transition count 248
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2438 place count 147 transition count 244
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2452 place count 133 transition count 230
Iterating global reduction 6 with 14 rules applied. Total rules applied 2466 place count 133 transition count 230
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2479 place count 133 transition count 217
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 2485 place count 127 transition count 188
Iterating global reduction 7 with 6 rules applied. Total rules applied 2491 place count 127 transition count 188
Applied a total of 2491 rules in 293 ms. Remains 127 /1183 variables (removed 1056) and now considering 188/2478 (removed 2290) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 127/1183 places, 188/2478 transitions.
// Phase 1: matrix 188 rows 127 cols
[2024-05-31 21:38:09] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 2, 0] Max Struct:[3255, 10, 3255]
RANDOM walk for 1000000 steps (229950 resets) in 2559 ms. (390 steps per ms)
BEST_FIRST walk for 3000003 steps (287613 resets) in 3299 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 3, 0] Max Struct:[3255, 10, 3255]
[2024-05-31 21:38:15] [INFO ] Invariant cache hit.
[2024-05-31 21:38:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 6 ms returned sat
[2024-05-31 21:38:15] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-31 21:38:15] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 21:38:15] [INFO ] [Real]Added 66 Read/Feed constraints in 13 ms returned sat
[2024-05-31 21:38:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:38:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:38:15] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-31 21:38:15] [INFO ] [Nat]Added 66 Read/Feed constraints in 19 ms returned sat
[2024-05-31 21:38:15] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 16 ms.
[2024-05-31 21:38:15] [INFO ] Added : 13 causal constraints over 3 iterations in 65 ms. Result :sat
Minimization took 101 ms.
[2024-05-31 21:38:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:38:15] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-31 21:38:15] [INFO ] [Real]Added 66 Read/Feed constraints in 16 ms returned sat
[2024-05-31 21:38:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:38:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:38:15] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-31 21:38:15] [INFO ] [Nat]Added 66 Read/Feed constraints in 8 ms returned sat
[2024-05-31 21:38:15] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 18 ms.
[2024-05-31 21:38:15] [INFO ] Added : 1 causal constraints over 1 iterations in 38 ms. Result :sat
Minimization took 85 ms.
[2024-05-31 21:38:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:38:16] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-31 21:38:16] [INFO ] [Real]Added 66 Read/Feed constraints in 14 ms returned sat
[2024-05-31 21:38:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:38:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:38:16] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-31 21:38:16] [INFO ] [Nat]Added 66 Read/Feed constraints in 21 ms returned sat
[2024-05-31 21:38:16] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 14 ms.
[2024-05-31 21:38:16] [INFO ] Added : 28 causal constraints over 6 iterations in 104 ms. Result :sat
Minimization took 105 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 3, 0] Max Struct:[3255, 10, 3255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 3, 0] Max Struct:[3255, 10, 3255]
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Applied a total of 0 rules in 12 ms. Remains 127 /127 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 127/127 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Applied a total of 0 rules in 11 ms. Remains 127 /127 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-31 21:38:16] [INFO ] Invariant cache hit.
[2024-05-31 21:38:16] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-31 21:38:16] [INFO ] Invariant cache hit.
[2024-05-31 21:38:16] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 21:38:17] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2024-05-31 21:38:17] [INFO ] Redundant transitions in 7 ms returned []
Running 187 sub problems to find dead transitions.
[2024-05-31 21:38:17] [INFO ] Invariant cache hit.
[2024-05-31 21:38:17] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/315 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 66/195 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 0/315 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 195 constraints, problems are : Problem set: 0 solved, 187 unsolved in 5205 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/315 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 66/195 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 187/382 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 382 constraints, problems are : Problem set: 0 solved, 187 unsolved in 13289 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
After SMT, in 18924ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 18946ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19501 ms. Remains : 127/127 places, 188/188 transitions.
[2024-05-31 21:38:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 3, 0] Max Struct:[3255, 10, 3255]
RANDOM walk for 1000000 steps (229763 resets) in 2495 ms. (400 steps per ms)
BEST_FIRST walk for 3000002 steps (287791 resets) in 3268 ms. (917 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 5, 0] Max Struct:[3255, 10, 3255]
[2024-05-31 21:38:41] [INFO ] Invariant cache hit.
[2024-05-31 21:38:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:38:41] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-31 21:38:41] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 21:38:41] [INFO ] [Real]Added 66 Read/Feed constraints in 13 ms returned sat
[2024-05-31 21:38:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:38:42] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:38:42] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-31 21:38:42] [INFO ] [Nat]Added 66 Read/Feed constraints in 18 ms returned sat
[2024-05-31 21:38:42] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 13 ms.
[2024-05-31 21:38:42] [INFO ] Added : 13 causal constraints over 3 iterations in 70 ms. Result :sat
Minimization took 97 ms.
[2024-05-31 21:38:42] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:38:42] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-31 21:38:42] [INFO ] [Real]Added 66 Read/Feed constraints in 12 ms returned sat
[2024-05-31 21:38:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:38:42] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:38:42] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-31 21:38:42] [INFO ] [Nat]Added 66 Read/Feed constraints in 9 ms returned sat
[2024-05-31 21:38:42] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 12 ms.
[2024-05-31 21:38:42] [INFO ] Added : 1 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 84 ms.
[2024-05-31 21:38:42] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:38:42] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-31 21:38:42] [INFO ] [Real]Added 66 Read/Feed constraints in 14 ms returned sat
[2024-05-31 21:38:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:38:42] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:38:42] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-31 21:38:42] [INFO ] [Nat]Added 66 Read/Feed constraints in 19 ms returned sat
[2024-05-31 21:38:42] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 12 ms.
[2024-05-31 21:38:42] [INFO ] Added : 28 causal constraints over 6 iterations in 108 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 5, 0] Max Struct:[3255, 10, 3255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 5, 0] Max Struct:[3255, 10, 3255]
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Applied a total of 0 rules in 7 ms. Remains 127 /127 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 127/127 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-31 21:38:43] [INFO ] Invariant cache hit.
[2024-05-31 21:38:43] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-31 21:38:43] [INFO ] Invariant cache hit.
[2024-05-31 21:38:43] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 21:38:43] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2024-05-31 21:38:43] [INFO ] Redundant transitions in 8 ms returned []
Running 187 sub problems to find dead transitions.
[2024-05-31 21:38:43] [INFO ] Invariant cache hit.
[2024-05-31 21:38:43] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/315 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 66/195 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 0/315 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 195 constraints, problems are : Problem set: 0 solved, 187 unsolved in 4843 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/315 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 66/195 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 187/382 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 382 constraints, problems are : Problem set: 0 solved, 187 unsolved in 13307 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
After SMT, in 18384ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 18387ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18796 ms. Remains : 127/127 places, 188/188 transitions.
[2024-05-31 21:39:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 5, 0] Max Struct:[3255, 10, 3255]
RANDOM walk for 1000000 steps (230138 resets) in 2412 ms. (414 steps per ms)
BEST_FIRST walk for 3000001 steps (287473 resets) in 3193 ms. (939 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 5, 0] Max Struct:[3255, 10, 3255]
[2024-05-31 21:39:07] [INFO ] Invariant cache hit.
[2024-05-31 21:39:07] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:39:07] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-31 21:39:07] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 21:39:07] [INFO ] [Real]Added 66 Read/Feed constraints in 16 ms returned sat
[2024-05-31 21:39:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:07] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:39:07] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-31 21:39:07] [INFO ] [Nat]Added 66 Read/Feed constraints in 19 ms returned sat
[2024-05-31 21:39:07] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 14 ms.
[2024-05-31 21:39:07] [INFO ] Added : 13 causal constraints over 3 iterations in 60 ms. Result :sat
Minimization took 104 ms.
[2024-05-31 21:39:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:39:08] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-31 21:39:08] [INFO ] [Real]Added 66 Read/Feed constraints in 13 ms returned sat
[2024-05-31 21:39:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:39:08] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-31 21:39:08] [INFO ] [Nat]Added 66 Read/Feed constraints in 9 ms returned sat
[2024-05-31 21:39:08] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 12 ms.
[2024-05-31 21:39:08] [INFO ] Added : 1 causal constraints over 1 iterations in 32 ms. Result :sat
Minimization took 84 ms.
[2024-05-31 21:39:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:39:08] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-31 21:39:08] [INFO ] [Real]Added 66 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:39:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:39:08] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-31 21:39:08] [INFO ] [Nat]Added 66 Read/Feed constraints in 19 ms returned sat
[2024-05-31 21:39:08] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 13 ms.
[2024-05-31 21:39:08] [INFO ] Added : 28 causal constraints over 6 iterations in 104 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 5, 0] Max Struct:[3255, 10, 3255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 5, 0] Max Struct:[3255, 10, 3255]
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 127/127 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-31 21:39:08] [INFO ] Invariant cache hit.
[2024-05-31 21:39:09] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-31 21:39:09] [INFO ] Invariant cache hit.
[2024-05-31 21:39:09] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 21:39:09] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2024-05-31 21:39:09] [INFO ] Redundant transitions in 1 ms returned []
Running 187 sub problems to find dead transitions.
[2024-05-31 21:39:09] [INFO ] Invariant cache hit.
[2024-05-31 21:39:09] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/315 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 66/195 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 0/315 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 195 constraints, problems are : Problem set: 0 solved, 187 unsolved in 5035 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/315 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 66/195 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 187/382 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 382 constraints, problems are : Problem set: 0 solved, 187 unsolved in 13253 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
After SMT, in 18539ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 18542ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18936 ms. Remains : 127/127 places, 188/188 transitions.
RANDOM walk for 40000 steps (9158 resets) in 1149 ms. (34 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3769 resets) in 208 ms. (191 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3917 resets) in 182 ms. (218 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3877 resets) in 209 ms. (190 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3841 resets) in 152 ms. (261 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3815 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3782 resets) in 150 ms. (264 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 502828 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :2 out of 6
Probabilistic random walk after 502828 steps, saw 206568 distinct states, run finished after 3004 ms. (steps per millisecond=167 ) properties seen :2
[2024-05-31 21:39:31] [INFO ] Invariant cache hit.
[2024-05-31 21:39:31] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 151/161 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 25/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 67/228 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 48/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 15/243 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MAX2 is UNSAT
At refinement iteration 12 (OVERLAPS) 72/315 variables, 54/154 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/315 variables, 41/195 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-31 21:39:31] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
Problem MAX1 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 1/196 constraints. Problems are: Problem set: 3 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/315 variables, 0/196 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/315 variables, 0/196 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 196 constraints, problems are : Problem set: 3 solved, 1 unsolved in 307 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/135 variables, 4/5 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 8/13 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 1/14 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 72/207 variables, 1/15 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 53/68 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/68 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/222 variables, 1/69 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 11/80 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/80 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 93/315 variables, 58/138 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 58/196 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/315 variables, 1/197 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/315 variables, 0/197 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/315 variables, 0/197 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 197 constraints, problems are : Problem set: 3 solved, 1 unsolved in 118 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 434ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 185
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 185
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 125 transition count 183
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 123 transition count 168
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 123 transition count 168
Applied a total of 10 rules in 10 ms. Remains 123 /127 variables (removed 4) and now considering 168/188 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 123/127 places, 168/188 transitions.
RANDOM walk for 40000 steps (9104 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3864 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1553727 steps, run timeout after 3001 ms. (steps per millisecond=517 ) properties seen :0 out of 1
Probabilistic random walk after 1553727 steps, saw 657824 distinct states, run finished after 3001 ms. (steps per millisecond=517 ) properties seen :0
// Phase 1: matrix 168 rows 123 cols
[2024-05-31 21:39:35] [INFO ] Computed 2 invariants in 5 ms
[2024-05-31 21:39:35] [INFO ] State equation strengthened by 49 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) 129/132 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 72/204 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/219 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/291 variables, 54/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 103 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/132 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 72/204 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/219 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/291 variables, 54/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 41/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/291 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/291 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 107 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 221ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-31 21:39:35] [INFO ] Invariant cache hit.
[2024-05-31 21:39:35] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 21:39:35] [INFO ] Invariant cache hit.
[2024-05-31 21:39:35] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-31 21:39:35] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2024-05-31 21:39:35] [INFO ] Redundant transitions in 2 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-31 21:39:35] [INFO ] Invariant cache hit.
[2024-05-31 21:39:35] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 174 constraints, problems are : Problem set: 0 solved, 167 unsolved in 4125 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 167/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 341 constraints, problems are : Problem set: 0 solved, 167 unsolved in 12090 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 16451ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 16454ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16783 ms. Remains : 123/123 places, 168/168 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 123 transition count 157
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 14 place count 120 transition count 157
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 14 place count 120 transition count 146
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 36 place count 109 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 108 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 108 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 107 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 107 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 105 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 103 transition count 164
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 57 place count 103 transition count 155
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 94 transition count 155
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 69 place count 94 transition count 155
Applied a total of 69 rules in 36 ms. Remains 94 /123 variables (removed 29) and now considering 155/168 (removed 13) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 155 rows 94 cols
[2024-05-31 21:39:52] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 21:39:52] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 21:39:52] [INFO ] [Real]Absence check using 1 positive and 5 generalized place invariants in 13 ms returned sat
[2024-05-31 21:39:52] [INFO ] After 34ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:39:52] [INFO ] After 51ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-31 21:39:52] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 140 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 5, 0] Max Struct:[3255, 10, 3255]
Starting property specific reduction for DBSingleClientW-PT-d2m10-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:[3255]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[3255]
// Phase 1: matrix 188 rows 127 cols
[2024-05-31 21:39:52] [INFO ] Computed 2 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3255]
RANDOM walk for 10000 steps (2329 resets) in 31 ms. (312 steps per ms)
BEST_FIRST walk for 10001 steps (925 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3255]
[2024-05-31 21:39:52] [INFO ] Invariant cache hit.
[2024-05-31 21:39:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:39:52] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-31 21:39:52] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 21:39:52] [INFO ] [Real]Added 66 Read/Feed constraints in 17 ms returned sat
[2024-05-31 21:39:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:39:52] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-31 21:39:52] [INFO ] [Nat]Added 66 Read/Feed constraints in 19 ms returned sat
[2024-05-31 21:39:52] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 12 ms.
[2024-05-31 21:39:52] [INFO ] Added : 13 causal constraints over 3 iterations in 61 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3255]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 126 transition count 187
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 126 transition count 186
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 125 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 125 transition count 178
Applied a total of 5 rules in 11 ms. Remains 125 /127 variables (removed 2) and now considering 178/188 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 125/127 places, 178/188 transitions.
// Phase 1: matrix 178 rows 125 cols
[2024-05-31 21:39:52] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3255]
RANDOM walk for 1000000 steps (230336 resets) in 2405 ms. (415 steps per ms)
BEST_FIRST walk for 1000001 steps (95763 resets) in 1079 ms. (925 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3255]
[2024-05-31 21:39:56] [INFO ] Invariant cache hit.
[2024-05-31 21:39:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:39:56] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-31 21:39:56] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-31 21:39:56] [INFO ] [Real]Added 57 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:39:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:39:56] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-31 21:39:56] [INFO ] [Nat]Added 57 Read/Feed constraints in 11 ms returned sat
[2024-05-31 21:39:56] [INFO ] Computed and/alt/rep : 49/119/49 causal constraints (skipped 128 transitions) in 12 ms.
[2024-05-31 21:39:56] [INFO ] Added : 12 causal constraints over 3 iterations in 52 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3255]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 125/125 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-31 21:39:56] [INFO ] Invariant cache hit.
[2024-05-31 21:39:56] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-31 21:39:56] [INFO ] Invariant cache hit.
[2024-05-31 21:39:56] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-31 21:39:57] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-05-31 21:39:57] [INFO ] Redundant transitions in 2 ms returned []
Running 177 sub problems to find dead transitions.
[2024-05-31 21:39:57] [INFO ] Invariant cache hit.
[2024-05-31 21:39:57] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 184 constraints, problems are : Problem set: 0 solved, 177 unsolved in 5417 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 177/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 361 constraints, problems are : Problem set: 0 solved, 177 unsolved in 10259 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 15895ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 15898ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16267 ms. Remains : 125/125 places, 178/178 transitions.
RANDOM walk for 40000 steps (9155 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3732 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3860 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1768419 steps, run timeout after 3001 ms. (steps per millisecond=589 ) properties seen :1 out of 2
Probabilistic random walk after 1768419 steps, saw 733501 distinct states, run finished after 3002 ms. (steps per millisecond=589 ) properties seen :1
[2024-05-31 21:40:16] [INFO ] Invariant cache hit.
[2024-05-31 21:40:16] [INFO ] State equation strengthened by 57 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) 131/135 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 71/206 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/221 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 303/303 variables, and 135 constraints, problems are : Problem set: 1 solved, 0 unsolved in 111 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 8/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 119ms 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:[3255]
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-01 in 23868 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 188 rows 127 cols
[2024-05-31 21:40:16] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (2292 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10000 steps (928 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2024-05-31 21:40:16] [INFO ] Invariant cache hit.
[2024-05-31 21:40:16] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:40:16] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-31 21:40:16] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 21:40:16] [INFO ] [Real]Added 66 Read/Feed constraints in 14 ms returned sat
[2024-05-31 21:40:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:40:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:16] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-31 21:40:16] [INFO ] [Nat]Added 66 Read/Feed constraints in 8 ms returned sat
[2024-05-31 21:40:16] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 13 ms.
[2024-05-31 21:40:16] [INFO ] Added : 1 causal constraints over 1 iterations in 32 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 185
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 185
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 125 transition count 183
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 123 transition count 168
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 123 transition count 168
Applied a total of 10 rules in 8 ms. Remains 123 /127 variables (removed 4) and now considering 168/188 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 123/127 places, 168/188 transitions.
// Phase 1: matrix 168 rows 123 cols
[2024-05-31 21:40:16] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[10]
RANDOM walk for 1000000 steps (230127 resets) in 2184 ms. (457 steps per ms)
BEST_FIRST walk for 1000001 steps (96838 resets) in 986 ms. (1013 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[10]
[2024-05-31 21:40:19] [INFO ] Invariant cache hit.
[2024-05-31 21:40:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:19] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-31 21:40:19] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-31 21:40:19] [INFO ] [Real]Added 49 Read/Feed constraints in 7 ms returned sat
[2024-05-31 21:40:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:40:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:19] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-31 21:40:19] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-31 21:40:19] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 13 ms.
[2024-05-31 21:40:19] [INFO ] Added : 1 causal constraints over 1 iterations in 32 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-31 21:40:20] [INFO ] Invariant cache hit.
[2024-05-31 21:40:20] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-31 21:40:20] [INFO ] Invariant cache hit.
[2024-05-31 21:40:20] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-31 21:40:20] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-05-31 21:40:20] [INFO ] Redundant transitions in 1 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-31 21:40:20] [INFO ] Invariant cache hit.
[2024-05-31 21:40:20] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 174 constraints, problems are : Problem set: 0 solved, 167 unsolved in 4226 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 167/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 341 constraints, problems are : Problem set: 0 solved, 167 unsolved in 11458 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 15871ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 15874ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16201 ms. Remains : 123/123 places, 168/168 transitions.
[2024-05-31 21:40:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[10]
RANDOM walk for 1000000 steps (229781 resets) in 2182 ms. (458 steps per ms)
BEST_FIRST walk for 1000000 steps (95884 resets) in 980 ms. (1019 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[10]
[2024-05-31 21:40:39] [INFO ] Invariant cache hit.
[2024-05-31 21:40:39] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:39] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-31 21:40:39] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-31 21:40:39] [INFO ] [Real]Added 49 Read/Feed constraints in 8 ms returned sat
[2024-05-31 21:40:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:40:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:39] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-31 21:40:39] [INFO ] [Nat]Added 49 Read/Feed constraints in 7 ms returned sat
[2024-05-31 21:40:39] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 11 ms.
[2024-05-31 21:40:39] [INFO ] Added : 1 causal constraints over 1 iterations in 41 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-31 21:40:39] [INFO ] Invariant cache hit.
[2024-05-31 21:40:39] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-31 21:40:39] [INFO ] Invariant cache hit.
[2024-05-31 21:40:39] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-31 21:40:40] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-05-31 21:40:40] [INFO ] Redundant transitions in 1 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-31 21:40:40] [INFO ] Invariant cache hit.
[2024-05-31 21:40:40] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 174 constraints, problems are : Problem set: 0 solved, 167 unsolved in 4026 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 167/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 341 constraints, problems are : Problem set: 0 solved, 167 unsolved in 11321 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 15538ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 15541ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15874 ms. Remains : 123/123 places, 168/168 transitions.
RANDOM walk for 40000 steps (9243 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3922 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3844 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1142369 steps, run timeout after 3001 ms. (steps per millisecond=380 ) properties seen :0 out of 2
Probabilistic random walk after 1142369 steps, saw 482724 distinct states, run finished after 3001 ms. (steps per millisecond=380 ) properties seen :0
[2024-05-31 21:40:58] [INFO ] Invariant cache hit.
[2024-05-31 21:40:58] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 129/132 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 72/204 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 15/219 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 72/291 variables, 54/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 21:40:58] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 1/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/291 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/291 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 175 constraints, problems are : Problem set: 1 solved, 1 unsolved in 192 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/132 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 8/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 72/204 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 53/68 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/219 variables, 1/69 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 11/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/291 variables, 54/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 41/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/291 variables, 1/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/291 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/291 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 176 constraints, problems are : Problem set: 1 solved, 1 unsolved in 95 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 292ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 123/123 places, 168/168 transitions.
RANDOM walk for 40000 steps (9184 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3843 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1604847 steps, run timeout after 3001 ms. (steps per millisecond=534 ) properties seen :0 out of 1
Probabilistic random walk after 1604847 steps, saw 676488 distinct states, run finished after 3001 ms. (steps per millisecond=534 ) properties seen :0
[2024-05-31 21:41:02] [INFO ] Invariant cache hit.
[2024-05-31 21:41:02] [INFO ] State equation strengthened by 49 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) 129/132 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 72/204 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/219 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/291 variables, 54/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 101 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/132 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 72/204 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/219 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/291 variables, 54/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 41/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/291 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/291 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 104 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 210ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-31 21:41:02] [INFO ] Invariant cache hit.
[2024-05-31 21:41:02] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-31 21:41:02] [INFO ] Invariant cache hit.
[2024-05-31 21:41:02] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-31 21:41:02] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-05-31 21:41:02] [INFO ] Redundant transitions in 0 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-31 21:41:02] [INFO ] Invariant cache hit.
[2024-05-31 21:41:02] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 174 constraints, problems are : Problem set: 0 solved, 167 unsolved in 4245 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 167/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 341 constraints, problems are : Problem set: 0 solved, 167 unsolved in 11464 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 15897ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 15900ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16231 ms. Remains : 123/123 places, 168/168 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 123 transition count 157
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 14 place count 120 transition count 157
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 14 place count 120 transition count 146
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 36 place count 109 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 108 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 108 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 107 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 107 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 105 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 103 transition count 164
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 57 place count 103 transition count 155
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 94 transition count 155
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 69 place count 94 transition count 155
Applied a total of 69 rules in 22 ms. Remains 94 /123 variables (removed 29) and now considering 155/168 (removed 13) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 155 rows 94 cols
[2024-05-31 21:41:18] [INFO ] Computed 6 invariants in 2 ms
[2024-05-31 21:41:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 21:41:18] [INFO ] [Real]Absence check using 1 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-31 21:41:18] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:41:18] [INFO ] After 43ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-31 21:41:18] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 111 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[10]
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-03 in 62432 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[3255]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[3255]
// Phase 1: matrix 188 rows 127 cols
[2024-05-31 21:41:18] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3255]
RANDOM walk for 10000 steps (2311 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (992 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3255]
[2024-05-31 21:41:18] [INFO ] Invariant cache hit.
[2024-05-31 21:41:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:41:18] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-31 21:41:18] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 21:41:18] [INFO ] [Real]Added 66 Read/Feed constraints in 13 ms returned sat
[2024-05-31 21:41:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:41:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:41:18] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-31 21:41:18] [INFO ] [Nat]Added 66 Read/Feed constraints in 20 ms returned sat
[2024-05-31 21:41:18] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 14 ms.
[2024-05-31 21:41:18] [INFO ] Added : 28 causal constraints over 6 iterations in 98 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3255]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 126 transition count 186
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 126 transition count 185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 125 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 125 transition count 178
Applied a total of 5 rules in 8 ms. Remains 125 /127 variables (removed 2) and now considering 178/188 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 125/127 places, 178/188 transitions.
// Phase 1: matrix 178 rows 125 cols
[2024-05-31 21:41:19] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3255]
RANDOM walk for 1000000 steps (229768 resets) in 2250 ms. (444 steps per ms)
BEST_FIRST walk for 1000001 steps (96185 resets) in 1042 ms. (958 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3255]
[2024-05-31 21:41:22] [INFO ] Invariant cache hit.
[2024-05-31 21:41:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:41:22] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-31 21:41:22] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:41:22] [INFO ] [Real]Added 58 Read/Feed constraints in 11 ms returned sat
[2024-05-31 21:41:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:41:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:41:22] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-31 21:41:22] [INFO ] [Nat]Added 58 Read/Feed constraints in 12 ms returned sat
[2024-05-31 21:41:22] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 128 transitions) in 14 ms.
[2024-05-31 21:41:22] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-31 21:41:22] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-31 21:41:22] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-31 21:41:23] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-31 21:41:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 294 ms
[2024-05-31 21:41:23] [INFO ] Added : 21 causal constraints over 5 iterations in 396 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3255]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 125/125 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 7 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-31 21:41:23] [INFO ] Invariant cache hit.
[2024-05-31 21:41:23] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 21:41:23] [INFO ] Invariant cache hit.
[2024-05-31 21:41:23] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:41:23] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-05-31 21:41:23] [INFO ] Redundant transitions in 1 ms returned []
Running 177 sub problems to find dead transitions.
[2024-05-31 21:41:23] [INFO ] Invariant cache hit.
[2024-05-31 21:41:23] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 58/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 185 constraints, problems are : Problem set: 0 solved, 177 unsolved in 5113 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 58/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 177/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 362 constraints, problems are : Problem set: 0 solved, 177 unsolved in 13574 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 18915ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 18917ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19313 ms. Remains : 125/125 places, 178/178 transitions.
RANDOM walk for 40000 steps (9240 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3737 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3862 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1776057 steps, run timeout after 3001 ms. (steps per millisecond=591 ) properties seen :1 out of 2
Probabilistic random walk after 1776057 steps, saw 734367 distinct states, run finished after 3001 ms. (steps per millisecond=591 ) properties seen :1
[2024-05-31 21:41:45] [INFO ] Invariant cache hit.
[2024-05-31 21:41:45] [INFO ] State equation strengthened by 58 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) 131/134 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/206 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/221 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 303/303 variables, and 136 constraints, problems are : Problem set: 1 solved, 0 unsolved in 110 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 9/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 117ms 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:[3255]
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-07 in 27190 ms.
[2024-05-31 21:41:46] [INFO ] Flatten gal took : 46 ms
[2024-05-31 21:41:46] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2024-05-31 21:41:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 127 places, 188 transitions and 742 arcs took 4 ms.
Total runtime 236774 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-d2m10-UpperBounds-01
Could not compute solution for formula : DBSingleClientW-PT-d2m10-UpperBounds-03
Could not compute solution for formula : DBSingleClientW-PT-d2m10-UpperBounds-07

BK_STOP 1717191706339

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-d2m10-UpperBounds-01
ub formula formula --maxsum=/tmp/875/ub_0_
ub formula name DBSingleClientW-PT-d2m10-UpperBounds-03
ub formula formula --maxsum=/tmp/875/ub_1_
ub formula name DBSingleClientW-PT-d2m10-UpperBounds-07
ub formula formula --maxsum=/tmp/875/ub_2_
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-d2m10"
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-d2m10, 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-171624189600597"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m10.tgz
mv DBSingleClientW-PT-d2m10 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 ;