Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r091-tall-171624187900517.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DBSingleClientW-PT-d1m07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187900517
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Apr 12 12:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 12:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 12:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716292241152

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 11:50:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 11:50:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:50:42] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2024-05-21 11:50:42] [INFO ] Transformed 1440 places.
[2024-05-21 11:50:42] [INFO ] Transformed 672 transitions.
[2024-05-21 11:50:42] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-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 672 rows 347 cols
[2024-05-21 11:50:42] [INFO ] Computed 6 invariants in 51 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1428, 1428, 9]
RANDOM walk for 10000 steps (2306 resets) in 139 ms. (71 steps per ms)
BEST_FIRST walk for 30001 steps (2845 resets) in 128 ms. (232 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1] Max Struct:[1428, 1428, 9]
[2024-05-21 11:50:43] [INFO ] Invariant cache hit.
[2024-05-21 11:50:43] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2024-05-21 11:50:43] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-21 11:50:43] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-21 11:50:43] [INFO ] State equation strengthened by 418 read => feed constraints.
[2024-05-21 11:50:43] [INFO ] [Real]Added 418 Read/Feed constraints in 91 ms returned sat
[2024-05-21 11:50:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:50:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 11:50:43] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 11:50:43] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-21 11:50:43] [INFO ] [Nat]Added 418 Read/Feed constraints in 79 ms returned sat
[2024-05-21 11:50:44] [INFO ] Deduced a trap composed of 111 places in 241 ms of which 75 ms to minimize.
[2024-05-21 11:50:44] [INFO ] Deduced a trap composed of 100 places in 155 ms of which 3 ms to minimize.
[2024-05-21 11:50:44] [INFO ] Deduced a trap composed of 99 places in 163 ms of which 3 ms to minimize.
[2024-05-21 11:50:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 709 ms
[2024-05-21 11:50:44] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 120 ms.
[2024-05-21 11:50:44] [INFO ] Added : 11 causal constraints over 3 iterations in 316 ms. Result :sat
Minimization took 526 ms.
[2024-05-21 11:50:45] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 11:50:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 11:50:45] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-21 11:50:45] [INFO ] [Real]Added 418 Read/Feed constraints in 79 ms returned sat
[2024-05-21 11:50:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:50:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-21 11:50:45] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 11:50:46] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-05-21 11:50:46] [INFO ] [Nat]Added 418 Read/Feed constraints in 81 ms returned sat
[2024-05-21 11:50:46] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 68 ms.
[2024-05-21 11:50:46] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 3 ms to minimize.
[2024-05-21 11:50:46] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 2 ms to minimize.
[2024-05-21 11:50:46] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 2 ms to minimize.
[2024-05-21 11:50:47] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 3 ms to minimize.
[2024-05-21 11:50:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 794 ms
[2024-05-21 11:50:47] [INFO ] Added : 12 causal constraints over 4 iterations in 1133 ms. Result :sat
Minimization took 518 ms.
[2024-05-21 11:50:47] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 11:50:47] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 11:50:48] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-21 11:50:48] [INFO ] [Real]Added 418 Read/Feed constraints in 70 ms returned sat
[2024-05-21 11:50:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:50:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 11:50:48] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-21 11:50:48] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-21 11:50:48] [INFO ] [Nat]Added 418 Read/Feed constraints in 72 ms returned sat
[2024-05-21 11:50:48] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 58 ms.
[2024-05-21 11:50:48] [INFO ] Added : 2 causal constraints over 1 iterations in 149 ms. Result :sat
Minimization took 517 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1] Max Struct:[1428, 1428, 9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1] Max Struct:[1428, 1428, 9]
Support contains 3 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 325 transition count 584
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 185 place count 229 transition count 327
Iterating global reduction 1 with 96 rules applied. Total rules applied 281 place count 229 transition count 327
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 285 place count 229 transition count 323
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 359 place count 155 transition count 249
Iterating global reduction 2 with 74 rules applied. Total rules applied 433 place count 155 transition count 249
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 439 place count 155 transition count 243
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 480 place count 114 transition count 176
Iterating global reduction 3 with 41 rules applied. Total rules applied 521 place count 114 transition count 176
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 543 place count 114 transition count 154
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 555 place count 102 transition count 135
Iterating global reduction 4 with 12 rules applied. Total rules applied 567 place count 102 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 569 place count 102 transition count 133
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 578 place count 93 transition count 124
Iterating global reduction 5 with 9 rules applied. Total rules applied 587 place count 93 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 590 place count 93 transition count 121
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 597 place count 86 transition count 114
Iterating global reduction 6 with 7 rules applied. Total rules applied 604 place count 86 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 607 place count 86 transition count 111
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 608 place count 85 transition count 109
Iterating global reduction 7 with 1 rules applied. Total rules applied 609 place count 85 transition count 109
Applied a total of 609 rules in 140 ms. Remains 85 /347 variables (removed 262) and now considering 109/672 (removed 563) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 85/347 places, 109/672 transitions.
// Phase 1: matrix 109 rows 85 cols
[2024-05-21 11:50:49] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1] Max Struct:[1428, 1428, 9]
RANDOM walk for 1000000 steps (229876 resets) in 979 ms. (1020 steps per ms)
BEST_FIRST walk for 3000002 steps (295743 resets) in 1336 ms. (2243 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 2] Max Struct:[1428, 1428, 9]
[2024-05-21 11:50:51] [INFO ] Invariant cache hit.
[2024-05-21 11:50:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:50:51] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-21 11:50:51] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:50:51] [INFO ] [Real]Added 37 Read/Feed constraints in 13 ms returned sat
[2024-05-21 11:50:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:50:51] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:50:51] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 11:50:51] [INFO ] [Nat]Added 37 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:50:51] [INFO ] Computed and/alt/rep : 29/65/29 causal constraints (skipped 79 transitions) in 10 ms.
[2024-05-21 11:50:51] [INFO ] Added : 10 causal constraints over 3 iterations in 49 ms. Result :sat
Minimization took 37 ms.
[2024-05-21 11:50:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:50:51] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-21 11:50:51] [INFO ] [Real]Added 37 Read/Feed constraints in 4 ms returned sat
[2024-05-21 11:50:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:50:51] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:50:51] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-21 11:50:51] [INFO ] [Nat]Added 37 Read/Feed constraints in 6 ms returned sat
[2024-05-21 11:50:51] [INFO ] Computed and/alt/rep : 29/65/29 causal constraints (skipped 79 transitions) in 6 ms.
[2024-05-21 11:50:52] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 2 ms to minimize.
[2024-05-21 11:50:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-21 11:50:52] [INFO ] Added : 9 causal constraints over 2 iterations in 98 ms. Result :sat
Minimization took 35 ms.
[2024-05-21 11:50:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:50:52] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-21 11:50:52] [INFO ] [Real]Added 37 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:50:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:50:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:50:52] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 11:50:52] [INFO ] [Nat]Added 37 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:50:52] [INFO ] Computed and/alt/rep : 29/65/29 causal constraints (skipped 79 transitions) in 5 ms.
[2024-05-21 11:50:52] [INFO ] Added : 2 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 2] Max Struct:[1428, 1428, 9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 2] Max Struct:[1428, 1428, 9]
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 109/109 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 85/85 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 109/109 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-21 11:50:52] [INFO ] Invariant cache hit.
[2024-05-21 11:50:52] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 11:50:52] [INFO ] Invariant cache hit.
[2024-05-21 11:50:52] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:50:52] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-21 11:50:52] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-21 11:50:52] [INFO ] Invariant cache hit.
[2024-05-21 11:50:52] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/194 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 37/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 124 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2006 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/194 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 37/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 108/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 232 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4692 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 6887ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 6902ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7148 ms. Remains : 85/85 places, 109/109 transitions.
[2024-05-21 11:50:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 2] Max Struct:[1428, 1428, 9]
RANDOM walk for 1000000 steps (229719 resets) in 945 ms. (1057 steps per ms)
BEST_FIRST walk for 3000002 steps (294780 resets) in 1197 ms. (2504 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 2] Max Struct:[1428, 1428, 9]
[2024-05-21 11:51:01] [INFO ] Invariant cache hit.
[2024-05-21 11:51:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:51:01] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-21 11:51:01] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:51:01] [INFO ] [Real]Added 37 Read/Feed constraints in 7 ms returned sat
[2024-05-21 11:51:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:51:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:51:01] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 11:51:01] [INFO ] [Nat]Added 37 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:51:01] [INFO ] Computed and/alt/rep : 29/65/29 causal constraints (skipped 79 transitions) in 7 ms.
[2024-05-21 11:51:01] [INFO ] Added : 10 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 40 ms.
[2024-05-21 11:51:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:51:01] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-21 11:51:01] [INFO ] [Real]Added 37 Read/Feed constraints in 4 ms returned sat
[2024-05-21 11:51:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:51:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:51:01] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 11:51:01] [INFO ] [Nat]Added 37 Read/Feed constraints in 6 ms returned sat
[2024-05-21 11:51:01] [INFO ] Computed and/alt/rep : 29/65/29 causal constraints (skipped 79 transitions) in 7 ms.
[2024-05-21 11:51:01] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-21 11:51:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-21 11:51:02] [INFO ] Added : 9 causal constraints over 2 iterations in 90 ms. Result :sat
Minimization took 36 ms.
[2024-05-21 11:51:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:51:02] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-21 11:51:02] [INFO ] [Real]Added 37 Read/Feed constraints in 6 ms returned sat
[2024-05-21 11:51:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:51:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:51:02] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-21 11:51:02] [INFO ] [Nat]Added 37 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:51:02] [INFO ] Computed and/alt/rep : 29/65/29 causal constraints (skipped 79 transitions) in 7 ms.
[2024-05-21 11:51:02] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 2] Max Struct:[1428, 1428, 9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 2] Max Struct:[1428, 1428, 9]
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 109/109 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 85/85 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 109/109 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-21 11:51:02] [INFO ] Invariant cache hit.
[2024-05-21 11:51:02] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 11:51:02] [INFO ] Invariant cache hit.
[2024-05-21 11:51:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:51:02] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-21 11:51:02] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-21 11:51:02] [INFO ] Invariant cache hit.
[2024-05-21 11:51:02] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/194 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 37/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 124 constraints, problems are : Problem set: 0 solved, 108 unsolved in 1808 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/194 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 37/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 108/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 232 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4442 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 6367ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 6368ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6571 ms. Remains : 85/85 places, 109/109 transitions.
RANDOM walk for 40000 steps (9160 resets) in 969 ms. (41 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3986 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (4016 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3953 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3961 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (3862 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3885 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 533164 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :2 out of 6
Probabilistic random walk after 533164 steps, saw 212180 distinct states, run finished after 3008 ms. (steps per millisecond=177 ) properties seen :2
[2024-05-21 11:51:12] [INFO ] Invariant cache hit.
[2024-05-21 11:51:12] [INFO ] State equation strengthened by 37 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) 51/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 7/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 79/140 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
At refinement iteration 7 (OVERLAPS) 45/185 variables, 19/82 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 33/115 constraints. Problems are: Problem set: 3 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 0/115 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/194 variables, 5/120 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 4/124 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/124 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/194 variables, 0/124 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 124 constraints, problems are : Problem set: 3 solved, 1 unsolved in 127 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 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) 51/52 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/59 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 77/136 variables, 59/61 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/61 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 49/185 variables, 21/82 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 33/115 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 1/116 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/116 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/194 variables, 5/121 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 4/125 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/194 variables, 0/125 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/194 variables, 0/125 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 125 constraints, problems are : Problem set: 3 solved, 1 unsolved in 86 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 221ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 109/109 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 83 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 83 transition count 107
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 83 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 82 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 82 transition count 99
Applied a total of 8 rules in 9 ms. Remains 82 /85 variables (removed 3) and now considering 99/109 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 82/85 places, 99/109 transitions.
RANDOM walk for 40000 steps (9184 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3936 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2267864 steps, run visited all 1 properties in 2390 ms. (steps per millisecond=948 )
Probabilistic random walk after 2267864 steps, saw 906811 distinct states, run finished after 2395 ms. (steps per millisecond=946 ) properties seen :1
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 2] Max Struct:[1428, 1428, 9]
Starting property specific reduction for DBSingleClientW-PT-d1m07-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1428]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1428]
[2024-05-21 11:51:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1428]
RANDOM walk for 10000 steps (2284 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10000 steps (1016 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1428]
[2024-05-21 11:51:15] [INFO ] Invariant cache hit.
[2024-05-21 11:51:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:51:15] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-21 11:51:15] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:51:15] [INFO ] [Real]Added 37 Read/Feed constraints in 4 ms returned sat
[2024-05-21 11:51:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:51:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:51:15] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 11:51:15] [INFO ] [Nat]Added 37 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:51:15] [INFO ] Computed and/alt/rep : 29/65/29 causal constraints (skipped 79 transitions) in 6 ms.
[2024-05-21 11:51:15] [INFO ] Added : 10 causal constraints over 3 iterations in 60 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1428]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1428]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 109/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 84 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 108
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 84 transition count 107
Applied a total of 3 rules in 5 ms. Remains 84 /85 variables (removed 1) and now considering 107/109 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 84/85 places, 107/109 transitions.
// Phase 1: matrix 107 rows 84 cols
[2024-05-21 11:51:15] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1428]
RANDOM walk for 1000000 steps (229619 resets) in 801 ms. (1246 steps per ms)
BEST_FIRST walk for 1000000 steps (98658 resets) in 389 ms. (2564 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1428]
[2024-05-21 11:51:16] [INFO ] Invariant cache hit.
[2024-05-21 11:51:16] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:51:16] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-21 11:51:16] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 11:51:16] [INFO ] [Real]Added 36 Read/Feed constraints in 4 ms returned sat
[2024-05-21 11:51:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:51:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:51:16] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 11:51:16] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:51:16] [INFO ] Computed and/alt/rep : 29/63/29 causal constraints (skipped 77 transitions) in 20 ms.
[2024-05-21 11:51:16] [INFO ] Added : 9 causal constraints over 2 iterations in 49 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1428]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1428]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 84/84 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-21 11:51:16] [INFO ] Invariant cache hit.
[2024-05-21 11:51:17] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 11:51:17] [INFO ] Invariant cache hit.
[2024-05-21 11:51:17] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 11:51:17] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-21 11:51:17] [INFO ] Redundant transitions in 3 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-21 11:51:17] [INFO ] Invariant cache hit.
[2024-05-21 11:51:17] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 122 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2069 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 106/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 228 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3815 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 5998ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 6000ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6200 ms. Remains : 84/84 places, 107/107 transitions.
RANDOM walk for 40000 steps (9239 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3913 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (4000 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2807421 steps, run timeout after 3001 ms. (steps per millisecond=935 ) properties seen :1 out of 2
Probabilistic random walk after 2807421 steps, saw 1097267 distinct states, run finished after 3001 ms. (steps per millisecond=935 ) properties seen :1
[2024-05-21 11:51:26] [INFO ] Invariant cache hit.
[2024-05-21 11:51:26] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 80/83 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 50/133 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/140 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 191/191 variables, and 93 constraints, problems are : Problem set: 1 solved, 0 unsolved in 65 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 7/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms 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:[1428]
Ending property specific reduction for DBSingleClientW-PT-d1m07-UpperBounds-05 in 11018 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m07-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:[1428]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1428]
// Phase 1: matrix 109 rows 85 cols
[2024-05-21 11:51:26] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1428]
RANDOM walk for 10000 steps (2303 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10001 steps (997 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1428]
[2024-05-21 11:51:26] [INFO ] Invariant cache hit.
[2024-05-21 11:51:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:51:26] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-21 11:51:26] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:51:26] [INFO ] [Real]Added 37 Read/Feed constraints in 4 ms returned sat
[2024-05-21 11:51:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:51:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:51:26] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-21 11:51:26] [INFO ] [Nat]Added 37 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:51:26] [INFO ] Computed and/alt/rep : 29/65/29 causal constraints (skipped 79 transitions) in 7 ms.
[2024-05-21 11:51:26] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-21 11:51:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-21 11:51:26] [INFO ] Added : 9 causal constraints over 2 iterations in 93 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1428]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1428]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 109/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 84 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 108
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 84 transition count 107
Applied a total of 3 rules in 14 ms. Remains 84 /85 variables (removed 1) and now considering 107/109 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 84/85 places, 107/109 transitions.
// Phase 1: matrix 107 rows 84 cols
[2024-05-21 11:51:26] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1428]
RANDOM walk for 1000000 steps (229780 resets) in 800 ms. (1248 steps per ms)
BEST_FIRST walk for 1000000 steps (98933 resets) in 395 ms. (2525 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1428]
[2024-05-21 11:51:27] [INFO ] Invariant cache hit.
[2024-05-21 11:51:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:51:27] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-21 11:51:27] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 11:51:27] [INFO ] [Real]Added 36 Read/Feed constraints in 4 ms returned sat
[2024-05-21 11:51:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:51:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:51:27] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-21 11:51:27] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:51:27] [INFO ] Computed and/alt/rep : 29/63/29 causal constraints (skipped 77 transitions) in 6 ms.
[2024-05-21 11:51:27] [INFO ] Added : 10 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1428]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1428]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 84/84 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-21 11:51:28] [INFO ] Invariant cache hit.
[2024-05-21 11:51:28] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 11:51:28] [INFO ] Invariant cache hit.
[2024-05-21 11:51:28] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 11:51:28] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-21 11:51:28] [INFO ] Redundant transitions in 3 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-21 11:51:28] [INFO ] Invariant cache hit.
[2024-05-21 11:51:28] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 122 constraints, problems are : Problem set: 0 solved, 106 unsolved in 1973 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 106/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 228 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3294 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 5358ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 5359ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5541 ms. Remains : 84/84 places, 107/107 transitions.
RANDOM walk for 40000 steps (9159 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3914 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3937 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 3123991 steps, run timeout after 3001 ms. (steps per millisecond=1040 ) properties seen :1 out of 2
Probabilistic random walk after 3123991 steps, saw 1226161 distinct states, run finished after 3001 ms. (steps per millisecond=1040 ) properties seen :1
[2024-05-21 11:51:36] [INFO ] Invariant cache hit.
[2024-05-21 11:51:36] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 80/83 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 50/133 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/140 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 191/191 variables, and 93 constraints, problems are : Problem set: 1 solved, 0 unsolved in 75 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 7/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 84ms 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:[1428]
Ending property specific reduction for DBSingleClientW-PT-d1m07-UpperBounds-07 in 10449 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m07-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[9]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[9]
// Phase 1: matrix 109 rows 85 cols
[2024-05-21 11:51:36] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[9]
RANDOM walk for 10000 steps (2275 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10001 steps (990 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[9]
[2024-05-21 11:51:36] [INFO ] Invariant cache hit.
[2024-05-21 11:51:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:51:36] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-21 11:51:36] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:51:36] [INFO ] [Real]Added 37 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:51:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:51:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:51:36] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-21 11:51:36] [INFO ] [Nat]Added 37 Read/Feed constraints in 7 ms returned sat
[2024-05-21 11:51:36] [INFO ] Computed and/alt/rep : 29/65/29 causal constraints (skipped 79 transitions) in 7 ms.
[2024-05-21 11:51:36] [INFO ] Added : 5 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[9]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 109/109 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 83 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 83 transition count 107
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 83 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 82 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 82 transition count 99
Applied a total of 8 rules in 6 ms. Remains 82 /85 variables (removed 3) and now considering 99/109 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 82/85 places, 99/109 transitions.
// Phase 1: matrix 99 rows 82 cols
[2024-05-21 11:51:36] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[9]
RANDOM walk for 1000000 steps (229785 resets) in 747 ms. (1336 steps per ms)
BEST_FIRST walk for 1000000 steps (98379 resets) in 373 ms. (2673 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[9]
[2024-05-21 11:51:38] [INFO ] Invariant cache hit.
[2024-05-21 11:51:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:51:38] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-21 11:51:38] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 11:51:38] [INFO ] [Real]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-21 11:51:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:51:38] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:51:38] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-21 11:51:38] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-21 11:51:38] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-21 11:51:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-21 11:51:38] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 5 ms.
[2024-05-21 11:51:38] [INFO ] Added : 14 causal constraints over 4 iterations in 43 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[9]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-21 11:51:38] [INFO ] Invariant cache hit.
[2024-05-21 11:51:38] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 11:51:38] [INFO ] Invariant cache hit.
[2024-05-21 11:51:38] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 11:51:38] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-21 11:51:38] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-21 11:51:38] [INFO ] Invariant cache hit.
[2024-05-21 11:51:38] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/181 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 113 constraints, problems are : Problem set: 0 solved, 98 unsolved in 1805 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/181 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 98/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 211 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3279 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 5163ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 5164ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5346 ms. Remains : 82/82 places, 99/99 transitions.
[2024-05-21 11:51:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[9]
RANDOM walk for 1000000 steps (229888 resets) in 755 ms. (1322 steps per ms)
BEST_FIRST walk for 1000000 steps (98056 resets) in 359 ms. (2777 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[9]
[2024-05-21 11:51:44] [INFO ] Invariant cache hit.
[2024-05-21 11:51:44] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:51:44] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-21 11:51:44] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 11:51:44] [INFO ] [Real]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-21 11:51:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:51:44] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:51:44] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-21 11:51:44] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-21 11:51:44] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-21 11:51:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-21 11:51:45] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 5 ms.
[2024-05-21 11:51:45] [INFO ] Added : 14 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[9]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 82/82 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-21 11:51:45] [INFO ] Invariant cache hit.
[2024-05-21 11:51:45] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 11:51:45] [INFO ] Invariant cache hit.
[2024-05-21 11:51:45] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 11:51:45] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-21 11:51:45] [INFO ] Redundant transitions in 3 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-21 11:51:45] [INFO ] Invariant cache hit.
[2024-05-21 11:51:45] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/181 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 113 constraints, problems are : Problem set: 0 solved, 98 unsolved in 1805 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/181 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 98/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 211 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3209 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 5121ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 5122ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5312 ms. Remains : 82/82 places, 99/99 transitions.
RANDOM walk for 40000 steps (9194 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4028 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3917 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1303339 steps, run timeout after 3001 ms. (steps per millisecond=434 ) properties seen :0 out of 2
Probabilistic random walk after 1303339 steps, saw 535841 distinct states, run finished after 3001 ms. (steps per millisecond=434 ) properties seen :0
[2024-05-21 11:51:53] [INFO ] Invariant cache hit.
[2024-05-21 11:51:53] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 75/134 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 38/172 variables, 18/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 25/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/181 variables, 5/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 4/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/181 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/181 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 113 constraints, problems are : Problem set: 1 solved, 1 unsolved in 79 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/59 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 75/134 variables, 59/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/172 variables, 18/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 25/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 1/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/181 variables, 5/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/181 variables, 4/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/181 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/181 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 114 constraints, problems are : Problem set: 1 solved, 1 unsolved in 67 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 153ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 738 steps, including 333 resets, run visited all 1 properties in 3 ms. (steps per millisecond=246 )
Parikh walk visited 1 properties in 8 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[9]
Ending property specific reduction for DBSingleClientW-PT-d1m07-UpperBounds-11 in 16933 ms.
[2024-05-21 11:51:53] [INFO ] Flatten gal took : 33 ms
[2024-05-21 11:51:53] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2024-05-21 11:51:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 85 places, 109 transitions and 429 arcs took 4 ms.
Total runtime 71502 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d1m07

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/407/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 85
TRANSITIONS: 109
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.003s]


SAVING FILE /home/mcc/execution/407/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 809
MODEL NAME: /home/mcc/execution/407/model
85 places, 109 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-11 3 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716292314976

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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