About the Execution of GreatSPN+red for DBSingleClientW-PT-d1m04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2220.220 | 203227.00 | 352033.00 | 583.80 | T | 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.r100-tall-171624200600307.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DBSingleClientW-PT-d1m04, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-tall-171624200600307
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K 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 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 booleans
BOOL_VECTOR
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1716364990125
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DBSingleClientW-PT-d1m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 08:03:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-22 08:03:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:03:11] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-05-22 08:03:11] [INFO ] Transformed 1440 places.
[2024-05-22 08:03:11] [INFO ] Transformed 672 transitions.
[2024-05-22 08:03:11] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 220 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1440/1440 places, 672/672 transitions.
Reduce places removed 1114 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 1194 rules applied. Total rules applied 1194 place count 326 transition count 592
Applied a total of 1194 rules in 37 ms. Remains 326 /1440 variables (removed 1114) and now considering 592/672 (removed 80) transitions.
// Phase 1: matrix 592 rows 326 cols
[2024-05-22 08:03:11] [INFO ] Computed 2 invariants in 22 ms
[2024-05-22 08:03:11] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-22 08:03:11] [INFO ] Invariant cache hit.
[2024-05-22 08:03:12] [INFO ] State equation strengthened by 338 read => feed constraints.
[2024-05-22 08:03:13] [INFO ] Implicit Places using invariants and state equation in 1347 ms returned []
Implicit Place search using SMT with State Equation took 1745 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-05-22 08:03:13] [INFO ] Invariant cache hit.
[2024-05-22 08:03:13] [INFO ] State equation strengthened by 338 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/326 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 4 (OVERLAPS) 592/918 variables, 326/328 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/918 variables, 338/666 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-22 08:03:40] [INFO ] Deduced a trap composed of 92 places in 170 ms of which 23 ms to minimize.
[2024-05-22 08:03:40] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/918 variables, 2/668 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 918/918 variables, and 668 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 326/326 constraints, ReadFeed: 338/338 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/326 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 5 (OVERLAPS) 592/918 variables, 326/330 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/918 variables, 338/668 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/918 variables, 591/1259 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 918/918 variables, and 1259 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 326/326 constraints, ReadFeed: 338/338 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 2/2 constraints]
After SMT, in 62079ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 62100ms
Starting structural reductions in LIVENESS mode, iteration 1 : 326/1440 places, 592/672 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 63919 ms. Remains : 326/1440 places, 592/672 transitions.
Discarding 275 transitions out of 592. Remains 317
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (9152 resets) in 3507 ms. (11 steps per ms) remains 256/316 properties
BEST_FIRST walk for 404 steps (16 resets) in 10 ms. (36 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (17 resets) in 10 ms. (36 steps per ms) remains 256/256 properties
BEST_FIRST walk for 404 steps (16 resets) in 11 ms. (33 steps per ms) remains 256/256 properties
BEST_FIRST walk for 404 steps (15 resets) in 9 ms. (40 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (18 resets) in 13 ms. (28 steps per ms) remains 256/256 properties
BEST_FIRST walk for 404 steps (17 resets) in 9 ms. (40 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (17 resets) in 8 ms. (44 steps per ms) remains 256/256 properties
BEST_FIRST walk for 404 steps (17 resets) in 14 ms. (26 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (23 resets) in 13 ms. (28 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (22 resets) in 8 ms. (44 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (21 resets) in 11 ms. (33 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (16 resets) in 13 ms. (28 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (17 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (16 resets) in 8 ms. (44 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (18 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 401 steps (16 resets) in 8 ms. (44 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (24 resets) in 11 ms. (33 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (16 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (19 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 401 steps (18 resets) in 6 ms. (57 steps per ms) remains 256/256 properties
BEST_FIRST walk for 404 steps (22 resets) in 9 ms. (40 steps per ms) remains 256/256 properties
BEST_FIRST walk for 404 steps (22 resets) in 9 ms. (40 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (23 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (23 resets) in 8 ms. (44 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (17 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 404 steps (18 resets) in 6 ms. (57 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (19 resets) in 9 ms. (40 steps per ms) remains 256/256 properties
BEST_FIRST walk for 404 steps (14 resets) in 6 ms. (57 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (20 resets) in 6 ms. (57 steps per ms) remains 256/256 properties
BEST_FIRST walk for 404 steps (21 resets) in 6 ms. (57 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (20 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (15 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (24 resets) in 9 ms. (40 steps per ms) remains 256/256 properties
BEST_FIRST walk for 401 steps (19 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (15 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 404 steps (16 resets) in 6 ms. (57 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (17 resets) in 6 ms. (57 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (17 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (14 resets) in 8 ms. (44 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (22 resets) in 9 ms. (40 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (13 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (17 resets) in 9 ms. (40 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (24 resets) in 8 ms. (44 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (17 resets) in 6 ms. (57 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (18 resets) in 9 ms. (40 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (17 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (17 resets) in 6 ms. (57 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (21 resets) in 9 ms. (40 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (15 resets) in 6 ms. (57 steps per ms) remains 256/256 properties
BEST_FIRST walk for 401 steps (25 resets) in 6 ms. (57 steps per ms) remains 256/256 properties
[2024-05-22 08:04:16] [INFO ] Invariant cache hit.
[2024-05-22 08:04:16] [INFO ] State equation strengthened by 338 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 20/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 26/312 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s136 0.0)
(s137 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 33.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s222 1.0)
(s224 1.0)
(s226 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s254 0.0)
(s255 0.0)
(s257 0.0)
(s258 0.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 312/918 variables, and 2 constraints, problems are : Problem set: 0 solved, 256 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/326 constraints, ReadFeed: 0/338 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 20/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 26/312 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 578/890 variables, 312/314 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/890 variables, 324/638 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 890/918 variables, and 694 constraints, problems are : Problem set: 0 solved, 256 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 312/326 constraints, ReadFeed: 324/338 constraints, PredecessorRefiner: 56/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 10746ms problems are : Problem set: 0 solved, 256 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 266 out of 326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 592/592 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 322 transition count 588
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 322 transition count 588
Applied a total of 8 rules in 74 ms. Remains 322 /326 variables (removed 4) and now considering 588/592 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 322/326 places, 588/592 transitions.
RANDOM walk for 4000000 steps (917875 resets) in 66151 ms. (60 steps per ms) remains 201/256 properties
BEST_FIRST walk for 40004 steps (1857 resets) in 201 ms. (198 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1849 resets) in 170 ms. (233 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1885 resets) in 172 ms. (231 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1841 resets) in 169 ms. (235 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1871 resets) in 169 ms. (235 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1923 resets) in 177 ms. (224 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1923 resets) in 172 ms. (231 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1904 resets) in 173 ms. (229 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1862 resets) in 167 ms. (238 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1851 resets) in 169 ms. (235 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1857 resets) in 168 ms. (236 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1899 resets) in 170 ms. (233 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1875 resets) in 166 ms. (239 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1915 resets) in 168 ms. (236 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1956 resets) in 174 ms. (228 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1886 resets) in 172 ms. (231 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1879 resets) in 171 ms. (232 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1896 resets) in 173 ms. (229 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40000 steps (1908 resets) in 171 ms. (232 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1909 resets) in 172 ms. (231 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1897 resets) in 173 ms. (229 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1912 resets) in 172 ms. (231 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1917 resets) in 173 ms. (229 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1910 resets) in 170 ms. (233 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1892 resets) in 172 ms. (231 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1868 resets) in 171 ms. (232 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1845 resets) in 166 ms. (239 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1880 resets) in 172 ms. (231 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1879 resets) in 177 ms. (224 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1883 resets) in 171 ms. (232 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40000 steps (1923 resets) in 171 ms. (232 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1894 resets) in 170 ms. (233 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1910 resets) in 168 ms. (236 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1914 resets) in 170 ms. (233 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40000 steps (1905 resets) in 168 ms. (236 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1899 resets) in 171 ms. (232 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1877 resets) in 173 ms. (229 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1885 resets) in 171 ms. (232 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1906 resets) in 168 ms. (236 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1905 resets) in 166 ms. (239 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1884 resets) in 168 ms. (236 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1868 resets) in 167 ms. (238 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1945 resets) in 171 ms. (232 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1884 resets) in 169 ms. (235 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1899 resets) in 173 ms. (229 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1910 resets) in 169 ms. (235 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1870 resets) in 164 ms. (242 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1897 resets) in 170 ms. (233 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1856 resets) in 169 ms. (235 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1896 resets) in 176 ms. (226 steps per ms) remains 201/201 properties
// Phase 1: matrix 588 rows 322 cols
[2024-05-22 08:04:47] [INFO ] Computed 2 invariants in 6 ms
[2024-05-22 08:04:47] [INFO ] State equation strengthened by 338 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 34/251 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 36/287 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 536/823 variables, 287/289 constraints. Problems are: Problem set: 0 solved, 201 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 286/575 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 87/910 variables, 35/610 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/910 variables, 52/662 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/910 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 0/910 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 910/910 variables, and 662 constraints, problems are : Problem set: 0 solved, 201 unsolved in 38478 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 322/322 constraints, ReadFeed: 338/338 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 34/251 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 36/287 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 536/823 variables, 287/289 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 286/575 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 33/608 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-22 08:05:33] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 2 ms to minimize.
[2024-05-22 08:05:33] [INFO ] Deduced a trap composed of 90 places in 74 ms of which 2 ms to minimize.
[2024-05-22 08:05:33] [INFO ] Deduced a trap composed of 87 places in 75 ms of which 1 ms to minimize.
[2024-05-22 08:05:33] [INFO ] Deduced a trap composed of 97 places in 77 ms of which 1 ms to minimize.
[2024-05-22 08:05:33] [INFO ] Deduced a trap composed of 95 places in 71 ms of which 1 ms to minimize.
[2024-05-22 08:05:33] [INFO ] Deduced a trap composed of 98 places in 76 ms of which 2 ms to minimize.
[2024-05-22 08:05:33] [INFO ] Deduced a trap composed of 94 places in 70 ms of which 2 ms to minimize.
[2024-05-22 08:05:34] [INFO ] Deduced a trap composed of 91 places in 65 ms of which 2 ms to minimize.
[2024-05-22 08:05:34] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 2 ms to minimize.
[2024-05-22 08:05:34] [INFO ] Deduced a trap composed of 92 places in 70 ms of which 2 ms to minimize.
[2024-05-22 08:05:34] [INFO ] Deduced a trap composed of 98 places in 76 ms of which 1 ms to minimize.
[2024-05-22 08:05:34] [INFO ] Deduced a trap composed of 102 places in 69 ms of which 1 ms to minimize.
[2024-05-22 08:05:34] [INFO ] Deduced a trap composed of 95 places in 74 ms of which 2 ms to minimize.
[2024-05-22 08:05:34] [INFO ] Deduced a trap composed of 104 places in 75 ms of which 2 ms to minimize.
[2024-05-22 08:05:34] [INFO ] Deduced a trap composed of 102 places in 71 ms of which 1 ms to minimize.
[2024-05-22 08:05:34] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 1 ms to minimize.
[2024-05-22 08:05:34] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 1 ms to minimize.
[2024-05-22 08:05:35] [INFO ] Deduced a trap composed of 101 places in 86 ms of which 2 ms to minimize.
[2024-05-22 08:05:35] [INFO ] Deduced a trap composed of 103 places in 78 ms of which 1 ms to minimize.
[2024-05-22 08:05:35] [INFO ] Deduced a trap composed of 88 places in 81 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 20/628 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-22 08:05:41] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2024-05-22 08:05:41] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-05-22 08:05:42] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-05-22 08:05:42] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 3 ms to minimize.
[2024-05-22 08:05:42] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-05-22 08:05:42] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
[2024-05-22 08:05:42] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-22 08:05:42] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-05-22 08:05:42] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-05-22 08:05:42] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
[2024-05-22 08:05:43] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 2 ms to minimize.
[2024-05-22 08:05:43] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
[2024-05-22 08:05:43] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-05-22 08:05:43] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-05-22 08:05:43] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-22 08:05:43] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2024-05-22 08:05:43] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-05-22 08:05:44] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-22 08:05:44] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 1 ms to minimize.
[2024-05-22 08:05:44] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 20/648 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-22 08:05:52] [INFO ] Deduced a trap composed of 98 places in 70 ms of which 2 ms to minimize.
[2024-05-22 08:05:52] [INFO ] Deduced a trap composed of 102 places in 63 ms of which 1 ms to minimize.
[2024-05-22 08:05:52] [INFO ] Deduced a trap composed of 95 places in 59 ms of which 1 ms to minimize.
[2024-05-22 08:05:53] [INFO ] Deduced a trap composed of 104 places in 72 ms of which 1 ms to minimize.
[2024-05-22 08:05:53] [INFO ] Deduced a trap composed of 102 places in 66 ms of which 2 ms to minimize.
[2024-05-22 08:05:53] [INFO ] Deduced a trap composed of 106 places in 66 ms of which 1 ms to minimize.
[2024-05-22 08:05:53] [INFO ] Deduced a trap composed of 110 places in 70 ms of which 1 ms to minimize.
[2024-05-22 08:05:53] [INFO ] Deduced a trap composed of 110 places in 65 ms of which 2 ms to minimize.
[2024-05-22 08:05:53] [INFO ] Deduced a trap composed of 106 places in 68 ms of which 1 ms to minimize.
[2024-05-22 08:05:53] [INFO ] Deduced a trap composed of 105 places in 66 ms of which 1 ms to minimize.
[2024-05-22 08:05:54] [INFO ] Deduced a trap composed of 109 places in 63 ms of which 2 ms to minimize.
[2024-05-22 08:05:54] [INFO ] Deduced a trap composed of 109 places in 72 ms of which 2 ms to minimize.
[2024-05-22 08:05:54] [INFO ] Deduced a trap composed of 94 places in 68 ms of which 1 ms to minimize.
[2024-05-22 08:05:54] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 2 ms to minimize.
[2024-05-22 08:05:54] [INFO ] Deduced a trap composed of 105 places in 66 ms of which 2 ms to minimize.
[2024-05-22 08:05:54] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 2 ms to minimize.
[2024-05-22 08:05:55] [INFO ] Deduced a trap composed of 96 places in 76 ms of which 1 ms to minimize.
[2024-05-22 08:05:55] [INFO ] Deduced a trap composed of 100 places in 88 ms of which 2 ms to minimize.
[2024-05-22 08:05:55] [INFO ] Deduced a trap composed of 104 places in 79 ms of which 1 ms to minimize.
[2024-05-22 08:05:55] [INFO ] Deduced a trap composed of 94 places in 79 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/823 variables, 20/668 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-22 08:06:04] [INFO ] Deduced a trap composed of 107 places in 78 ms of which 2 ms to minimize.
[2024-05-22 08:06:04] [INFO ] Deduced a trap composed of 102 places in 77 ms of which 2 ms to minimize.
[2024-05-22 08:06:04] [INFO ] Deduced a trap composed of 103 places in 74 ms of which 2 ms to minimize.
[2024-05-22 08:06:05] [INFO ] Deduced a trap composed of 101 places in 78 ms of which 2 ms to minimize.
[2024-05-22 08:06:05] [INFO ] Deduced a trap composed of 101 places in 77 ms of which 2 ms to minimize.
[2024-05-22 08:06:05] [INFO ] Deduced a trap composed of 97 places in 84 ms of which 2 ms to minimize.
[2024-05-22 08:06:05] [INFO ] Deduced a trap composed of 100 places in 77 ms of which 2 ms to minimize.
[2024-05-22 08:06:06] [INFO ] Deduced a trap composed of 101 places in 84 ms of which 4 ms to minimize.
[2024-05-22 08:06:06] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 2 ms to minimize.
[2024-05-22 08:06:06] [INFO ] Deduced a trap composed of 104 places in 85 ms of which 2 ms to minimize.
[2024-05-22 08:06:06] [INFO ] Deduced a trap composed of 104 places in 80 ms of which 1 ms to minimize.
[2024-05-22 08:06:06] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 1 ms to minimize.
[2024-05-22 08:06:06] [INFO ] Deduced a trap composed of 97 places in 77 ms of which 1 ms to minimize.
[2024-05-22 08:06:06] [INFO ] Deduced a trap composed of 97 places in 74 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/823 variables, 14/682 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 823/910 variables, and 682 constraints, problems are : Problem set: 0 solved, 201 unsolved in 45021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 287/322 constraints, ReadFeed: 286/338 constraints, PredecessorRefiner: 33/201 constraints, Known Traps: 74/74 constraints]
After SMT, in 83987ms problems are : Problem set: 0 solved, 201 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 217 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 588/588 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 309 transition count 527
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 309 transition count 527
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 299 transition count 517
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 299 transition count 517
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 295 transition count 513
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 295 transition count 513
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 295 transition count 511
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 294 transition count 509
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 294 transition count 509
Applied a total of 58 rules in 46 ms. Remains 294 /322 variables (removed 28) and now considering 509/588 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 294/322 places, 509/588 transitions.
RANDOM walk for 4000000 steps (917266 resets) in 53033 ms. (75 steps per ms) remains 193/201 properties
BEST_FIRST walk for 40003 steps (1839 resets) in 169 ms. (235 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (1896 resets) in 338 ms. (118 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40001 steps (1946 resets) in 346 ms. (115 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (1859 resets) in 262 ms. (152 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (1889 resets) in 258 ms. (154 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (1846 resets) in 302 ms. (132 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (1787 resets) in 333 ms. (119 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (1897 resets) in 246 ms. (161 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (1902 resets) in 359 ms. (111 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (1870 resets) in 270 ms. (147 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (1890 resets) in 348 ms. (114 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (1868 resets) in 233 ms. (170 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (1919 resets) in 273 ms. (146 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (1922 resets) in 264 ms. (150 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (1914 resets) in 230 ms. (173 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (1890 resets) in 242 ms. (164 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (1852 resets) in 340 ms. (117 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (1871 resets) in 256 ms. (155 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (1914 resets) in 261 ms. (152 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (1930 resets) in 249 ms. (160 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (1819 resets) in 333 ms. (119 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (1923 resets) in 371 ms. (107 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40001 steps (1875 resets) in 282 ms. (141 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (1893 resets) in 222 ms. (179 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (1894 resets) in 362 ms. (110 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (1922 resets) in 279 ms. (142 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (1883 resets) in 321 ms. (124 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (1895 resets) in 265 ms. (150 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (1960 resets) in 270 ms. (147 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (1933 resets) in 342 ms. (116 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (1880 resets) in 354 ms. (112 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (1897 resets) in 334 ms. (119 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (1888 resets) in 329 ms. (121 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (1902 resets) in 232 ms. (171 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (1894 resets) in 344 ms. (115 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (1868 resets) in 252 ms. (158 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (1881 resets) in 439 ms. (90 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (1867 resets) in 431 ms. (92 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (1877 resets) in 356 ms. (112 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (1882 resets) in 432 ms. (92 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (1900 resets) in 260 ms. (153 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (1875 resets) in 339 ms. (117 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (1851 resets) in 271 ms. (147 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40001 steps (1812 resets) in 268 ms. (148 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (1851 resets) in 345 ms. (115 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (1926 resets) in 378 ms. (105 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (1842 resets) in 251 ms. (158 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40000 steps (1950 resets) in 299 ms. (133 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (1915 resets) in 243 ms. (163 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (1921 resets) in 303 ms. (131 steps per ms) remains 193/193 properties
Finished probabilistic random walk after 236169 steps, run visited all 193 properties in 2690 ms. (steps per millisecond=87 )
Probabilistic random walk after 236169 steps, saw 95746 distinct states, run finished after 2694 ms. (steps per millisecond=87 ) properties seen :193
Able to resolve query QuasiLiveness after proving 317 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 202047 ms.
ITS solved all properties within timeout
BK_STOP 1716365193352
--------------------
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 QuasiLiveness -timeout 180 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d1m04"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DBSingleClientW-PT-d1m04, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-tall-171624200600307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m04.tgz
mv DBSingleClientW-PT-d1m04 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;