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.r528-tall-171683762401034.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 ShieldRVt-PT-050B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762401034
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 21:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 11 21:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 21:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 614K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2024-00
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2024-01
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2024-02
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2024-03
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2024-04
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2024-05
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2024-06
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2024-07
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2024-08
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2024-09
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2024-10
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2024-11
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717277901194

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:38:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 21:38:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:38:22] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2024-06-01 21:38:22] [INFO ] Transformed 2503 places.
[2024-06-01 21:38:22] [INFO ] Transformed 2503 transitions.
[2024-06-01 21:38:22] [INFO ] Found NUPN structural information;
[2024-06-01 21:38:22] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 320 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 125 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Discarding 512 places :
Symmetric choice reduction at 0 with 512 rule applications. Total rules 512 place count 1991 transition count 1991
Iterating global reduction 0 with 512 rules applied. Total rules applied 1024 place count 1991 transition count 1991
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1025 place count 1990 transition count 1990
Iterating global reduction 0 with 1 rules applied. Total rules applied 1026 place count 1990 transition count 1990
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1027 place count 1989 transition count 1989
Iterating global reduction 0 with 1 rules applied. Total rules applied 1028 place count 1989 transition count 1989
Applied a total of 1028 rules in 865 ms. Remains 1989 /2503 variables (removed 514) and now considering 1989/2503 (removed 514) transitions.
// Phase 1: matrix 1989 rows 1989 cols
[2024-06-01 21:38:23] [INFO ] Computed 201 invariants in 35 ms
[2024-06-01 21:38:24] [INFO ] Implicit Places using invariants in 852 ms returned []
[2024-06-01 21:38:24] [INFO ] Invariant cache hit.
[2024-06-01 21:38:26] [INFO ] Implicit Places using invariants and state equation in 1506 ms returned []
Implicit Place search using SMT with State Equation took 2384 ms to find 0 implicit places.
Running 1988 sub problems to find dead transitions.
[2024-06-01 21:38:26] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1988/3978 variables, and 0 constraints, problems are : Problem set: 0 solved, 1988 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1989 constraints, PredecessorRefiner: 1988/1988 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1988 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1988/3978 variables, and 0 constraints, problems are : Problem set: 0 solved, 1988 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1989 constraints, PredecessorRefiner: 0/1988 constraints, Known Traps: 0/0 constraints]
After SMT, in 60648ms problems are : Problem set: 0 solved, 1988 unsolved
Search for dead transitions found 0 dead transitions in 60682ms
Starting structural reductions in LTL mode, iteration 1 : 1989/2503 places, 1989/2503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63960 ms. Remains : 1989/2503 places, 1989/2503 transitions.
Support contains 125 out of 1989 places after structural reductions.
[2024-06-01 21:39:27] [INFO ] Flatten gal took : 134 ms
[2024-06-01 21:39:27] [INFO ] Flatten gal took : 78 ms
[2024-06-01 21:39:27] [INFO ] Input system was already deterministic with 1989 transitions.
Support contains 124 out of 1989 places (down from 125) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1908 ms. (20 steps per ms) remains 37/77 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 37/37 properties
[2024-06-01 21:39:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 663/732 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/732 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 1257/1989 variables, 140/201 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1989 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 1989/3978 variables, 1989/2190 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3978 variables, 0/2190 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3978/3978 variables, and 2190 constraints, problems are : Problem set: 0 solved, 37 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1989/1989 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 663/732 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-01 21:39:33] [INFO ] Deduced a trap composed of 43 places in 191 ms of which 29 ms to minimize.
[2024-06-01 21:39:33] [INFO ] Deduced a trap composed of 61 places in 183 ms of which 4 ms to minimize.
[2024-06-01 21:39:34] [INFO ] Deduced a trap composed of 50 places in 155 ms of which 3 ms to minimize.
[2024-06-01 21:39:34] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/732 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/732 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 1257/1989 variables, 140/205 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-01 21:39:35] [INFO ] Deduced a trap composed of 22 places in 359 ms of which 7 ms to minimize.
[2024-06-01 21:39:36] [INFO ] Deduced a trap composed of 21 places in 349 ms of which 6 ms to minimize.
[2024-06-01 21:39:36] [INFO ] Deduced a trap composed of 33 places in 358 ms of which 7 ms to minimize.
[2024-06-01 21:39:37] [INFO ] Deduced a trap composed of 33 places in 353 ms of which 7 ms to minimize.
[2024-06-01 21:39:37] [INFO ] Deduced a trap composed of 34 places in 348 ms of which 7 ms to minimize.
[2024-06-01 21:39:37] [INFO ] Deduced a trap composed of 30 places in 325 ms of which 6 ms to minimize.
[2024-06-01 21:39:38] [INFO ] Deduced a trap composed of 41 places in 316 ms of which 6 ms to minimize.
[2024-06-01 21:39:38] [INFO ] Deduced a trap composed of 54 places in 208 ms of which 5 ms to minimize.
SMT process timed out in 10207ms, After SMT, problems are : Problem set: 0 solved, 37 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 69 out of 1989 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1989/1989 places, 1989/1989 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 507 transitions
Trivial Post-agglo rules discarded 507 transitions
Performed 507 trivial Post agglomeration. Transition count delta: 507
Iterating post reduction 0 with 507 rules applied. Total rules applied 507 place count 1989 transition count 1482
Reduce places removed 507 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 522 rules applied. Total rules applied 1029 place count 1482 transition count 1467
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 1044 place count 1467 transition count 1467
Performed 356 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 356 Pre rules applied. Total rules applied 1044 place count 1467 transition count 1111
Deduced a syphon composed of 356 places in 2 ms
Reduce places removed 356 places and 0 transitions.
Iterating global reduction 3 with 712 rules applied. Total rules applied 1756 place count 1111 transition count 1111
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1768 place count 1099 transition count 1099
Iterating global reduction 3 with 12 rules applied. Total rules applied 1780 place count 1099 transition count 1099
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 1780 place count 1099 transition count 1088
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 1802 place count 1088 transition count 1088
Performed 454 Post agglomeration using F-continuation condition.Transition count delta: 454
Deduced a syphon composed of 454 places in 4 ms
Reduce places removed 454 places and 0 transitions.
Iterating global reduction 3 with 908 rules applied. Total rules applied 2710 place count 634 transition count 634
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2711 place count 634 transition count 633
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2713 place count 633 transition count 632
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2915 place count 532 transition count 712
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 2971 place count 504 transition count 737
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2972 place count 504 transition count 736
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2976 place count 504 transition count 732
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2980 place count 500 transition count 732
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 2983 place count 500 transition count 729
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2984 place count 500 transition count 729
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2985 place count 499 transition count 728
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2986 place count 498 transition count 728
Applied a total of 2986 rules in 466 ms. Remains 498 /1989 variables (removed 1491) and now considering 728/1989 (removed 1261) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 466 ms. Remains : 498/1989 places, 728/1989 transitions.
RANDOM walk for 40000 steps (16 resets) in 564 ms. (70 steps per ms) remains 32/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
// Phase 1: matrix 728 rows 498 cols
[2024-06-01 21:39:39] [INFO ] Computed 200 invariants in 3 ms
[2024-06-01 21:39:39] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 133/193 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 14/207 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 397/604 variables, 207/267 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 24/291 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 436/1040 variables, 192/483 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1040 variables, 92/575 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1040 variables, 17/592 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1040 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 6/1046 variables, 4/596 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1046 variables, 2/598 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1046 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 15 (OVERLAPS) 162/1208 variables, 84/682 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1208 variables, 37/719 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1208 variables, 4/723 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1208 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 19 (OVERLAPS) 5/1213 variables, 3/726 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1213 variables, 3/729 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1213 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 22 (OVERLAPS) 13/1226 variables, 10/739 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1226 variables, 4/743 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1226 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 25 (OVERLAPS) 0/1226 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1226/1226 variables, and 743 constraints, problems are : Problem set: 0 solved, 32 unsolved in 3668 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 498/498 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 133/193 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 14/207 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 397/604 variables, 207/267 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 24/291 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 21:39:43] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/604 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 436/1040 variables, 192/504 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1040 variables, 92/596 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1040 variables, 17/613 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1040 variables, 12/625 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1040 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 15 (OVERLAPS) 6/1046 variables, 4/629 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1046 variables, 2/631 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1046 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 18 (OVERLAPS) 162/1208 variables, 84/715 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1208 variables, 37/752 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1208 variables, 4/756 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1208 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 22 (OVERLAPS) 5/1213 variables, 3/759 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1213 variables, 3/762 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1213 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 25 (OVERLAPS) 13/1226 variables, 10/772 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1226 variables, 4/776 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1226 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 28 (OVERLAPS) 0/1226 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1226/1226 variables, and 776 constraints, problems are : Problem set: 0 solved, 32 unsolved in 6726 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 498/498 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 1/1 constraints]
After SMT, in 10420ms problems are : Problem set: 0 solved, 32 unsolved
Fused 32 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 1435 ms.
Support contains 60 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 728/728 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 498 transition count 727
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 497 transition count 727
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 497 transition count 723
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 493 transition count 723
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 491 transition count 721
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 487 transition count 725
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 485 transition count 723
Applied a total of 24 rules in 52 ms. Remains 485 /498 variables (removed 13) and now considering 723/728 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 485/498 places, 723/728 transitions.
RANDOM walk for 40000 steps (19 resets) in 557 ms. (71 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
Interrupted probabilistic random walk after 125908 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :9 out of 32
Probabilistic random walk after 125908 steps, saw 73207 distinct states, run finished after 3004 ms. (steps per millisecond=41 ) properties seen :9
// Phase 1: matrix 723 rows 485 cols
[2024-06-01 21:39:54] [INFO ] Computed 200 invariants in 2 ms
[2024-06-01 21:39:54] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 115/165 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 10/175 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 342/517 variables, 175/225 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 23/248 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 421/938 variables, 180/428 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/938 variables, 86/514 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/938 variables, 14/528 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/938 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 5/943 variables, 4/532 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/943 variables, 3/535 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/943 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (OVERLAPS) 184/1127 variables, 86/621 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1127 variables, 40/661 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1127 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 18 (OVERLAPS) 2/1129 variables, 2/663 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1129 variables, 2/665 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1129 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 21 (OVERLAPS) 67/1196 variables, 32/697 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1196 variables, 15/712 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1196 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 24 (OVERLAPS) 2/1198 variables, 1/713 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1198 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 26 (OVERLAPS) 10/1208 variables, 7/720 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1208 variables, 2/722 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1208 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 29 (OVERLAPS) 0/1208 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1208/1208 variables, and 722 constraints, problems are : Problem set: 0 solved, 23 unsolved in 3205 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 485/485 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 115/165 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 10/175 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 342/517 variables, 175/225 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 23/248 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 13/261 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 421/938 variables, 180/441 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/938 variables, 86/527 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/938 variables, 14/541 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/938 variables, 10/551 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/938 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (OVERLAPS) 5/943 variables, 4/555 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/943 variables, 3/558 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/943 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (OVERLAPS) 184/1127 variables, 86/644 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1127 variables, 40/684 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1127 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 20 (OVERLAPS) 2/1129 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1129 variables, 2/688 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1129 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 23 (OVERLAPS) 67/1196 variables, 32/720 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1196 variables, 15/735 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1196 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 26 (OVERLAPS) 2/1198 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1198 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 28 (OVERLAPS) 10/1208 variables, 7/743 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1208 variables, 2/745 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1208 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 31 (OVERLAPS) 0/1208 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1208/1208 variables, and 745 constraints, problems are : Problem set: 0 solved, 23 unsolved in 5086 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 485/485 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 8308ms problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 1017 ms.
Support contains 50 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 723/723 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 485 transition count 719
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 481 transition count 719
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 481 transition count 718
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 480 transition count 718
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 476 transition count 714
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 473 transition count 716
Applied a total of 24 rules in 31 ms. Remains 473 /485 variables (removed 12) and now considering 716/723 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 473/485 places, 716/723 transitions.
RANDOM walk for 40000 steps (17 resets) in 532 ms. (75 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 127881 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :5 out of 23
Probabilistic random walk after 127881 steps, saw 72682 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :5
// Phase 1: matrix 716 rows 473 cols
[2024-06-01 21:40:07] [INFO ] Computed 200 invariants in 7 ms
[2024-06-01 21:40:07] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 102/141 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 13/154 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 314/468 variables, 154/199 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 23/222 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 443/911 variables, 186/408 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/911 variables, 89/497 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/911 variables, 16/513 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/911 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 5/916 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/916 variables, 2/517 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/916 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 188/1104 variables, 91/608 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1104 variables, 44/652 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1104 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (OVERLAPS) 75/1179 variables, 34/686 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1179 variables, 17/703 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1179 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 21 (OVERLAPS) 10/1189 variables, 6/709 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1189 variables, 3/712 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1189 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 24 (OVERLAPS) 0/1189 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1189/1189 variables, and 712 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1936 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 473/473 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 102/141 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 13/154 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 314/468 variables, 154/199 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 23/222 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 11/233 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 443/911 variables, 186/419 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/911 variables, 89/508 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/911 variables, 16/524 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/911 variables, 7/531 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/911 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 5/916 variables, 2/533 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/916 variables, 2/535 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/916 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 188/1104 variables, 91/626 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1104 variables, 44/670 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1104 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 20 (OVERLAPS) 75/1179 variables, 34/704 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1179 variables, 17/721 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1179 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 23 (OVERLAPS) 10/1189 variables, 6/727 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1189 variables, 3/730 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1189 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 26 (OVERLAPS) 0/1189 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1189/1189 variables, and 730 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2975 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 473/473 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 4931ms problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 597 ms.
Support contains 39 out of 473 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 716/716 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 473 transition count 708
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 465 transition count 708
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 464 transition count 707
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 464 transition count 707
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 18 place count 464 transition count 706
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 463 transition count 706
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 461 transition count 707
Applied a total of 24 rules in 36 ms. Remains 461 /473 variables (removed 12) and now considering 707/716 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 461/473 places, 707/716 transitions.
RANDOM walk for 40000 steps (14 resets) in 541 ms. (73 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 136540 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :8 out of 18
Probabilistic random walk after 136540 steps, saw 77687 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :8
// Phase 1: matrix 707 rows 461 cols
[2024-06-01 21:40:16] [INFO ] Computed 200 invariants in 4 ms
[2024-06-01 21:40:16] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 70/97 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 16/113 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 232/345 variables, 113/147 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 23/170 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 380/725 variables, 145/315 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/725 variables, 69/384 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/725 variables, 17/401 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/725 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 4/729 variables, 3/404 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/729 variables, 2/406 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/729 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 251/980 variables, 113/519 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/980 variables, 52/571 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/980 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 4/984 variables, 3/574 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/984 variables, 2/576 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/984 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 139/1123 variables, 61/637 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1123 variables, 27/664 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1123 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (OVERLAPS) 3/1126 variables, 2/666 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1126 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1126 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (OVERLAPS) 42/1168 variables, 24/691 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1168 variables, 10/701 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1168 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (OVERLAPS) 0/1168 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1168/1168 variables, and 701 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1319 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 461/461 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 70/97 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 16/113 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 232/345 variables, 113/147 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 23/170 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 6/176 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 380/725 variables, 145/321 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/725 variables, 69/390 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/725 variables, 17/407 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/725 variables, 4/411 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 21:40:17] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/725 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/725 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 4/729 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/729 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/729 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 251/980 variables, 113/530 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 52/582 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 4/984 variables, 3/585 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/984 variables, 2/587 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/984 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (OVERLAPS) 139/1123 variables, 61/648 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1123 variables, 27/675 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1123 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (OVERLAPS) 3/1126 variables, 2/677 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1126 variables, 1/678 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1126 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (OVERLAPS) 42/1168 variables, 24/702 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1168 variables, 10/712 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1168 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (OVERLAPS) 0/1168 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1168/1168 variables, and 712 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2080 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 461/461 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 3423ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1190 ms.
Support contains 27 out of 461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 707/707 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 461 transition count 699
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 453 transition count 699
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 449 transition count 695
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 34 place count 444 transition count 702
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 443 transition count 701
Applied a total of 35 rules in 37 ms. Remains 443 /461 variables (removed 18) and now considering 701/707 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 443/461 places, 701/707 transitions.
RANDOM walk for 40000 steps (20 resets) in 403 ms. (99 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (9 resets) in 226 ms. (176 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (14 resets) in 215 ms. (185 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 129 ms. (307 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (10 resets) in 120 ms. (330 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 117 ms. (339 steps per ms) remains 9/9 properties
// Phase 1: matrix 701 rows 443 cols
[2024-06-01 21:40:21] [INFO ] Computed 200 invariants in 2 ms
[2024-06-01 21:40:21] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 61/86 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 8/94 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 198/292 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 358/650 variables, 136/265 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/650 variables, 66/331 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/650 variables, 19/350 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 2/652 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/652 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/652 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 2/654 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/654 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 241/895 variables, 106/461 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/895 variables, 52/513 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/895 variables, 3/516 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/895 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 165/1060 variables, 64/580 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1060 variables, 32/612 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1060 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 76/1136 variables, 36/648 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1136 variables, 18/666 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1136 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 8/1144 variables, 5/671 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1144 variables, 2/673 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1144 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (OVERLAPS) 0/1144 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1144/1144 variables, and 673 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1077 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 443/443 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 61/86 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 8/94 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 198/292 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 6/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 358/650 variables, 136/271 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/650 variables, 66/337 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/650 variables, 19/356 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/650 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/650 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 2/652 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/652 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/652 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 2/654 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/654 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 241/895 variables, 106/470 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/895 variables, 52/522 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/895 variables, 3/525 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/895 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 165/1060 variables, 64/589 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1060 variables, 32/621 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1060 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 76/1136 variables, 36/657 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1136 variables, 18/675 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1136 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (OVERLAPS) 8/1144 variables, 5/680 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1144 variables, 2/682 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1144 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (OVERLAPS) 0/1144 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 682 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1542 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 443/443 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 2628ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 354 ms.
Support contains 25 out of 443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 701/701 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 441 transition count 699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 440 transition count 698
Applied a total of 5 rules in 43 ms. Remains 440 /443 variables (removed 3) and now considering 698/701 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 440/443 places, 698/701 transitions.
RANDOM walk for 40000 steps (17 resets) in 331 ms. (120 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (15 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (10 resets) in 179 ms. (222 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 188 ms. (211 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 8/8 properties
// Phase 1: matrix 698 rows 440 cols
[2024-06-01 21:40:25] [INFO ] Computed 200 invariants in 2 ms
[2024-06-01 21:40:25] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 55/78 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 8/86 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 178/264 variables, 86/111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 8/119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 301/565 variables, 116/235 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 58/293 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 14/307 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 196/761 variables, 86/393 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/761 variables, 42/435 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/761 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 2/763 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/763 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 125/888 variables, 50/486 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/888 variables, 24/510 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/888 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 73/961 variables, 32/542 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/961 variables, 16/558 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/961 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 44/1005 variables, 16/574 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1005 variables, 8/582 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1005 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 44/1049 variables, 16/598 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1049 variables, 8/606 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1049 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (OVERLAPS) 42/1091 variables, 16/622 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1091 variables, 8/630 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1091 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (OVERLAPS) 39/1130 variables, 16/646 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1130 variables, 7/653 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1130 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (OVERLAPS) 2/1132 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1132 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (OVERLAPS) 6/1138 variables, 6/660 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1138 variables, 2/662 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1138 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (OVERLAPS) 0/1138 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1138/1138 variables, and 662 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1385 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 440/440 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 55/78 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 8/86 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 178/264 variables, 86/111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 8/119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 5/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 301/565 variables, 116/240 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 58/298 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 14/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 3/315 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/565 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 196/761 variables, 86/401 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/761 variables, 42/443 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/761 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 2/763 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/763 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 125/888 variables, 50/494 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/888 variables, 24/518 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/888 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 73/961 variables, 32/550 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/961 variables, 16/566 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/961 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 44/1005 variables, 16/582 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1005 variables, 8/590 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1005 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 44/1049 variables, 16/606 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1049 variables, 8/614 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1049 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 42/1091 variables, 16/630 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1091 variables, 8/638 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1091 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (OVERLAPS) 39/1130 variables, 16/654 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1130 variables, 7/661 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1130 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (OVERLAPS) 2/1132 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1132 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (OVERLAPS) 6/1138 variables, 6/668 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1138 variables, 2/670 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1138 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (OVERLAPS) 0/1138 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1138/1138 variables, and 670 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1920 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 440/440 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 3314ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 2007 ms.
Support contains 23 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 698/698 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 440 transition count 696
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 438 transition count 696
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 436 transition count 700
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 436 transition count 699
Applied a total of 9 rules in 38 ms. Remains 436 /440 variables (removed 4) and now considering 699/698 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 436/440 places, 699/698 transitions.
RANDOM walk for 40000 steps (14 resets) in 363 ms. (109 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (18 resets) in 176 ms. (226 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 170 ms. (233 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 156999 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :2 out of 8
Probabilistic random walk after 156999 steps, saw 100821 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :2
// Phase 1: matrix 699 rows 436 cols
[2024-06-01 21:40:33] [INFO ] Computed 200 invariants in 1 ms
[2024-06-01 21:40:33] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 52/72 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/80 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 165/245 variables, 80/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 311/556 variables, 116/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 56/282 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/556 variables, 15/297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/556 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 2/558 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/558 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/558 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 201/759 variables, 88/389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/759 variables, 44/433 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/759 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 127/886 variables, 50/483 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/886 variables, 25/508 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/886 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 73/959 variables, 32/540 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/959 variables, 16/556 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/959 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 44/1003 variables, 16/572 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1003 variables, 8/580 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1003 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 44/1047 variables, 16/596 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1047 variables, 8/604 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1047 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 44/1091 variables, 16/620 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1091 variables, 8/628 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1091 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (OVERLAPS) 38/1129 variables, 16/644 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1129 variables, 8/652 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1129 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (OVERLAPS) 6/1135 variables, 4/656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1135 variables, 2/658 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1135 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (OVERLAPS) 0/1135 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1135/1135 variables, and 658 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1027 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 436/436 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 52/72 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/80 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 165/245 variables, 80/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 311/556 variables, 116/229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/556 variables, 56/285 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/556 variables, 15/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/556 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/556 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2/558 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/558 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/558 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 201/759 variables, 88/395 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/759 variables, 44/439 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/759 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 127/886 variables, 50/489 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/886 variables, 25/514 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/886 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 73/959 variables, 32/546 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/959 variables, 16/562 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/959 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 44/1003 variables, 16/578 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1003 variables, 8/586 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1003 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 44/1047 variables, 16/602 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1047 variables, 8/610 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1047 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 44/1091 variables, 16/626 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1091 variables, 8/634 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1091 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 38/1129 variables, 16/650 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1129 variables, 8/658 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1129 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 6/1135 variables, 4/662 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1135 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1135 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 0/1135 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1135/1135 variables, and 664 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1386 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 436/436 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 2424ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1083 ms.
Support contains 20 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 699/699 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 433 transition count 696
Applied a total of 6 rules in 15 ms. Remains 433 /436 variables (removed 3) and now considering 696/699 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 433/436 places, 696/699 transitions.
RANDOM walk for 40000 steps (16 resets) in 316 ms. (126 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (14 resets) in 166 ms. (239 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (10 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 173058 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :1 out of 6
Probabilistic random walk after 173058 steps, saw 111830 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :1
// Phase 1: matrix 696 rows 433 cols
[2024-06-01 21:40:40] [INFO ] Computed 200 invariants in 5 ms
[2024-06-01 21:40:40] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 42/58 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6/64 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 142/206 variables, 64/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 7/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 317/523 variables, 114/204 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/523 variables, 54/258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/523 variables, 12/270 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/523 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 7/530 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/530 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/532 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/532 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 221/753 variables, 104/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/753 variables, 48/427 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/753 variables, 3/430 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/753 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 127/880 variables, 50/480 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/880 variables, 25/505 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/880 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 73/953 variables, 32/537 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/953 variables, 16/553 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/953 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 44/997 variables, 16/569 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/997 variables, 8/577 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/997 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 44/1041 variables, 16/593 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1041 variables, 8/601 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1041 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 44/1085 variables, 16/617 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1085 variables, 8/625 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1085 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 38/1123 variables, 16/641 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1123 variables, 8/649 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1123 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 6/1129 variables, 4/653 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1129 variables, 2/655 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1129 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (OVERLAPS) 0/1129 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1129/1129 variables, and 655 constraints, problems are : Problem set: 0 solved, 5 unsolved in 882 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 433/433 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 42/58 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6/64 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 142/206 variables, 64/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 7/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 317/523 variables, 114/207 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/523 variables, 54/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/523 variables, 12/273 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/523 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/523 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 7/530 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/532 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 221/753 variables, 104/384 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/753 variables, 48/432 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/753 variables, 3/435 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/753 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 127/880 variables, 50/485 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/880 variables, 25/510 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/880 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 73/953 variables, 32/542 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/953 variables, 16/558 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/953 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 44/997 variables, 16/574 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/997 variables, 8/582 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/997 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (OVERLAPS) 44/1041 variables, 16/598 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1041 variables, 8/606 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1041 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (OVERLAPS) 44/1085 variables, 16/622 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1085 variables, 8/630 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1085 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (OVERLAPS) 38/1123 variables, 16/646 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1123 variables, 8/654 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1123 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (OVERLAPS) 6/1129 variables, 4/658 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1129 variables, 2/660 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1129 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (OVERLAPS) 0/1129 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1129/1129 variables, and 660 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1170 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 433/433 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2073ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 504 ms.
Support contains 16 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 696/696 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 433 transition count 694
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 431 transition count 694
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 429 transition count 692
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 427 transition count 693
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 426 transition count 692
Applied a total of 13 rules in 34 ms. Remains 426 /433 variables (removed 7) and now considering 692/696 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 426/433 places, 692/696 transitions.
RANDOM walk for 40000 steps (20 resets) in 299 ms. (133 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 161 ms. (246 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (15 resets) in 135 ms. (294 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 186190 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :1 out of 5
Probabilistic random walk after 186190 steps, saw 117128 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :1
// Phase 1: matrix 692 rows 426 cols
[2024-06-01 21:40:46] [INFO ] Computed 200 invariants in 5 ms
[2024-06-01 21:40:46] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 37/51 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/57 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 129/186 variables, 57/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 7/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 314/500 variables, 112/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 54/247 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 12/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 3/503 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/503 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/503 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 227/730 variables, 102/364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/730 variables, 50/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/730 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 129/859 variables, 50/464 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/859 variables, 25/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/859 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 71/930 variables, 32/521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/930 variables, 16/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/930 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 44/974 variables, 16/553 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/974 variables, 8/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/974 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 44/1018 variables, 16/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1018 variables, 8/585 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1018 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 44/1062 variables, 16/601 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1062 variables, 8/609 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1062 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 42/1104 variables, 16/625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1104 variables, 8/633 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1104 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 14/1118 variables, 8/641 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1118 variables, 4/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1118 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 0/1118 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1118/1118 variables, and 645 constraints, problems are : Problem set: 0 solved, 4 unsolved in 691 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 426/426 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 37/51 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/57 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 129/186 variables, 57/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 7/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 314/500 variables, 112/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 54/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 12/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/500 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 3/503 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/503 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/503 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 227/730 variables, 102/368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/730 variables, 50/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/730 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 129/859 variables, 50/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/859 variables, 25/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/859 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 71/930 variables, 32/525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/930 variables, 16/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/930 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 44/974 variables, 16/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/974 variables, 8/565 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/974 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 44/1018 variables, 16/581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1018 variables, 8/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1018 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 44/1062 variables, 16/605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1062 variables, 8/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1062 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 42/1104 variables, 16/629 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1104 variables, 8/637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1104 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 14/1118 variables, 8/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1118 variables, 4/649 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1118 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 0/1118 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1118/1118 variables, and 649 constraints, problems are : Problem set: 0 solved, 4 unsolved in 914 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 426/426 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1626ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 700 ms.
Support contains 14 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 692/692 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 426 transition count 691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 425 transition count 691
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 425 transition count 690
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 424 transition count 690
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 423 transition count 691
Applied a total of 6 rules in 21 ms. Remains 423 /426 variables (removed 3) and now considering 691/692 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 423/426 places, 691/692 transitions.
RANDOM walk for 40000 steps (27 resets) in 325 ms. (122 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (11 resets) in 180 ms. (221 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (15 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 198180 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 4
Probabilistic random walk after 198180 steps, saw 128375 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
// Phase 1: matrix 691 rows 423 cols
[2024-06-01 21:40:52] [INFO ] Computed 200 invariants in 4 ms
[2024-06-01 21:40:52] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 37/51 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/57 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 130/187 variables, 57/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 7/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 312/499 variables, 112/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 56/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 12/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/499 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 227/726 variables, 100/361 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/726 variables, 50/411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/726 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 129/855 variables, 50/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/855 variables, 25/486 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/855 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 71/926 variables, 32/518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/926 variables, 16/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/926 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 44/970 variables, 16/550 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/970 variables, 8/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/970 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 44/1014 variables, 16/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1014 variables, 8/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1014 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 44/1058 variables, 16/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1058 variables, 8/606 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1058 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 42/1100 variables, 16/622 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1100 variables, 8/630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1100 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 14/1114 variables, 8/638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1114 variables, 4/642 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1114 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 0/1114 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 642 constraints, problems are : Problem set: 0 solved, 4 unsolved in 669 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 423/423 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 37/51 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/57 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 130/187 variables, 57/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 7/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 312/499 variables, 112/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 56/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/499 variables, 12/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/499 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:40:53] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/499 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/499 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 227/726 variables, 100/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/726 variables, 50/416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/726 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 129/855 variables, 50/466 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/855 variables, 25/491 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/855 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 71/926 variables, 32/523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/926 variables, 16/539 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/926 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 44/970 variables, 16/555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/970 variables, 8/563 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/970 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 44/1014 variables, 16/579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1014 variables, 8/587 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1014 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 44/1058 variables, 16/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1058 variables, 8/611 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1058 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 42/1100 variables, 16/627 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1100 variables, 8/635 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1100 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 14/1114 variables, 8/643 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1114 variables, 4/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1114 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 0/1114 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 647 constraints, problems are : Problem set: 0 solved, 4 unsolved in 973 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 423/423 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1653ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 653 ms.
Support contains 14 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 691/691 transitions.
Applied a total of 0 rules in 9 ms. Remains 423 /423 variables (removed 0) and now considering 691/691 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 423/423 places, 691/691 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 691/691 transitions.
Applied a total of 0 rules in 8 ms. Remains 423 /423 variables (removed 0) and now considering 691/691 (removed 0) transitions.
[2024-06-01 21:40:54] [INFO ] Invariant cache hit.
[2024-06-01 21:40:55] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-06-01 21:40:55] [INFO ] Invariant cache hit.
[2024-06-01 21:40:55] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 21:40:55] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
[2024-06-01 21:40:55] [INFO ] Redundant transitions in 36 ms returned []
Running 683 sub problems to find dead transitions.
[2024-06-01 21:40:55] [INFO ] Invariant cache hit.
[2024-06-01 21:40:55] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 191/191 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 2 (OVERLAPS) 5/423 variables, 9/200 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 4 (OVERLAPS) 691/1114 variables, 423/623 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1114 variables, 19/642 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1114 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 683 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 642 constraints, problems are : Problem set: 0 solved, 683 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 423/423 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 683/683 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 683 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 191/191 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 2 (OVERLAPS) 5/423 variables, 9/200 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 4 (OVERLAPS) 691/1114 variables, 423/623 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1114 variables, 19/642 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1114 variables, 683/1325 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1114 variables, 0/1325 constraints. Problems are: Problem set: 0 solved, 683 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 1325 constraints, problems are : Problem set: 0 solved, 683 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 423/423 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 683/683 constraints, Known Traps: 0/0 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 683 unsolved
Search for dead transitions found 0 dead transitions in 60235ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60988 ms. Remains : 423/423 places, 691/691 transitions.
[2024-06-01 21:41:55] [INFO ] Flatten gal took : 58 ms
[2024-06-01 21:41:55] [INFO ] Flatten gal took : 55 ms
[2024-06-01 21:41:56] [INFO ] Input system was already deterministic with 1989 transitions.
Computed a total of 607 stabilizing places and 607 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1989/1989 places, 1989/1989 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 545 transitions
Trivial Post-agglo rules discarded 545 transitions
Performed 545 trivial Post agglomeration. Transition count delta: 545
Iterating post reduction 0 with 545 rules applied. Total rules applied 545 place count 1988 transition count 1443
Reduce places removed 545 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 547 rules applied. Total rules applied 1092 place count 1443 transition count 1441
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1094 place count 1441 transition count 1441
Performed 373 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 373 Pre rules applied. Total rules applied 1094 place count 1441 transition count 1068
Deduced a syphon composed of 373 places in 1 ms
Reduce places removed 373 places and 0 transitions.
Iterating global reduction 3 with 746 rules applied. Total rules applied 1840 place count 1068 transition count 1068
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1864 place count 1044 transition count 1044
Iterating global reduction 3 with 24 rules applied. Total rules applied 1888 place count 1044 transition count 1044
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 1888 place count 1044 transition count 1021
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 1934 place count 1021 transition count 1021
Performed 399 Post agglomeration using F-continuation condition.Transition count delta: 399
Deduced a syphon composed of 399 places in 0 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 2732 place count 622 transition count 622
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2733 place count 622 transition count 621
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2735 place count 621 transition count 620
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2736 place count 621 transition count 620
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2738 place count 619 transition count 618
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2739 place count 618 transition count 618
Applied a total of 2739 rules in 218 ms. Remains 618 /1989 variables (removed 1371) and now considering 618/1989 (removed 1371) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 219 ms. Remains : 618/1989 places, 618/1989 transitions.
[2024-06-01 21:41:56] [INFO ] Flatten gal took : 18 ms
[2024-06-01 21:41:56] [INFO ] Flatten gal took : 28 ms
[2024-06-01 21:41:56] [INFO ] Input system was already deterministic with 618 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1989/1989 places, 1989/1989 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 535 transitions
Trivial Post-agglo rules discarded 535 transitions
Performed 535 trivial Post agglomeration. Transition count delta: 535
Iterating post reduction 0 with 535 rules applied. Total rules applied 535 place count 1988 transition count 1453
Reduce places removed 535 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 543 rules applied. Total rules applied 1078 place count 1453 transition count 1445
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1086 place count 1445 transition count 1445
Performed 373 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 373 Pre rules applied. Total rules applied 1086 place count 1445 transition count 1072
Deduced a syphon composed of 373 places in 2 ms
Reduce places removed 373 places and 0 transitions.
Iterating global reduction 3 with 746 rules applied. Total rules applied 1832 place count 1072 transition count 1072
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1860 place count 1044 transition count 1044
Iterating global reduction 3 with 28 rules applied. Total rules applied 1888 place count 1044 transition count 1044
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 1888 place count 1044 transition count 1017
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 1942 place count 1017 transition count 1017
Performed 390 Post agglomeration using F-continuation condition.Transition count delta: 390
Deduced a syphon composed of 390 places in 0 ms
Reduce places removed 390 places and 0 transitions.
Iterating global reduction 3 with 780 rules applied. Total rules applied 2722 place count 627 transition count 627
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2723 place count 627 transition count 626
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2725 place count 626 transition count 625
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2727 place count 624 transition count 623
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2728 place count 623 transition count 623
Applied a total of 2728 rules in 169 ms. Remains 623 /1989 variables (removed 1366) and now considering 623/1989 (removed 1366) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 169 ms. Remains : 623/1989 places, 623/1989 transitions.
[2024-06-01 21:41:56] [INFO ] Flatten gal took : 16 ms
[2024-06-01 21:41:56] [INFO ] Flatten gal took : 17 ms
[2024-06-01 21:41:56] [INFO ] Input system was already deterministic with 623 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1989/1989 places, 1989/1989 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 1953 transition count 1953
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 1953 transition count 1953
Applied a total of 72 rules in 143 ms. Remains 1953 /1989 variables (removed 36) and now considering 1953/1989 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 1953/1989 places, 1953/1989 transitions.
[2024-06-01 21:41:56] [INFO ] Flatten gal took : 40 ms
[2024-06-01 21:41:56] [INFO ] Flatten gal took : 40 ms
[2024-06-01 21:41:56] [INFO ] Input system was already deterministic with 1953 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1989/1989 places, 1989/1989 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 548 transitions
Trivial Post-agglo rules discarded 548 transitions
Performed 548 trivial Post agglomeration. Transition count delta: 548
Iterating post reduction 0 with 548 rules applied. Total rules applied 548 place count 1988 transition count 1440
Reduce places removed 548 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 549 rules applied. Total rules applied 1097 place count 1440 transition count 1439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1098 place count 1439 transition count 1439
Performed 374 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 374 Pre rules applied. Total rules applied 1098 place count 1439 transition count 1065
Deduced a syphon composed of 374 places in 1 ms
Reduce places removed 374 places and 0 transitions.
Iterating global reduction 3 with 748 rules applied. Total rules applied 1846 place count 1065 transition count 1065
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1874 place count 1037 transition count 1037
Iterating global reduction 3 with 28 rules applied. Total rules applied 1902 place count 1037 transition count 1037
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 1902 place count 1037 transition count 1010
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 1956 place count 1010 transition count 1010
Performed 397 Post agglomeration using F-continuation condition.Transition count delta: 397
Deduced a syphon composed of 397 places in 1 ms
Reduce places removed 397 places and 0 transitions.
Iterating global reduction 3 with 794 rules applied. Total rules applied 2750 place count 613 transition count 613
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2751 place count 613 transition count 612
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2753 place count 612 transition count 611
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2755 place count 610 transition count 609
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2756 place count 609 transition count 609
Applied a total of 2756 rules in 168 ms. Remains 609 /1989 variables (removed 1380) and now considering 609/1989 (removed 1380) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 168 ms. Remains : 609/1989 places, 609/1989 transitions.
[2024-06-01 21:41:57] [INFO ] Flatten gal took : 15 ms
[2024-06-01 21:41:57] [INFO ] Flatten gal took : 16 ms
[2024-06-01 21:41:57] [INFO ] Input system was already deterministic with 609 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1989/1989 places, 1989/1989 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 554 transitions
Trivial Post-agglo rules discarded 554 transitions
Performed 554 trivial Post agglomeration. Transition count delta: 554
Iterating post reduction 0 with 554 rules applied. Total rules applied 554 place count 1988 transition count 1434
Reduce places removed 554 places and 0 transitions.
Iterating post reduction 1 with 554 rules applied. Total rules applied 1108 place count 1434 transition count 1434
Performed 374 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 374 Pre rules applied. Total rules applied 1108 place count 1434 transition count 1060
Deduced a syphon composed of 374 places in 2 ms
Reduce places removed 374 places and 0 transitions.
Iterating global reduction 2 with 748 rules applied. Total rules applied 1856 place count 1060 transition count 1060
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 1886 place count 1030 transition count 1030
Iterating global reduction 2 with 30 rules applied. Total rules applied 1916 place count 1030 transition count 1030
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 1916 place count 1030 transition count 1001
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 1974 place count 1001 transition count 1001
Performed 397 Post agglomeration using F-continuation condition.Transition count delta: 397
Deduced a syphon composed of 397 places in 1 ms
Reduce places removed 397 places and 0 transitions.
Iterating global reduction 2 with 794 rules applied. Total rules applied 2768 place count 604 transition count 604
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2769 place count 604 transition count 603
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2771 place count 603 transition count 602
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2773 place count 601 transition count 600
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2774 place count 600 transition count 600
Applied a total of 2774 rules in 150 ms. Remains 600 /1989 variables (removed 1389) and now considering 600/1989 (removed 1389) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 150 ms. Remains : 600/1989 places, 600/1989 transitions.
[2024-06-01 21:41:57] [INFO ] Flatten gal took : 14 ms
[2024-06-01 21:41:57] [INFO ] Flatten gal took : 14 ms
[2024-06-01 21:41:57] [INFO ] Input system was already deterministic with 600 transitions.
RANDOM walk for 40000 steps (8 resets) in 275 ms. (144 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 389937 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 1
Probabilistic random walk after 389937 steps, saw 332116 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
// Phase 1: matrix 600 rows 600 cols
[2024-06-01 21:42:00] [INFO ] Computed 200 invariants in 2 ms
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) 5/9 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/25 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/28 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/28 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 32/60 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/66 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 42/108 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/108 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/108 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/114 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/114 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/114 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/156 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/156 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/156 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 6/162 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/162 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/162 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 42/204 variables, 18/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/204 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/204 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 6/210 variables, 6/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/210 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/210 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 42/252 variables, 18/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/252 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/252 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 6/258 variables, 6/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/258 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/258 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 42/300 variables, 18/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/300 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/300 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 6/306 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/306 variables, 6/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/306 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 42/348 variables, 18/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/348 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/348 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 6/354 variables, 6/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/354 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/354 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 42/396 variables, 18/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/396 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/396 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 6/402 variables, 6/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/402 variables, 6/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/402 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 42/444 variables, 18/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/444 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/444 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 6/450 variables, 6/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/450 variables, 6/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/450 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 42/492 variables, 18/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/492 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/492 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 6/498 variables, 6/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/498 variables, 6/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/498 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 42/540 variables, 18/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/540 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/540 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 6/546 variables, 6/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/546 variables, 6/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/546 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 42/588 variables, 18/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/588 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/588 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 6/594 variables, 6/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/594 variables, 6/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/594 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 42/636 variables, 18/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/636 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/636 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 6/642 variables, 6/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/642 variables, 6/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/642 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 42/684 variables, 18/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/684 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/684 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 6/690 variables, 6/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/690 variables, 6/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/690 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 42/732 variables, 18/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/732 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/732 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 6/738 variables, 6/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/738 variables, 6/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/738 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 42/780 variables, 18/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/780 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/780 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 6/786 variables, 6/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/786 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/786 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 42/828 variables, 18/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/828 variables, 2/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/828 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 6/834 variables, 6/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/834 variables, 6/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/834 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 42/876 variables, 18/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/876 variables, 2/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/876 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 6/882 variables, 6/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/882 variables, 6/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/882 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 42/924 variables, 18/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/924 variables, 2/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/924 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 6/930 variables, 6/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/930 variables, 6/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/930 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 42/972 variables, 18/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/972 variables, 2/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/972 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (OVERLAPS) 6/978 variables, 6/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/978 variables, 6/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/978 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (OVERLAPS) 42/1020 variables, 18/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1020 variables, 2/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1020 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (OVERLAPS) 6/1026 variables, 6/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1026 variables, 6/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1026 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (OVERLAPS) 42/1068 variables, 18/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1068 variables, 2/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1068 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (OVERLAPS) 6/1074 variables, 6/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/1074 variables, 6/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1074 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (OVERLAPS) 42/1116 variables, 18/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/1116 variables, 2/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1116 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (OVERLAPS) 6/1122 variables, 6/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1122 variables, 6/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1122 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (OVERLAPS) 28/1150 variables, 14/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1150 variables, 3/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1150 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (OVERLAPS) 3/1153 variables, 3/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/1153 variables, 3/768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1153 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (OVERLAPS) 21/1174 variables, 9/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/1174 variables, 1/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1174 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (OVERLAPS) 3/1177 variables, 3/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1177 variables, 3/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1177 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (OVERLAPS) 16/1193 variables, 7/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/1193 variables, 1/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1193 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (OVERLAPS) 2/1195 variables, 2/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/1195 variables, 2/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1195 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (OVERLAPS) 5/1200 variables, 3/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1200 variables, 1/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1200 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (OVERLAPS) 0/1200 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1200/1200 variables, and 800 constraints, problems are : Problem set: 0 solved, 1 unsolved in 754 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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) 5/9 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/25 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/28 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/28 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 32/60 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/60 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/66 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/66 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 42/108 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/108 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/108 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/114 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/114 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/114 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 42/156 variables, 18/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/156 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/156 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 6/162 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/162 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/162 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 42/204 variables, 18/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/204 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/204 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 6/210 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/210 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/210 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 42/252 variables, 18/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/252 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/252 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 6/258 variables, 6/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/258 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/258 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 42/300 variables, 18/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/300 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/300 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 6/306 variables, 6/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/306 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/306 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 42/348 variables, 18/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/348 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/348 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 6/354 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/354 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/354 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 42/396 variables, 18/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/396 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/396 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 6/402 variables, 6/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/402 variables, 6/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/402 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 42/444 variables, 18/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/444 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/444 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 6/450 variables, 6/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/450 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/450 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 42/492 variables, 18/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/492 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/492 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 6/498 variables, 6/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/498 variables, 6/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/498 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 42/540 variables, 18/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/540 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/540 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 6/546 variables, 6/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/546 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/546 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 42/588 variables, 18/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/588 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/588 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 6/594 variables, 6/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/594 variables, 6/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/594 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 42/636 variables, 18/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/636 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/636 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 6/642 variables, 6/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/642 variables, 6/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/642 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 42/684 variables, 18/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/684 variables, 2/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/684 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 6/690 variables, 6/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/690 variables, 6/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/690 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 42/732 variables, 18/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/732 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/732 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 6/738 variables, 6/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/738 variables, 6/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/738 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 42/780 variables, 18/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/780 variables, 2/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/780 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 6/786 variables, 6/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/786 variables, 6/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/786 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 42/828 variables, 18/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/828 variables, 2/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/828 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 6/834 variables, 6/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/834 variables, 6/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/834 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 42/876 variables, 18/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/876 variables, 2/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/876 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 6/882 variables, 6/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/882 variables, 6/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/882 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 42/924 variables, 18/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/924 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/924 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 6/930 variables, 6/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/930 variables, 6/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/930 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 42/972 variables, 18/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/972 variables, 2/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/972 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 6/978 variables, 6/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/978 variables, 6/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/978 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (OVERLAPS) 42/1020 variables, 18/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1020 variables, 2/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1020 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (OVERLAPS) 6/1026 variables, 6/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1026 variables, 6/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1026 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (OVERLAPS) 42/1068 variables, 18/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1068 variables, 2/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1068 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (OVERLAPS) 6/1074 variables, 6/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1074 variables, 6/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1074 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (OVERLAPS) 42/1116 variables, 18/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1116 variables, 2/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1116 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (OVERLAPS) 6/1122 variables, 6/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1122 variables, 6/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/1122 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (OVERLAPS) 28/1150 variables, 14/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1150 variables, 3/763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1150 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (OVERLAPS) 3/1153 variables, 3/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1153 variables, 3/769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1153 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (OVERLAPS) 21/1174 variables, 9/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1174 variables, 1/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1174 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (OVERLAPS) 3/1177 variables, 3/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1177 variables, 3/785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1177 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (OVERLAPS) 16/1193 variables, 7/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1193 variables, 1/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/1193 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (OVERLAPS) 2/1195 variables, 2/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1195 variables, 2/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/1195 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (OVERLAPS) 5/1200 variables, 3/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1200 variables, 1/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/1200 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (OVERLAPS) 0/1200 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1200/1200 variables, and 801 constraints, problems are : Problem set: 0 solved, 1 unsolved in 771 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1535ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 600/600 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 550 transition count 550
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 0 with 202 rules applied. Total rules applied 302 place count 449 transition count 650
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 398 place count 401 transition count 698
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 399 place count 401 transition count 697
Applied a total of 399 rules in 47 ms. Remains 401 /600 variables (removed 199) and now considering 697/600 (removed -97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 401/600 places, 697/600 transitions.
RANDOM walk for 2839868 steps (715 resets) in 16419 ms. (172 steps per ms) remains 0/1 properties
FORMULA ShieldRVt-PT-050B-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1989/1989 places, 1989/1989 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 1951 transition count 1951
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 1951 transition count 1951
Applied a total of 76 rules in 178 ms. Remains 1951 /1989 variables (removed 38) and now considering 1951/1989 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 1951/1989 places, 1951/1989 transitions.
[2024-06-01 21:42:08] [INFO ] Flatten gal took : 37 ms
[2024-06-01 21:42:08] [INFO ] Flatten gal took : 35 ms
[2024-06-01 21:42:08] [INFO ] Input system was already deterministic with 1951 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1989/1989 places, 1989/1989 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 550 transitions
Trivial Post-agglo rules discarded 550 transitions
Performed 550 trivial Post agglomeration. Transition count delta: 550
Iterating post reduction 0 with 550 rules applied. Total rules applied 550 place count 1988 transition count 1438
Reduce places removed 550 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 551 rules applied. Total rules applied 1101 place count 1438 transition count 1437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1102 place count 1437 transition count 1437
Performed 375 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 375 Pre rules applied. Total rules applied 1102 place count 1437 transition count 1062
Deduced a syphon composed of 375 places in 3 ms
Reduce places removed 375 places and 0 transitions.
Iterating global reduction 3 with 750 rules applied. Total rules applied 1852 place count 1062 transition count 1062
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1881 place count 1033 transition count 1033
Iterating global reduction 3 with 29 rules applied. Total rules applied 1910 place count 1033 transition count 1033
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 1910 place count 1033 transition count 1005
Deduced a syphon composed of 28 places in 3 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 1966 place count 1005 transition count 1005
Performed 396 Post agglomeration using F-continuation condition.Transition count delta: 396
Deduced a syphon composed of 396 places in 1 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 3 with 792 rules applied. Total rules applied 2758 place count 609 transition count 609
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2759 place count 609 transition count 608
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2761 place count 608 transition count 607
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2762 place count 608 transition count 607
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2764 place count 606 transition count 605
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2765 place count 605 transition count 605
Applied a total of 2765 rules in 209 ms. Remains 605 /1989 variables (removed 1384) and now considering 605/1989 (removed 1384) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 209 ms. Remains : 605/1989 places, 605/1989 transitions.
[2024-06-01 21:42:08] [INFO ] Flatten gal took : 13 ms
[2024-06-01 21:42:08] [INFO ] Flatten gal took : 14 ms
[2024-06-01 21:42:08] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1989/1989 places, 1989/1989 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 1958 transition count 1958
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 1958 transition count 1958
Applied a total of 62 rules in 145 ms. Remains 1958 /1989 variables (removed 31) and now considering 1958/1989 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 1958/1989 places, 1958/1989 transitions.
[2024-06-01 21:42:08] [INFO ] Flatten gal took : 33 ms
[2024-06-01 21:42:08] [INFO ] Flatten gal took : 34 ms
[2024-06-01 21:42:08] [INFO ] Input system was already deterministic with 1958 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1989/1989 places, 1989/1989 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1952 transition count 1952
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1952 transition count 1952
Applied a total of 74 rules in 142 ms. Remains 1952 /1989 variables (removed 37) and now considering 1952/1989 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 1952/1989 places, 1952/1989 transitions.
[2024-06-01 21:42:08] [INFO ] Flatten gal took : 32 ms
[2024-06-01 21:42:08] [INFO ] Flatten gal took : 33 ms
[2024-06-01 21:42:09] [INFO ] Input system was already deterministic with 1952 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1989/1989 places, 1989/1989 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 552 transitions
Trivial Post-agglo rules discarded 552 transitions
Performed 552 trivial Post agglomeration. Transition count delta: 552
Iterating post reduction 0 with 552 rules applied. Total rules applied 552 place count 1988 transition count 1436
Reduce places removed 552 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 553 rules applied. Total rules applied 1105 place count 1436 transition count 1435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1106 place count 1435 transition count 1435
Performed 374 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 374 Pre rules applied. Total rules applied 1106 place count 1435 transition count 1061
Deduced a syphon composed of 374 places in 2 ms
Reduce places removed 374 places and 0 transitions.
Iterating global reduction 3 with 748 rules applied. Total rules applied 1854 place count 1061 transition count 1061
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1883 place count 1032 transition count 1032
Iterating global reduction 3 with 29 rules applied. Total rules applied 1912 place count 1032 transition count 1032
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 1912 place count 1032 transition count 1004
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 1968 place count 1004 transition count 1004
Performed 395 Post agglomeration using F-continuation condition.Transition count delta: 395
Deduced a syphon composed of 395 places in 1 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 3 with 790 rules applied. Total rules applied 2758 place count 609 transition count 609
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2759 place count 609 transition count 608
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2761 place count 608 transition count 607
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2763 place count 606 transition count 605
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2764 place count 605 transition count 605
Applied a total of 2764 rules in 148 ms. Remains 605 /1989 variables (removed 1384) and now considering 605/1989 (removed 1384) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 148 ms. Remains : 605/1989 places, 605/1989 transitions.
[2024-06-01 21:42:09] [INFO ] Flatten gal took : 16 ms
[2024-06-01 21:42:09] [INFO ] Flatten gal took : 21 ms
[2024-06-01 21:42:09] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1989/1989 places, 1989/1989 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1955 transition count 1955
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1955 transition count 1955
Applied a total of 68 rules in 141 ms. Remains 1955 /1989 variables (removed 34) and now considering 1955/1989 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 1955/1989 places, 1955/1989 transitions.
[2024-06-01 21:42:09] [INFO ] Flatten gal took : 32 ms
[2024-06-01 21:42:09] [INFO ] Flatten gal took : 39 ms
[2024-06-01 21:42:09] [INFO ] Input system was already deterministic with 1955 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1989/1989 places, 1989/1989 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1952 transition count 1952
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1952 transition count 1952
Applied a total of 74 rules in 167 ms. Remains 1952 /1989 variables (removed 37) and now considering 1952/1989 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 1952/1989 places, 1952/1989 transitions.
[2024-06-01 21:42:09] [INFO ] Flatten gal took : 35 ms
[2024-06-01 21:42:09] [INFO ] Flatten gal took : 36 ms
[2024-06-01 21:42:09] [INFO ] Input system was already deterministic with 1952 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1989/1989 places, 1989/1989 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1952 transition count 1952
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1952 transition count 1952
Applied a total of 74 rules in 142 ms. Remains 1952 /1989 variables (removed 37) and now considering 1952/1989 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 1952/1989 places, 1952/1989 transitions.
[2024-06-01 21:42:10] [INFO ] Flatten gal took : 31 ms
[2024-06-01 21:42:10] [INFO ] Flatten gal took : 42 ms
[2024-06-01 21:42:10] [INFO ] Input system was already deterministic with 1952 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1989/1989 places, 1989/1989 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 548 transitions
Trivial Post-agglo rules discarded 548 transitions
Performed 548 trivial Post agglomeration. Transition count delta: 548
Iterating post reduction 0 with 548 rules applied. Total rules applied 548 place count 1988 transition count 1440
Reduce places removed 548 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 550 rules applied. Total rules applied 1098 place count 1440 transition count 1438
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1100 place count 1438 transition count 1438
Performed 376 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 376 Pre rules applied. Total rules applied 1100 place count 1438 transition count 1062
Deduced a syphon composed of 376 places in 2 ms
Reduce places removed 376 places and 0 transitions.
Iterating global reduction 3 with 752 rules applied. Total rules applied 1852 place count 1062 transition count 1062
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1881 place count 1033 transition count 1033
Iterating global reduction 3 with 29 rules applied. Total rules applied 1910 place count 1033 transition count 1033
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 1910 place count 1033 transition count 1005
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 1966 place count 1005 transition count 1005
Performed 398 Post agglomeration using F-continuation condition.Transition count delta: 398
Deduced a syphon composed of 398 places in 1 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 3 with 796 rules applied. Total rules applied 2762 place count 607 transition count 607
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2763 place count 607 transition count 606
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2765 place count 606 transition count 605
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2767 place count 604 transition count 603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2768 place count 603 transition count 603
Applied a total of 2768 rules in 183 ms. Remains 603 /1989 variables (removed 1386) and now considering 603/1989 (removed 1386) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 184 ms. Remains : 603/1989 places, 603/1989 transitions.
[2024-06-01 21:42:10] [INFO ] Flatten gal took : 13 ms
[2024-06-01 21:42:10] [INFO ] Flatten gal took : 13 ms
[2024-06-01 21:42:10] [INFO ] Input system was already deterministic with 603 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1989/1989 places, 1989/1989 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 1953 transition count 1953
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 1953 transition count 1953
Applied a total of 72 rules in 150 ms. Remains 1953 /1989 variables (removed 36) and now considering 1953/1989 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 1953/1989 places, 1953/1989 transitions.
[2024-06-01 21:42:10] [INFO ] Flatten gal took : 32 ms
[2024-06-01 21:42:10] [INFO ] Flatten gal took : 34 ms
[2024-06-01 21:42:10] [INFO ] Input system was already deterministic with 1953 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1989/1989 places, 1989/1989 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 1954 transition count 1954
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 1954 transition count 1954
Applied a total of 70 rules in 139 ms. Remains 1954 /1989 variables (removed 35) and now considering 1954/1989 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 1954/1989 places, 1954/1989 transitions.
[2024-06-01 21:42:10] [INFO ] Flatten gal took : 30 ms
[2024-06-01 21:42:10] [INFO ] Flatten gal took : 31 ms
[2024-06-01 21:42:11] [INFO ] Input system was already deterministic with 1954 transitions.
[2024-06-01 21:42:11] [INFO ] Flatten gal took : 33 ms
[2024-06-01 21:42:11] [INFO ] Flatten gal took : 32 ms
[2024-06-01 21:42:11] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-01 21:42:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1989 places, 1989 transitions and 4878 arcs took 9 ms.
Total runtime 228781 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldRVt-PT-050B-CTLFireability-2024-00
Could not compute solution for formula : ShieldRVt-PT-050B-CTLFireability-2024-01
Could not compute solution for formula : ShieldRVt-PT-050B-CTLFireability-2024-02
Could not compute solution for formula : ShieldRVt-PT-050B-CTLFireability-2024-03
Could not compute solution for formula : ShieldRVt-PT-050B-CTLFireability-2024-05
Could not compute solution for formula : ShieldRVt-PT-050B-CTLFireability-2024-06
Could not compute solution for formula : ShieldRVt-PT-050B-CTLFireability-2024-07
Could not compute solution for formula : ShieldRVt-PT-050B-CTLFireability-2024-08
Could not compute solution for formula : ShieldRVt-PT-050B-CTLFireability-2024-09
Could not compute solution for formula : ShieldRVt-PT-050B-CTLFireability-2024-10
Could not compute solution for formula : ShieldRVt-PT-050B-CTLFireability-2024-11
Could not compute solution for formula : ShieldRVt-PT-050B-CTLFireability-2023-12
Could not compute solution for formula : ShieldRVt-PT-050B-CTLFireability-2023-13
Could not compute solution for formula : ShieldRVt-PT-050B-CTLFireability-2023-14
Could not compute solution for formula : ShieldRVt-PT-050B-CTLFireability-2023-15

BK_STOP 1717278131503

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldRVt-PT-050B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/680/ctl_0_
ctl formula name ShieldRVt-PT-050B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/680/ctl_1_
ctl formula name ShieldRVt-PT-050B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/680/ctl_2_
ctl formula name ShieldRVt-PT-050B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/680/ctl_3_
ctl formula name ShieldRVt-PT-050B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/680/ctl_4_
ctl formula name ShieldRVt-PT-050B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/680/ctl_5_
ctl formula name ShieldRVt-PT-050B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/680/ctl_6_
ctl formula name ShieldRVt-PT-050B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/680/ctl_7_
ctl formula name ShieldRVt-PT-050B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/680/ctl_8_
ctl formula name ShieldRVt-PT-050B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/680/ctl_9_
ctl formula name ShieldRVt-PT-050B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/680/ctl_10_
ctl formula name ShieldRVt-PT-050B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/680/ctl_11_
ctl formula name ShieldRVt-PT-050B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/680/ctl_12_
ctl formula name ShieldRVt-PT-050B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/680/ctl_13_
ctl formula name ShieldRVt-PT-050B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/680/ctl_14_
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="ShieldRVt-PT-050B"
export BK_EXAMINATION="CTLFireability"
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 ShieldRVt-PT-050B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683762401034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-050B.tgz
mv ShieldRVt-PT-050B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;