About the Execution of LTSMin+red for DBSingleClientW-PT-d1m10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 561.067 | 57763.00 | 83219.00 | 195.80 | 1 0 ? 0 0 ? 1 0 0 0 0 0 0 0 0 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r480-tall-171624189500541.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-d1m10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189500541
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 948K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717190025890
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-d1m10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:13:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 21:13:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:13:47] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-05-31 21:13:47] [INFO ] Transformed 1440 places.
[2024-05-31 21:13:47] [INFO ] Transformed 672 transitions.
[2024-05-31 21:13:47] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 259 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 672 rows 347 cols
[2024-05-31 21:13:47] [INFO ] Computed 6 invariants in 39 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[10, 1741, 10, 1741]
RANDOM walk for 10000 steps (2231 resets) in 154 ms. (64 steps per ms)
BEST_FIRST walk for 40003 steps (3804 resets) in 183 ms. (217 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1] Max Struct:[10, 1741, 10, 1741]
[2024-05-31 21:13:47] [INFO ] Invariant cache hit.
[2024-05-31 21:13:48] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2024-05-31 21:13:48] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:13:48] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2024-05-31 21:13:48] [INFO ] State equation strengthened by 418 read => feed constraints.
[2024-05-31 21:13:48] [INFO ] [Real]Added 418 Read/Feed constraints in 152 ms returned sat
[2024-05-31 21:13:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:13:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 21:13:48] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:13:48] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-31 21:13:49] [INFO ] [Nat]Added 418 Read/Feed constraints in 84 ms returned sat
[2024-05-31 21:13:49] [INFO ] Deduced a trap composed of 180 places in 192 ms of which 40 ms to minimize.
[2024-05-31 21:13:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2024-05-31 21:13:49] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 138 ms.
[2024-05-31 21:13:49] [INFO ] Deduced a trap composed of 110 places in 153 ms of which 3 ms to minimize.
[2024-05-31 21:13:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2024-05-31 21:13:49] [INFO ] Added : 7 causal constraints over 2 iterations in 516 ms. Result :sat
Minimization took 506 ms.
[2024-05-31 21:13:50] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:13:50] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:13:50] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-31 21:13:50] [INFO ] [Real]Added 418 Read/Feed constraints in 72 ms returned sat
[2024-05-31 21:13:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:13:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:13:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:13:50] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-31 21:13:51] [INFO ] [Nat]Added 418 Read/Feed constraints in 94 ms returned sat
[2024-05-31 21:13:51] [INFO ] Deduced a trap composed of 103 places in 161 ms of which 3 ms to minimize.
[2024-05-31 21:13:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2024-05-31 21:13:51] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 69 ms.
[2024-05-31 21:13:51] [INFO ] Added : 11 causal constraints over 3 iterations in 243 ms. Result :sat
Minimization took 506 ms.
[2024-05-31 21:13:52] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:13:52] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:13:52] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-31 21:13:52] [INFO ] [Real]Added 418 Read/Feed constraints in 98 ms returned sat
[2024-05-31 21:13:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:13:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:13:52] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:13:52] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-31 21:13:52] [INFO ] [Nat]Added 418 Read/Feed constraints in 77 ms returned sat
[2024-05-31 21:13:52] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 63 ms.
[2024-05-31 21:13:52] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 3 ms to minimize.
[2024-05-31 21:13:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2024-05-31 21:13:53] [INFO ] Added : 10 causal constraints over 3 iterations in 455 ms. Result :sat
Minimization took 501 ms.
[2024-05-31 21:13:53] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:13:53] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1] Max Struct:[10, 1741, 10, 1]
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[10, 1741, 10]
Support contains 3 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 326 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.5 ms
Discarding 21 places :
Also discarding 0 output transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 326 transition count 592
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 175 place count 232 transition count 338
Iterating global reduction 1 with 94 rules applied. Total rules applied 269 place count 232 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 272 place count 232 transition count 335
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 345 place count 159 transition count 262
Iterating global reduction 2 with 73 rules applied. Total rules applied 418 place count 159 transition count 262
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 423 place count 159 transition count 257
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 464 place count 118 transition count 191
Iterating global reduction 3 with 41 rules applied. Total rules applied 505 place count 118 transition count 191
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 528 place count 118 transition count 168
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 539 place count 107 transition count 149
Iterating global reduction 4 with 11 rules applied. Total rules applied 550 place count 107 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 551 place count 107 transition count 148
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 560 place count 98 transition count 139
Iterating global reduction 5 with 9 rules applied. Total rules applied 569 place count 98 transition count 139
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 572 place count 98 transition count 136
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 579 place count 91 transition count 129
Iterating global reduction 6 with 7 rules applied. Total rules applied 586 place count 91 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 589 place count 91 transition count 126
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 590 place count 90 transition count 124
Iterating global reduction 7 with 1 rules applied. Total rules applied 591 place count 90 transition count 124
Applied a total of 591 rules in 108 ms. Remains 90 /347 variables (removed 257) and now considering 124/672 (removed 548) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 90/347 places, 124/672 transitions.
// Phase 1: matrix 124 rows 90 cols
[2024-05-31 21:13:53] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[10, 1741, 10]
RANDOM walk for 1000000 steps (229758 resets) in 2197 ms. (454 steps per ms)
BEST_FIRST walk for 3000001 steps (295938 resets) in 3017 ms. (994 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0] Max Struct:[10, 1741, 10]
[2024-05-31 21:13:59] [INFO ] Invariant cache hit.
[2024-05-31 21:13:59] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 21:13:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 21:13:59] [INFO ] [Real]Absence check using state equation in 37 ms returned unsat
[2024-05-31 21:13:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 21:13:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:13:59] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 21:13:59] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-31 21:13:59] [INFO ] [Real]Added 49 Read/Feed constraints in 7 ms returned sat
[2024-05-31 21:13:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:13:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 21:13:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:13:59] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 21:13:59] [INFO ] [Nat]Added 49 Read/Feed constraints in 9 ms returned sat
[2024-05-31 21:13:59] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:13:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-31 21:13:59] [INFO ] Computed and/alt/rep : 34/77/34 causal constraints (skipped 89 transitions) in 7 ms.
[2024-05-31 21:13:59] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:13:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-31 21:13:59] [INFO ] Added : 10 causal constraints over 3 iterations in 104 ms. Result :sat
Minimization took 31 ms.
[2024-05-31 21:13:59] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 21:13:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:13:59] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 21:13:59] [INFO ] [Real]Added 49 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:13:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:13:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 21:13:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:13:59] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 21:13:59] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-31 21:13:59] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-31 21:13:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-31 21:13:59] [INFO ] Computed and/alt/rep : 34/77/34 causal constraints (skipped 89 transitions) in 8 ms.
[2024-05-31 21:13:59] [INFO ] Added : 10 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0] Max Struct:[1, 1741, 10]
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1741, 10]
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 124/124 transitions.
Graph (complete) has 286 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 89 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 88 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 88 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 88 transition count 118
Applied a total of 8 rules in 10 ms. Remains 88 /90 variables (removed 2) and now considering 118/124 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 88/90 places, 118/124 transitions.
// Phase 1: matrix 118 rows 88 cols
[2024-05-31 21:13:59] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1741, 10]
RANDOM walk for 1000000 steps (229858 resets) in 2101 ms. (475 steps per ms)
BEST_FIRST walk for 2000001 steps (196870 resets) in 1883 ms. (1061 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1741, 10]
[2024-05-31 21:14:03] [INFO ] Invariant cache hit.
[2024-05-31 21:14:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:14:03] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-31 21:14:03] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 21:14:03] [INFO ] [Real]Added 43 Read/Feed constraints in 6 ms returned sat
[2024-05-31 21:14:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:14:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:14:03] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 21:14:03] [INFO ] [Nat]Added 43 Read/Feed constraints in 9 ms returned sat
[2024-05-31 21:14:03] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 87 transitions) in 7 ms.
[2024-05-31 21:14:04] [INFO ] Added : 9 causal constraints over 2 iterations in 34 ms. Result :sat
Minimization took 33 ms.
[2024-05-31 21:14:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:14:04] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-31 21:14:04] [INFO ] [Real]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:14:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:14:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:14:04] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-31 21:14:04] [INFO ] [Nat]Added 43 Read/Feed constraints in 8 ms returned sat
[2024-05-31 21:14:04] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 87 transitions) in 9 ms.
[2024-05-31 21:14:04] [INFO ] Added : 10 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1741, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1741, 10]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 118/118 transitions.
Applied a total of 0 rules in 13 ms. Remains 88 /88 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 88/88 places, 118/118 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 118/118 transitions.
Applied a total of 0 rules in 6 ms. Remains 88 /88 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-31 21:14:04] [INFO ] Invariant cache hit.
[2024-05-31 21:14:04] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 21:14:04] [INFO ] Invariant cache hit.
[2024-05-31 21:14:04] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 21:14:04] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-31 21:14:04] [INFO ] Redundant transitions in 2 ms returned []
Running 117 sub problems to find dead transitions.
[2024-05-31 21:14:04] [INFO ] Invariant cache hit.
[2024-05-31 21:14:04] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/206 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 43/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/206 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 133 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2482 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/206 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 43/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 117/250 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 250 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4665 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 7339ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 7351ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7596 ms. Remains : 88/88 places, 118/118 transitions.
RANDOM walk for 40000 steps (9231 resets) in 1321 ms. (30 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3890 resets) in 492 ms. (81 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3893 resets) in 222 ms. (179 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3922 resets) in 187 ms. (212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3975 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 903817 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :2 out of 4
Probabilistic random walk after 903817 steps, saw 333471 distinct states, run finished after 3005 ms. (steps per millisecond=300 ) properties seen :2
[2024-05-31 21:14:15] [INFO ] Invariant cache hit.
[2024-05-31 21:14:15] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 93/104 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/155 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 34/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 7/162 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 12 (OVERLAPS) 44/206 variables, 36/106 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 27/133 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 21:14:15] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
Problem MAX1 is UNSAT
After SMT solving in domain Real declared 206/206 variables, and 134 constraints, problems are : Problem set: 2 solved, 0 unsolved in 178 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 184ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[1741, 10]
Starting property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-02
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:[1741]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1741]
[2024-05-31 21:14:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1741]
RANDOM walk for 10000 steps (2314 resets) in 28 ms. (344 steps per ms)
BEST_FIRST walk for 10001 steps (961 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1741]
[2024-05-31 21:14:16] [INFO ] Invariant cache hit.
[2024-05-31 21:14:16] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:14:16] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 21:14:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 21:14:16] [INFO ] [Real]Added 43 Read/Feed constraints in 6 ms returned sat
[2024-05-31 21:14:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:14:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:14:16] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-31 21:14:16] [INFO ] [Nat]Added 43 Read/Feed constraints in 6 ms returned sat
[2024-05-31 21:14:16] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 87 transitions) in 5 ms.
[2024-05-31 21:14:16] [INFO ] Added : 9 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1741]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1741]
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 118/118 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 86 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 86 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 86 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 85 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 85 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 84 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 84 transition count 109
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 84 transition count 108
Applied a total of 10 rules in 18 ms. Remains 84 /88 variables (removed 4) and now considering 108/118 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 84/88 places, 108/118 transitions.
// Phase 1: matrix 108 rows 84 cols
[2024-05-31 21:14:16] [INFO ] Computed 2 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1741]
RANDOM walk for 1000000 steps (229847 resets) in 1884 ms. (530 steps per ms)
BEST_FIRST walk for 1000000 steps (98766 resets) in 859 ms. (1162 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1741]
[2024-05-31 21:14:19] [INFO ] Invariant cache hit.
[2024-05-31 21:14:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-31 21:14:19] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 21:14:19] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:14:19] [INFO ] [Real]Added 36 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:14:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:14:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:14:19] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-31 21:14:19] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:14:19] [INFO ] Computed and/alt/rep : 29/65/29 causal constraints (skipped 78 transitions) in 8 ms.
[2024-05-31 21:14:19] [INFO ] Added : 9 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1741]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1741]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 84/84 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-31 21:14:19] [INFO ] Invariant cache hit.
[2024-05-31 21:14:19] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 21:14:19] [INFO ] Invariant cache hit.
[2024-05-31 21:14:19] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:14:19] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-05-31 21:14:19] [INFO ] Redundant transitions in 2 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-31 21:14:19] [INFO ] Invariant cache hit.
[2024-05-31 21:14:19] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/192 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 122 constraints, problems are : Problem set: 0 solved, 107 unsolved in 1846 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/192 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 107/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 229 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4457 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 6413ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 6414ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6622 ms. Remains : 84/84 places, 108/108 transitions.
RANDOM walk for 40000 steps (9218 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3901 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4006 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2171611 steps, run timeout after 3001 ms. (steps per millisecond=723 ) properties seen :1 out of 2
Probabilistic random walk after 2171611 steps, saw 854274 distinct states, run finished after 3001 ms. (steps per millisecond=723 ) properties seen :1
[2024-05-31 21:14:28] [INFO ] Invariant cache hit.
[2024-05-31 21:14:28] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/85 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 49/134 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/141 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 192/192 variables, and 93 constraints, problems are : Problem set: 1 solved, 0 unsolved in 79 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 7/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1741]
Ending property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-02 in 13074 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 118 rows 88 cols
[2024-05-31 21:14:29] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (2269 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (999 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2024-05-31 21:14:29] [INFO ] Invariant cache hit.
[2024-05-31 21:14:29] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:14:29] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 21:14:29] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 21:14:29] [INFO ] [Real]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:14:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:14:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:14:29] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 21:14:29] [INFO ] [Nat]Added 43 Read/Feed constraints in 8 ms returned sat
[2024-05-31 21:14:29] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 87 transitions) in 10 ms.
[2024-05-31 21:14:29] [INFO ] Added : 10 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[10]
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 118/118 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 87 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 86 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 86 transition count 109
Applied a total of 5 rules in 10 ms. Remains 86 /88 variables (removed 2) and now considering 109/118 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 86/88 places, 109/118 transitions.
// Phase 1: matrix 109 rows 86 cols
[2024-05-31 21:14:29] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 1000000 steps (229715 resets) in 2060 ms. (485 steps per ms)
BEST_FIRST walk for 1000001 steps (98521 resets) in 901 ms. (1108 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2024-05-31 21:14:32] [INFO ] Invariant cache hit.
[2024-05-31 21:14:32] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:14:32] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-31 21:14:32] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:14:32] [INFO ] [Real]Added 36 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:14:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:14:32] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:14:32] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-31 21:14:32] [INFO ] [Nat]Added 36 Read/Feed constraints in 8 ms returned sat
[2024-05-31 21:14:32] [INFO ] Computed and/alt/rep : 30/65/30 causal constraints (skipped 78 transitions) in 8 ms.
[2024-05-31 21:14:32] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-31 21:14:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-31 21:14:32] [INFO ] Added : 17 causal constraints over 5 iterations in 127 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[10]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 86/86 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-31 21:14:32] [INFO ] Invariant cache hit.
[2024-05-31 21:14:32] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 21:14:32] [INFO ] Invariant cache hit.
[2024-05-31 21:14:32] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:14:32] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-05-31 21:14:32] [INFO ] Redundant transitions in 3 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-31 21:14:32] [INFO ] Invariant cache hit.
[2024-05-31 21:14:32] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/195 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 36/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 124 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2222 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/195 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 36/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 108/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 232 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4718 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 7034ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 7035ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7249 ms. Remains : 86/86 places, 109/109 transitions.
RANDOM walk for 40000 steps (9185 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3954 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3916 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2166891 steps, run timeout after 3001 ms. (steps per millisecond=722 ) properties seen :1 out of 2
Probabilistic random walk after 2166891 steps, saw 857938 distinct states, run finished after 3001 ms. (steps per millisecond=722 ) properties seen :1
[2024-05-31 21:14:43] [INFO ] Invariant cache hit.
[2024-05-31 21:14:43] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/90 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/192 variables, 75/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 27/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:14:43] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 192/195 variables, and 120 constraints, problems are : Problem set: 1 solved, 0 unsolved in 122 ms.
Refiners :[Generalized P Invariants (flows): 0/2 constraints, State Equation: 83/86 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 126ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[10]
Ending property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-05 in 14165 ms.
[2024-05-31 21:14:43] [INFO ] Flatten gal took : 36 ms
[2024-05-31 21:14:43] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-31 21:14:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 88 places, 118 transitions and 464 arcs took 4 ms.
Total runtime 56220 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : DBSingleClientW-PT-d1m10-UpperBounds-02
Could not compute solution for formula : DBSingleClientW-PT-d1m10-UpperBounds-05
BK_STOP 1717190083653
--------------------
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-d1m10-UpperBounds-02
ub formula formula --maxsum=/tmp/684/ub_0_
ub formula name DBSingleClientW-PT-d1m10-UpperBounds-05
ub formula formula --maxsum=/tmp/684/ub_1_
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-d1m10"
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-d1m10, 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-171624189500541"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m10.tgz
mv DBSingleClientW-PT-d1m10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;