Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 12:51 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 1.6M May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717191310752

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:35:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 21:35:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:35:12] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2024-05-31 21:35:12] [INFO ] Transformed 4763 places.
[2024-05-31 21:35:12] [INFO ] Transformed 2478 transitions.
[2024-05-31 21:35:12] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 350 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Deduced a syphon composed of 3580 places in 34 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-31 21:35:12] [INFO ] Computed 6 invariants in 272 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[9, 3032, 7, 7, 7, 7, 3032]
RANDOM walk for 10000 steps (2305 resets) in 384 ms. (25 steps per ms)
BEST_FIRST walk for 70004 steps (6638 resets) in 456 ms. (153 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1, 0, 1, 0] Max Struct:[9, 3032, 7, 7, 7, 7, 3032]
[2024-05-31 21:35:13] [INFO ] Invariant cache hit.
[2024-05-31 21:35:14] [INFO ] [Real]Absence check using 2 positive place invariants in 41 ms returned sat
[2024-05-31 21:35:14] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-31 21:35:15] [INFO ] [Real]Absence check using state equation in 787 ms returned sat
[2024-05-31 21:35:15] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2024-05-31 21:35:16] [INFO ] [Real]Added 1588 Read/Feed constraints in 876 ms returned sat
[2024-05-31 21:35:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:35:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2024-05-31 21:35:16] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-31 21:35:17] [INFO ] [Nat]Absence check using state equation in 740 ms returned sat
[2024-05-31 21:35:18] [INFO ] [Nat]Added 1588 Read/Feed constraints in 948 ms returned sat
[2024-05-31 21:35:19] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 732 ms.
[2024-05-31 21:35:20] [INFO ] Added : 15 causal constraints over 3 iterations in 1921 ms. Result :sat
Minimization took 656 ms.
[2024-05-31 21:35:21] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-31 21:35:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-31 21:35:21] [INFO ] [Real]Absence check using state equation in 632 ms returned sat
[2024-05-31 21:35:22] [INFO ] [Real]Added 1588 Read/Feed constraints in 753 ms returned sat
[2024-05-31 21:35:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:35:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-31 21:35:22] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:35:23] [INFO ] [Nat]Absence check using state equation in 702 ms returned sat
[2024-05-31 21:35:24] [INFO ] [Nat]Added 1588 Read/Feed constraints in 866 ms returned sat
[2024-05-31 21:35:25] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 678 ms.
[2024-05-31 21:35:25] [INFO ] Added : 13 causal constraints over 3 iterations in 1261 ms. Result :sat
Minimization took 731 ms.
[2024-05-31 21:35:26] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-31 21:35:26] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-31 21:35:27] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2024-05-31 21:35:28] [INFO ] [Real]Added 1588 Read/Feed constraints in 710 ms returned sat
[2024-05-31 21:35:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:35:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-31 21:35:28] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-31 21:35:28] [INFO ] [Nat]Absence check using state equation in 639 ms returned sat
[2024-05-31 21:35:29] [INFO ] [Nat]Added 1588 Read/Feed constraints in 601 ms returned sat
[2024-05-31 21:35:30] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 459 ms.
[2024-05-31 21:35:30] [INFO ] Added : 2 causal constraints over 1 iterations in 730 ms. Result :sat
Minimization took 649 ms.
[2024-05-31 21:35:31] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-31 21:35:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned unsat
[2024-05-31 21:35:31] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-31 21:35:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2024-05-31 21:35:32] [INFO ] [Real]Absence check using state equation in 761 ms returned sat
[2024-05-31 21:35:32] [INFO ] [Real]Added 1588 Read/Feed constraints in 743 ms returned sat
[2024-05-31 21:35:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:35:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-31 21:35:33] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2024-05-31 21:35:33] [INFO ] [Nat]Absence check using state equation in 641 ms returned sat
[2024-05-31 21:35:34] [INFO ] [Nat]Added 1588 Read/Feed constraints in 891 ms returned sat
[2024-05-31 21:35:35] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 378 ms.
[2024-05-31 21:35:36] [INFO ] Deduced a trap composed of 51 places in 1009 ms of which 127 ms to minimize.
[2024-05-31 21:35:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1268 ms
[2024-05-31 21:35:37] [INFO ] Added : 14 causal constraints over 3 iterations in 2445 ms. Result :sat
Minimization took 643 ms.
[2024-05-31 21:35:38] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-31 21:35:38] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned unsat
[2024-05-31 21:35:38] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-31 21:35:38] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 22 ms returned sat
[2024-05-31 21:35:38] [INFO ] [Real]Absence check using state equation in 715 ms returned sat
[2024-05-31 21:35:39] [INFO ] [Real]Added 1588 Read/Feed constraints in 828 ms returned sat
[2024-05-31 21:35:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:35:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-31 21:35:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-31 21:35:40] [INFO ] [Nat]Absence check using state equation in 694 ms returned sat
[2024-05-31 21:35:41] [INFO ] [Nat]Added 1588 Read/Feed constraints in 873 ms returned sat
[2024-05-31 21:35:42] [INFO ] Deduced a trap composed of 204 places in 771 ms of which 10 ms to minimize.
[2024-05-31 21:35:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 917 ms
[2024-05-31 21:35:42] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 373 ms.
[2024-05-31 21:35:44] [INFO ] Deduced a trap composed of 208 places in 762 ms of which 8 ms to minimize.
[2024-05-31 21:35:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 943 ms
[2024-05-31 21:35:44] [INFO ] Added : 13 causal constraints over 4 iterations in 2090 ms. Result :sat
Minimization took 251 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1, 0, 1, 0] Max Struct:[9, 3032, 7, 1, 7, 1, 3032]
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[9, 3032, 7, 7, 3032]
Support contains 5 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1137 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.8 ms
Discarding 46 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 214 transitions.
Iterating post reduction 0 with 214 rules applied. Total rules applied 215 place count 1137 transition count 2264
Discarding 389 places :
Symmetric choice reduction at 1 with 389 rule applications. Total rules 604 place count 748 transition count 1204
Iterating global reduction 1 with 389 rules applied. Total rules applied 993 place count 748 transition count 1204
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1002 place count 748 transition count 1195
Discarding 314 places :
Symmetric choice reduction at 2 with 314 rule applications. Total rules 1316 place count 434 transition count 881
Iterating global reduction 2 with 314 rules applied. Total rules applied 1630 place count 434 transition count 881
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1642 place count 434 transition count 869
Discarding 238 places :
Symmetric choice reduction at 3 with 238 rule applications. Total rules 1880 place count 196 transition count 534
Iterating global reduction 3 with 238 rules applied. Total rules applied 2118 place count 196 transition count 534
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 210 transitions.
Iterating post reduction 3 with 210 rules applied. Total rules applied 2328 place count 196 transition count 324
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2352 place count 172 transition count 285
Iterating global reduction 4 with 24 rules applied. Total rules applied 2376 place count 172 transition count 285
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2382 place count 172 transition count 279
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 2398 place count 156 transition count 263
Iterating global reduction 5 with 16 rules applied. Total rules applied 2414 place count 156 transition count 263
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2417 place count 156 transition count 260
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2431 place count 142 transition count 246
Iterating global reduction 6 with 14 rules applied. Total rules applied 2445 place count 142 transition count 246
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2458 place count 142 transition count 233
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2462 place count 138 transition count 217
Iterating global reduction 7 with 4 rules applied. Total rules applied 2466 place count 138 transition count 217
Applied a total of 2466 rules in 252 ms. Remains 138 /1183 variables (removed 1045) and now considering 217/2478 (removed 2261) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 138/1183 places, 217/2478 transitions.
// Phase 1: matrix 217 rows 138 cols
[2024-05-31 21:35:45] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[9, 3032, 7, 7, 3032]
RANDOM walk for 1000000 steps (229326 resets) in 2520 ms. (396 steps per ms)
BEST_FIRST walk for 5000003 steps (476549 resets) in 5609 ms. (891 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[9, 3032, 7, 7, 3032]
[2024-05-31 21:35:53] [INFO ] Invariant cache hit.
[2024-05-31 21:35:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:35:53] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-31 21:35:53] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-31 21:35:53] [INFO ] [Real]Added 84 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:35:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:35:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:35:53] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-31 21:35:53] [INFO ] [Nat]Added 84 Read/Feed constraints in 17 ms returned sat
[2024-05-31 21:35:53] [INFO ] Computed and/alt/rep : 53/135/53 causal constraints (skipped 163 transitions) in 16 ms.
[2024-05-31 21:35:53] [INFO ] Added : 12 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 142 ms.
[2024-05-31 21:35:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:35:53] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-31 21:35:53] [INFO ] [Real]Added 84 Read/Feed constraints in 13 ms returned sat
[2024-05-31 21:35:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:35:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:35:54] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-31 21:35:54] [INFO ] [Nat]Added 84 Read/Feed constraints in 16 ms returned sat
[2024-05-31 21:35:54] [INFO ] Computed and/alt/rep : 53/135/53 causal constraints (skipped 163 transitions) in 16 ms.
[2024-05-31 21:35:54] [INFO ] Added : 12 causal constraints over 3 iterations in 74 ms. Result :sat
Minimization took 125 ms.
[2024-05-31 21:35:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:35:54] [INFO ] [Real]Absence check using state equation in 33 ms returned unsat
[2024-05-31 21:35:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:35:54] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-31 21:35:54] [INFO ] [Real]Added 84 Read/Feed constraints in 24 ms returned sat
[2024-05-31 21:35:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:35:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:35:54] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-31 21:35:54] [INFO ] [Nat]Added 84 Read/Feed constraints in 21 ms returned sat
[2024-05-31 21:35:54] [INFO ] Computed and/alt/rep : 53/135/53 causal constraints (skipped 163 transitions) in 14 ms.
[2024-05-31 21:35:54] [INFO ] Added : 14 causal constraints over 4 iterations in 98 ms. Result :sat
Minimization took 129 ms.
[2024-05-31 21:35:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:35:54] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-31 21:35:54] [INFO ] [Real]Added 84 Read/Feed constraints in 16 ms returned sat
[2024-05-31 21:35:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:35:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:35:55] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-31 21:35:55] [INFO ] [Nat]Added 84 Read/Feed constraints in 24 ms returned sat
[2024-05-31 21:35:55] [INFO ] Computed and/alt/rep : 53/135/53 causal constraints (skipped 163 transitions) in 19 ms.
[2024-05-31 21:35:55] [INFO ] Added : 15 causal constraints over 4 iterations in 100 ms. Result :sat
Minimization took 120 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[9, 3032, 1, 7, 3032]
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[9, 3032, 7, 3032]
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 137 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 137 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 136 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 136 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 135 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 135 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 134 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 134 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 134 transition count 208
Applied a total of 9 rules in 31 ms. Remains 134 /138 variables (removed 4) and now considering 208/217 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 134/138 places, 208/217 transitions.
// Phase 1: matrix 208 rows 134 cols
[2024-05-31 21:35:55] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[9, 3032, 7, 3032]
RANDOM walk for 1000000 steps (229334 resets) in 2501 ms. (399 steps per ms)
BEST_FIRST walk for 4000002 steps (383184 resets) in 4500 ms. (888 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[9, 3032, 7, 3032]
[2024-05-31 21:36:02] [INFO ] Invariant cache hit.
[2024-05-31 21:36:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:36:02] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-31 21:36:02] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-31 21:36:02] [INFO ] [Real]Added 83 Read/Feed constraints in 21 ms returned sat
[2024-05-31 21:36:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:36:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:36:02] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-31 21:36:02] [INFO ] [Nat]Added 83 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:36:02] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 156 transitions) in 15 ms.
[2024-05-31 21:36:02] [INFO ] Added : 13 causal constraints over 3 iterations in 75 ms. Result :sat
Minimization took 147 ms.
[2024-05-31 21:36:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:36:03] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-31 21:36:03] [INFO ] [Real]Added 83 Read/Feed constraints in 11 ms returned sat
[2024-05-31 21:36:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:36:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:36:03] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-31 21:36:03] [INFO ] [Nat]Added 83 Read/Feed constraints in 16 ms returned sat
[2024-05-31 21:36:03] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 156 transitions) in 16 ms.
[2024-05-31 21:36:03] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-31 21:36:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-05-31 21:36:03] [INFO ] Added : 9 causal constraints over 2 iterations in 153 ms. Result :sat
Minimization took 143 ms.
[2024-05-31 21:36:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:36:03] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-31 21:36:03] [INFO ] [Real]Added 83 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:36:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:36:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:36:03] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-31 21:36:03] [INFO ] [Nat]Added 83 Read/Feed constraints in 18 ms returned sat
[2024-05-31 21:36:03] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 156 transitions) in 14 ms.
[2024-05-31 21:36:03] [INFO ] Added : 13 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 144 ms.
[2024-05-31 21:36:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:36:04] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-31 21:36:04] [INFO ] [Real]Added 83 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:36:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:36:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:36:04] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-31 21:36:04] [INFO ] [Nat]Added 83 Read/Feed constraints in 18 ms returned sat
[2024-05-31 21:36:04] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 156 transitions) in 17 ms.
[2024-05-31 21:36:04] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-31 21:36:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2024-05-31 21:36:04] [INFO ] Added : 12 causal constraints over 3 iterations in 185 ms. Result :sat
Minimization took 152 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[9, 3032, 7, 3032]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[9, 3032, 7, 3032]
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 208/208 transitions.
Applied a total of 0 rules in 8 ms. Remains 134 /134 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 134/134 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 208/208 transitions.
Applied a total of 0 rules in 8 ms. Remains 134 /134 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-31 21:36:04] [INFO ] Invariant cache hit.
[2024-05-31 21:36:05] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-31 21:36:05] [INFO ] Invariant cache hit.
[2024-05-31 21:36:05] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-31 21:36:05] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2024-05-31 21:36:05] [INFO ] Redundant transitions in 6 ms returned []
Running 207 sub problems to find dead transitions.
[2024-05-31 21:36:05] [INFO ] Invariant cache hit.
[2024-05-31 21:36:05] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/341 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 83/218 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (OVERLAPS) 1/342 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 9 (OVERLAPS) 0/342 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 219 constraints, problems are : Problem set: 0 solved, 207 unsolved in 12371 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/341 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 83/218 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 191/409 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (OVERLAPS) 1/342 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 16/426 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 11 (OVERLAPS) 0/342 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 426 constraints, problems are : Problem set: 0 solved, 207 unsolved in 24479 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints]
After SMT, in 37287ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 37301ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37932 ms. Remains : 134/134 places, 208/208 transitions.
RANDOM walk for 40000 steps (9141 resets) in 2058 ms. (19 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3784 resets) in 589 ms. (67 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3773 resets) in 564 ms. (70 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3857 resets) in 355 ms. (112 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3853 resets) in 366 ms. (108 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (3889 resets) in 263 ms. (151 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3759 resets) in 253 ms. (157 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3872 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3775 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 889231 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :4 out of 8
Probabilistic random walk after 889231 steps, saw 355394 distinct states, run finished after 3005 ms. (steps per millisecond=295 ) properties seen :4
[2024-05-31 21:36:47] [INFO ] Invariant cache hit.
[2024-05-31 21:36:47] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 138/232 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
After SMT solving in domain Real declared 333/342 variables, and 131 constraints, problems are : Problem set: 4 solved, 0 unsolved in 160 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 129/134 constraints, ReadFeed: 0/83 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 186ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0, 0] Max Struct:[9, 3032, 7, 3032]
Starting property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[9]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[9]
[2024-05-31 21:36:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[9]
RANDOM walk for 10000 steps (2305 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (978 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[9]
[2024-05-31 21:36:47] [INFO ] Invariant cache hit.
[2024-05-31 21:36:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:36:47] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-31 21:36:47] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-31 21:36:47] [INFO ] [Real]Added 83 Read/Feed constraints in 14 ms returned sat
[2024-05-31 21:36:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:36:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:36:48] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-31 21:36:48] [INFO ] [Nat]Added 83 Read/Feed constraints in 14 ms returned sat
[2024-05-31 21:36:48] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 156 transitions) in 15 ms.
[2024-05-31 21:36:48] [INFO ] Added : 13 causal constraints over 3 iterations in 71 ms. Result :sat
Minimization took 137 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[9]
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 208/208 transitions.
Graph (complete) has 465 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 206
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 130 transition count 199
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 130 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 130 transition count 198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 128 transition count 188
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 128 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 128 transition count 187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 127 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 127 transition count 179
Applied a total of 17 rules in 16 ms. Remains 127 /134 variables (removed 7) and now considering 179/208 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 127/134 places, 179/208 transitions.
// Phase 1: matrix 179 rows 127 cols
[2024-05-31 21:36:48] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[9]
RANDOM walk for 1000000 steps (230181 resets) in 2242 ms. (445 steps per ms)
BEST_FIRST walk for 1000001 steps (95838 resets) in 1021 ms. (978 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[9]
[2024-05-31 21:36:51] [INFO ] Invariant cache hit.
[2024-05-31 21:36:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:36:51] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-31 21:36:51] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:36:51] [INFO ] [Real]Added 58 Read/Feed constraints in 11 ms returned sat
[2024-05-31 21:36:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:36:51] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:36:51] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-31 21:36:51] [INFO ] [Nat]Added 58 Read/Feed constraints in 13 ms returned sat
[2024-05-31 21:36:51] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 15 ms.
[2024-05-31 21:36:51] [INFO ] Added : 11 causal constraints over 3 iterations in 57 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[9]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 12 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 127/127 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 8 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-31 21:36:51] [INFO ] Invariant cache hit.
[2024-05-31 21:36:52] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-31 21:36:52] [INFO ] Invariant cache hit.
[2024-05-31 21:36:52] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:36:52] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-05-31 21:36:52] [INFO ] Redundant transitions in 13 ms returned []
Running 178 sub problems to find dead transitions.
[2024-05-31 21:36:52] [INFO ] Invariant cache hit.
[2024-05-31 21:36:52] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 187 constraints, problems are : Problem set: 0 solved, 178 unsolved in 4600 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 178/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 365 constraints, problems are : Problem set: 0 solved, 178 unsolved in 11572 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 16441ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 16443ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16843 ms. Remains : 127/127 places, 179/179 transitions.
RANDOM walk for 40000 steps (9183 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3911 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3853 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1669160 steps, run timeout after 3001 ms. (steps per millisecond=556 ) properties seen :1 out of 2
Probabilistic random walk after 1669160 steps, saw 699551 distinct states, run finished after 3001 ms. (steps per millisecond=556 ) properties seen :1
[2024-05-31 21:37:11] [INFO ] Invariant cache hit.
[2024-05-31 21:37:11] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 131/222 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 297/306 variables, and 124 constraints, problems are : Problem set: 1 solved, 0 unsolved in 97 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/127 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 103ms 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:[9]
Ending property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-00 in 24235 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[3032]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[3032]
// Phase 1: matrix 208 rows 134 cols
[2024-05-31 21:37:12] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3032]
RANDOM walk for 10000 steps (2301 resets) in 28 ms. (344 steps per ms)
BEST_FIRST walk for 10000 steps (989 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3032]
[2024-05-31 21:37:12] [INFO ] Invariant cache hit.
[2024-05-31 21:37:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:37:12] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-31 21:37:12] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-31 21:37:12] [INFO ] [Real]Added 83 Read/Feed constraints in 12 ms returned sat
[2024-05-31 21:37:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:37:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:37:12] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-31 21:37:12] [INFO ] [Nat]Added 83 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:37:12] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 156 transitions) in 17 ms.
[2024-05-31 21:37:12] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-31 21:37:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2024-05-31 21:37:12] [INFO ] Added : 9 causal constraints over 2 iterations in 152 ms. Result :sat
Minimization took 136 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3032]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3032]
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 208/208 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 131 transition count 205
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 131 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 131 transition count 204
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 129 transition count 201
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 129 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 129 transition count 200
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 127 transition count 191
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 127 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 127 transition count 190
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 126 transition count 183
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 126 transition count 183
Applied a total of 19 rules in 19 ms. Remains 126 /134 variables (removed 8) and now considering 183/208 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 126/134 places, 183/208 transitions.
// Phase 1: matrix 183 rows 126 cols
[2024-05-31 21:37:12] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3032]
RANDOM walk for 1000000 steps (229863 resets) in 2295 ms. (435 steps per ms)
BEST_FIRST walk for 1000000 steps (95702 resets) in 1027 ms. (972 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3032]
[2024-05-31 21:37:15] [INFO ] Invariant cache hit.
[2024-05-31 21:37:16] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:37:16] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-31 21:37:16] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-31 21:37:16] [INFO ] [Real]Added 64 Read/Feed constraints in 10 ms returned sat
[2024-05-31 21:37:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:37:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:37:16] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-31 21:37:16] [INFO ] [Nat]Added 64 Read/Feed constraints in 12 ms returned sat
[2024-05-31 21:37:16] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 133 transitions) in 12 ms.
[2024-05-31 21:37:16] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-31 21:37:16] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-31 21:37:16] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-31 21:37:16] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-31 21:37:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 354 ms
[2024-05-31 21:37:16] [INFO ] Added : 19 causal constraints over 5 iterations in 449 ms. Result :sat
Minimization took 104 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3032]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3032]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 183/183 transitions.
Applied a total of 0 rules in 6 ms. Remains 126 /126 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 126/126 places, 183/183 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 183/183 transitions.
Applied a total of 0 rules in 13 ms. Remains 126 /126 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2024-05-31 21:37:16] [INFO ] Invariant cache hit.
[2024-05-31 21:37:16] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-31 21:37:16] [INFO ] Invariant cache hit.
[2024-05-31 21:37:16] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-31 21:37:17] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2024-05-31 21:37:17] [INFO ] Redundant transitions in 3 ms returned []
Running 182 sub problems to find dead transitions.
[2024-05-31 21:37:17] [INFO ] Invariant cache hit.
[2024-05-31 21:37:17] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/308 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 64/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 1/309 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/309 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 192 constraints, problems are : Problem set: 0 solved, 182 unsolved in 8089 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/308 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 64/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 167/358 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 1/309 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 15/374 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (OVERLAPS) 0/309 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 374 constraints, problems are : Problem set: 0 solved, 182 unsolved in 19515 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
After SMT, in 27845ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 27848ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28274 ms. Remains : 126/126 places, 183/183 transitions.
RANDOM walk for 40000 steps (9252 resets) in 219 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3712 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3830 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1671150 steps, run timeout after 3001 ms. (steps per millisecond=556 ) properties seen :1 out of 2
Probabilistic random walk after 1671150 steps, saw 696850 distinct states, run finished after 3001 ms. (steps per millisecond=556 ) properties seen :1
[2024-05-31 21:37:48] [INFO ] Invariant cache hit.
[2024-05-31 21:37:48] [INFO ] State equation strengthened by 64 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) 18/21 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 144/165 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 69/234 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 50/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/249 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 11/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 309/309 variables, and 157 constraints, problems are : Problem set: 1 solved, 0 unsolved in 168 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 29/64 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 181ms 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:[3032]
Ending property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-01 in 36355 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 208 rows 134 cols
[2024-05-31 21:37:48] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2338 resets) in 28 ms. (344 steps per ms)
BEST_FIRST walk for 10001 steps (942 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-31 21:37:48] [INFO ] Invariant cache hit.
[2024-05-31 21:37:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-31 21:37:48] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-31 21:37:48] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-31 21:37:48] [INFO ] [Real]Added 83 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:37:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:37:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:37:48] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-31 21:37:48] [INFO ] [Nat]Added 83 Read/Feed constraints in 18 ms returned sat
[2024-05-31 21:37:48] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 156 transitions) in 14 ms.
[2024-05-31 21:37:48] [INFO ] Added : 13 causal constraints over 3 iterations in 88 ms. Result :sat
Minimization took 161 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 208/208 transitions.
Graph (complete) has 465 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 206
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 130 transition count 199
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 130 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 130 transition count 198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 128 transition count 189
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 128 transition count 189
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 127 transition count 188
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 127 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 127 transition count 187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 126 transition count 180
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 126 transition count 180
Applied a total of 19 rules in 15 ms. Remains 126 /134 variables (removed 8) and now considering 180/208 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 126/134 places, 180/208 transitions.
// Phase 1: matrix 180 rows 126 cols
[2024-05-31 21:37:49] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (230157 resets) in 2245 ms. (445 steps per ms)
BEST_FIRST walk for 1000000 steps (95446 resets) in 1008 ms. (991 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-31 21:37:52] [INFO ] Invariant cache hit.
[2024-05-31 21:37:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:37:52] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-31 21:37:52] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:37:52] [INFO ] [Real]Added 58 Read/Feed constraints in 19 ms returned sat
[2024-05-31 21:37:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:37:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:37:52] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-31 21:37:52] [INFO ] [Nat]Added 58 Read/Feed constraints in 23 ms returned sat
[2024-05-31 21:37:52] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 12 ms.
[2024-05-31 21:37:52] [INFO ] Added : 16 causal constraints over 4 iterations in 68 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 6 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 126/126 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 15 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-31 21:37:52] [INFO ] Invariant cache hit.
[2024-05-31 21:37:52] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-31 21:37:52] [INFO ] Invariant cache hit.
[2024-05-31 21:37:52] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:37:53] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-05-31 21:37:53] [INFO ] Redundant transitions in 0 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-31 21:37:53] [INFO ] Invariant cache hit.
[2024-05-31 21:37:53] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 186 constraints, problems are : Problem set: 0 solved, 179 unsolved in 6016 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 179/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 365 constraints, problems are : Problem set: 0 solved, 179 unsolved in 12511 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 18810ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 18812ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19220 ms. Remains : 126/126 places, 180/180 transitions.
RANDOM walk for 40000 steps (9146 resets) in 266 ms. (149 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3900 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3774 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1780250 steps, run timeout after 3001 ms. (steps per millisecond=593 ) properties seen :1 out of 2
Probabilistic random walk after 1780250 steps, saw 735907 distinct states, run finished after 3006 ms. (steps per millisecond=592 ) properties seen :1
[2024-05-31 21:38:15] [INFO ] Invariant cache hit.
[2024-05-31 21:38:15] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 131/221 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 297/306 variables, and 123 constraints, problems are : Problem set: 1 solved, 0 unsolved in 86 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 121/126 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-06 in 26906 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-14
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:[3032]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[3032]
// Phase 1: matrix 208 rows 134 cols
[2024-05-31 21:38:15] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3032]
RANDOM walk for 10000 steps (2297 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (907 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3032]
[2024-05-31 21:38:15] [INFO ] Invariant cache hit.
[2024-05-31 21:38:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:38:15] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-05-31 21:38:15] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-31 21:38:15] [INFO ] [Real]Added 83 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:38:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:38:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:38:15] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-31 21:38:15] [INFO ] [Nat]Added 83 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:38:15] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 156 transitions) in 14 ms.
[2024-05-31 21:38:15] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-05-31 21:38:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2024-05-31 21:38:15] [INFO ] Added : 12 causal constraints over 3 iterations in 176 ms. Result :sat
Minimization took 145 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3032]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3032]
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 208/208 transitions.
Graph (complete) has 465 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 206
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 130 transition count 199
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 130 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 128 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 128 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 128 transition count 195
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 126 transition count 186
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 126 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 126 transition count 185
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 125 transition count 178
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 125 transition count 178
Applied a total of 21 rules in 12 ms. Remains 125 /134 variables (removed 9) and now considering 178/208 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 125/134 places, 178/208 transitions.
// Phase 1: matrix 178 rows 125 cols
[2024-05-31 21:38:16] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3032]
RANDOM walk for 1000000 steps (230034 resets) in 2265 ms. (441 steps per ms)
BEST_FIRST walk for 1000000 steps (95531 resets) in 1019 ms. (980 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3032]
[2024-05-31 21:38:19] [INFO ] Invariant cache hit.
[2024-05-31 21:38:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:38:19] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-31 21:38:19] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:38:19] [INFO ] [Real]Added 58 Read/Feed constraints in 13 ms returned sat
[2024-05-31 21:38:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:38:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:38:19] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-31 21:38:19] [INFO ] [Nat]Added 58 Read/Feed constraints in 16 ms returned sat
[2024-05-31 21:38:19] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 128 transitions) in 12 ms.
[2024-05-31 21:38:19] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-31 21:38:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-31 21:38:19] [INFO ] Added : 11 causal constraints over 3 iterations in 152 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3032]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3032]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 125/125 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-31 21:38:19] [INFO ] Invariant cache hit.
[2024-05-31 21:38:19] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-31 21:38:19] [INFO ] Invariant cache hit.
[2024-05-31 21:38:20] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:38:20] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-05-31 21:38:20] [INFO ] Redundant transitions in 2 ms returned []
Running 177 sub problems to find dead transitions.
[2024-05-31 21:38:20] [INFO ] Invariant cache hit.
[2024-05-31 21:38:20] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 58/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 185 constraints, problems are : Problem set: 0 solved, 177 unsolved in 4898 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 58/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 177/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 362 constraints, problems are : Problem set: 0 solved, 177 unsolved in 13229 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 18348ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 18353ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18709 ms. Remains : 125/125 places, 178/178 transitions.
RANDOM walk for 40000 steps (9258 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3944 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3740 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1646215 steps, run timeout after 3001 ms. (steps per millisecond=548 ) properties seen :1 out of 2
Probabilistic random walk after 1646215 steps, saw 685407 distinct states, run finished after 3001 ms. (steps per millisecond=548 ) properties seen :1
[2024-05-31 21:38:41] [INFO ] Invariant cache hit.
[2024-05-31 21:38:41] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 131/134 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/206 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/221 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 303/303 variables, and 136 constraints, problems are : Problem set: 1 solved, 0 unsolved in 112 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 9/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 133ms 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:[3032]
Ending property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-14 in 26586 ms.
[2024-05-31 21:38:42] [INFO ] Flatten gal took : 47 ms
[2024-05-31 21:38:42] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-31 21:38:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 134 places, 208 transitions and 820 arcs took 5 ms.
Total runtime 209982 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DBSingleClientW-PT-d2m09-UpperBounds-00
Could not compute solution for formula : DBSingleClientW-PT-d2m09-UpperBounds-01
Could not compute solution for formula : DBSingleClientW-PT-d2m09-UpperBounds-06
Could not compute solution for formula : DBSingleClientW-PT-d2m09-UpperBounds-14

BK_STOP 1717191522411

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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