Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r298-tajo-171654455200257.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBNT-COL-S10J30, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654455200257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.9K Apr 12 11:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 11:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 11:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 11:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 13:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 13:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717104504978

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S10J30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:28:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-30 21:28:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:28:26] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 21:28:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 21:28:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 579 ms
[2024-05-30 21:28:26] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 20 ms.
[2024-05-30 21:28:27] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 179 ms.
[2024-05-30 21:28:27] [INFO ] Unfolded 38 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
[2024-05-30 21:28:27] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-30 21:28:27] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-30 21:28:27] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 30 places in 30 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
RANDOM walk for 40000 steps (2240 resets) in 4622 ms. (8 steps per ms) remains 30/36 properties
BEST_FIRST walk for 4002 steps (40 resets) in 323 ms. (12 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (41 resets) in 248 ms. (16 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (40 resets) in 87 ms. (45 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (40 resets) in 102 ms. (38 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (40 resets) in 83 ms. (47 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (40 resets) in 79 ms. (50 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (40 resets) in 85 ms. (46 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (40 resets) in 75 ms. (52 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (40 resets) in 65 ms. (60 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (42 resets) in 65 ms. (60 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (40 resets) in 65 ms. (60 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (41 resets) in 63 ms. (62 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (41 resets) in 64 ms. (61 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (40 resets) in 65 ms. (60 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (40 resets) in 65 ms. (60 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 346 ms. (11 steps per ms) remains 27/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 10/27 properties
BEST_FIRST walk for 4003 steps (40 resets) in 271 ms. (14 steps per ms) remains 10/10 properties
[2024-05-30 21:28:29] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2024-05-30 21:28:29] [INFO ] Computed 92 invariants in 100 ms
[2024-05-30 21:28:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 541/626 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/626 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-30 21:28:31] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 11 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/626 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 32/658 variables, 32/88 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 6/664 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 1931/2595 variables, 664/757 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2595 variables, 1/758 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2595 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/2595 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2595/2595 variables, and 758 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5055 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 664/664 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 541/626 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/626 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/626 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 32/658 variables, 32/88 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 6/664 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 1931/2595 variables, 664/757 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2595 variables, 1/758 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2595 variables, 8/766 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2595/2595 variables, and 766 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 664/664 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 11453ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 85 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 80 place count 619 transition count 1905
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 80 place count 619 transition count 1872
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 146 place count 586 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 585 transition count 1871
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 585 transition count 1871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 152 place count 583 transition count 1869
Applied a total of 152 rules in 297 ms. Remains 583 /664 variables (removed 81) and now considering 1869/1940 (removed 71) transitions.
Running 1858 sub problems to find dead transitions.
[2024-05-30 21:28:41] [INFO ] Flow matrix only has 1860 transitions (discarded 9 similar events)
// Phase 1: matrix 1860 rows 583 cols
[2024-05-30 21:28:41] [INFO ] Computed 82 invariants in 101 ms
[2024-05-30 21:28:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 (/ 1.0 3.0))
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 (/ 1.0 3.0))
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 (/ 2.0 3.0))
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 (/ 2.0 3.0))
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 4.0)
(s202 4.0)
(s203 4.0)
(s204 4.0)
(s205 4.0)
(s206 4.0)
(s207 4.0)
(s208 4.0)
(s209 4.0)
(s210 4.0)
(s211 9.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 (/ 1.0 3.0))
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 (/ 2.0 3.0))
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)timeout

(s421 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/2443 variables, and 72 constraints, problems are : Problem set: 0 solved, 1858 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1858/858 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1858 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
[2024-05-30 21:29:21] [INFO ] Deduced a trap composed of 19 places in 395 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/2443 variables, and 73 constraints, problems are : Problem set: 0 solved, 1858 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/858 constraints, Known Traps: 1/1 constraints]
After SMT, in 58362ms problems are : Problem set: 0 solved, 1858 unsolved
Search for dead transitions found 0 dead transitions in 58385ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58705 ms. Remains : 583/664 places, 1869/1940 transitions.
RANDOM walk for 4000000 steps (260911 resets) in 59006 ms. (67 steps per ms) remains 1/10 properties
BEST_FIRST walk for 4000003 steps (35146 resets) in 10595 ms. (377 steps per ms) remains 1/1 properties
[2024-05-30 21:29:59] [INFO ] Flow matrix only has 1860 transitions (discarded 9 similar events)
[2024-05-30 21:29:59] [INFO ] Invariant cache hit.
[2024-05-30 21:29:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 108/119 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 453/572 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/581 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/582 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1860/2442 variables, 582/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2442 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/2442 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2443 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2443 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2443 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2443/2443 variables, and 666 constraints, problems are : Problem set: 0 solved, 1 unsolved in 906 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 583/583 constraints, ReadFeed: 1/1 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) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 108/119 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 453/572 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/581 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/582 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1860/2442 variables, 582/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2442 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2442 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2443 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2443 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2443 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2443 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2443/2443 variables, and 667 constraints, problems are : Problem set: 0 solved, 1 unsolved in 974 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 583/583 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1909ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 63 ms.
Support contains 1 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 1869/1869 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 583 transition count 1868
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 582 transition count 1868
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 582 transition count 1866
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 6 place count 580 transition count 1866
Applied a total of 6 rules in 153 ms. Remains 580 /583 variables (removed 3) and now considering 1866/1869 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 580/583 places, 1866/1869 transitions.
RANDOM walk for 4000002 steps (290658 resets) in 57345 ms. (69 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (35619 resets) in 10054 ms. (397 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 6092700 steps, run timeout after 51001 ms. (steps per millisecond=119 ) properties seen :0 out of 1
Probabilistic random walk after 6092700 steps, saw 1053546 distinct states, run finished after 51009 ms. (steps per millisecond=119 ) properties seen :0
[2024-05-30 21:31:09] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
// Phase 1: matrix 1857 rows 580 cols
[2024-05-30 21:31:09] [INFO ] Computed 82 invariants in 65 ms
[2024-05-30 21:31:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2437/2437 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 920 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2437 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2437 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2437 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2437/2437 variables, and 664 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1093 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2094ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 64 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 66 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 580/580 places, 1866/1866 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 63 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2024-05-30 21:31:11] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-30 21:31:11] [INFO ] Invariant cache hit.
[2024-05-30 21:31:12] [INFO ] Implicit Places using invariants in 646 ms returned []
[2024-05-30 21:31:12] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-30 21:31:12] [INFO ] Invariant cache hit.
[2024-05-30 21:31:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:31:15] [INFO ] Implicit Places using invariants and state equation in 3329 ms returned []
Implicit Place search using SMT with State Equation took 3984 ms to find 0 implicit places.
[2024-05-30 21:31:16] [INFO ] Redundant transitions in 102 ms returned []
Running 1855 sub problems to find dead transitions.
[2024-05-30 21:31:16] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-30 21:31:16] [INFO ] Invariant cache hit.
[2024-05-30 21:31:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1799 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1855 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/579 variables, 9/81 constraints. Problems are: Problem set: 558 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 579/2437 variables, and 81 constraints, problems are : Problem set: 558 solved, 1297 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 558 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 558 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 558 solved, 1297 unsolved
[2024-05-30 21:32:15] [INFO ] Deduced a trap composed of 96 places in 528 ms of which 5 ms to minimize.
[2024-05-30 21:32:15] [INFO ] Deduced a trap composed of 95 places in 421 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 2/74 constraints. Problems are: Problem set: 558 solved, 1297 unsolved
[2024-05-30 21:32:21] [INFO ] Deduced a trap composed of 18 places in 408 ms of which 2 ms to minimize.
[2024-05-30 21:32:27] [INFO ] Deduced a trap composed of 13 places in 291 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 2/76 constraints. Problems are: Problem set: 558 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 76 constraints, problems are : Problem set: 558 solved, 1297 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 442/855 constraints, Known Traps: 4/4 constraints]
After SMT, in 79424ms problems are : Problem set: 558 solved, 1297 unsolved
Search for dead transitions found 558 dead transitions in 79463ms
Found 558 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 558 transitions
Dead transitions reduction (with SMT) removed 558 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 580/580 places, 1308/1866 transitions.
Applied a total of 0 rules in 36 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2024-05-30 21:32:35] [INFO ] Redundant transitions in 67 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 83747 ms. Remains : 580/580 places, 1308/1866 transitions.
RANDOM walk for 4000000 steps (290855 resets) in 40474 ms. (98 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (35586 resets) in 7982 ms. (501 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 5897533 steps, run timeout after 36001 ms. (steps per millisecond=163 ) properties seen :0 out of 1
Probabilistic random walk after 5897533 steps, saw 1018854 distinct states, run finished after 36002 ms. (steps per millisecond=163 ) properties seen :0
[2024-05-30 21:33:23] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
// Phase 1: matrix 1299 rows 580 cols
[2024-05-30 21:33:23] [INFO ] Computed 82 invariants in 71 ms
[2024-05-30 21:33:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:33:24] [INFO ] Deduced a trap composed of 238 places in 266 ms of which 4 ms to minimize.
[2024-05-30 21:33:24] [INFO ] Deduced a trap composed of 236 places in 310 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/579 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1299/1878 variables, 579/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1878 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1879 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1879 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1879 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1879/1879 variables, and 665 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1241 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:33:25] [INFO ] Deduced a trap composed of 224 places in 293 ms of which 3 ms to minimize.
[2024-05-30 21:33:25] [INFO ] Deduced a trap composed of 238 places in 242 ms of which 3 ms to minimize.
[2024-05-30 21:33:26] [INFO ] Deduced a trap composed of 230 places in 276 ms of which 3 ms to minimize.
[2024-05-30 21:33:26] [INFO ] Deduced a trap composed of 232 places in 228 ms of which 3 ms to minimize.
[2024-05-30 21:33:26] [INFO ] Deduced a trap composed of 236 places in 274 ms of which 4 ms to minimize.
[2024-05-30 21:33:27] [INFO ] Deduced a trap composed of 234 places in 297 ms of which 5 ms to minimize.
[2024-05-30 21:33:27] [INFO ] Deduced a trap composed of 234 places in 254 ms of which 3 ms to minimize.
[2024-05-30 21:33:27] [INFO ] Deduced a trap composed of 236 places in 291 ms of which 4 ms to minimize.
[2024-05-30 21:33:27] [INFO ] Deduced a trap composed of 230 places in 306 ms of which 3 ms to minimize.
[2024-05-30 21:33:28] [INFO ] Deduced a trap composed of 232 places in 298 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/579 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/579 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1299/1878 variables, 579/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1878 variables, 1/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1878 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/1879 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1879 variables, 1/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1879 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1879 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1879/1879 variables, and 676 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3699 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 5028ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 32 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 580/580 places, 1308/1308 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 37 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2024-05-30 21:33:28] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-30 21:33:28] [INFO ] Invariant cache hit.
[2024-05-30 21:33:29] [INFO ] Implicit Places using invariants in 527 ms returned []
[2024-05-30 21:33:29] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-30 21:33:29] [INFO ] Invariant cache hit.
[2024-05-30 21:33:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:33:32] [INFO ] Implicit Places using invariants and state equation in 3029 ms returned []
Implicit Place search using SMT with State Equation took 3560 ms to find 0 implicit places.
[2024-05-30 21:33:32] [INFO ] Redundant transitions in 44 ms returned []
Running 1297 sub problems to find dead transitions.
[2024-05-30 21:33:32] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-30 21:33:32] [INFO ] Invariant cache hit.
[2024-05-30 21:33:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-30 21:33:50] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 5 ms to minimize.
[2024-05-30 21:33:50] [INFO ] Deduced a trap composed of 230 places in 221 ms of which 4 ms to minimize.
[2024-05-30 21:33:50] [INFO ] Deduced a trap composed of 234 places in 225 ms of which 4 ms to minimize.
[2024-05-30 21:33:51] [INFO ] Deduced a trap composed of 230 places in 278 ms of which 4 ms to minimize.
[2024-05-30 21:33:51] [INFO ] Deduced a trap composed of 238 places in 238 ms of which 4 ms to minimize.
[2024-05-30 21:33:51] [INFO ] Deduced a trap composed of 240 places in 235 ms of which 4 ms to minimize.
[2024-05-30 21:33:52] [INFO ] Deduced a trap composed of 244 places in 238 ms of which 3 ms to minimize.
[2024-05-30 21:33:52] [INFO ] Deduced a trap composed of 238 places in 252 ms of which 4 ms to minimize.
[2024-05-30 21:33:52] [INFO ] Deduced a trap composed of 242 places in 246 ms of which 4 ms to minimize.
[2024-05-30 21:33:52] [INFO ] Deduced a trap composed of 246 places in 242 ms of which 4 ms to minimize.
[2024-05-30 21:33:53] [INFO ] Deduced a trap composed of 246 places in 235 ms of which 4 ms to minimize.
[2024-05-30 21:33:53] [INFO ] Deduced a trap composed of 244 places in 234 ms of which 3 ms to minimize.
[2024-05-30 21:33:53] [INFO ] Deduced a trap composed of 236 places in 210 ms of which 3 ms to minimize.
[2024-05-30 21:33:53] [INFO ] Deduced a trap composed of 234 places in 214 ms of which 4 ms to minimize.
[2024-05-30 21:33:53] [INFO ] Deduced a trap composed of 230 places in 218 ms of which 3 ms to minimize.
[2024-05-30 21:33:54] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 4 ms to minimize.
[2024-05-30 21:33:54] [INFO ] Deduced a trap composed of 240 places in 214 ms of which 4 ms to minimize.
[2024-05-30 21:33:54] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 3 ms to minimize.
[2024-05-30 21:33:55] [INFO ] Deduced a trap composed of 156 places in 282 ms of which 4 ms to minimize.
[2024-05-30 21:33:55] [INFO ] Deduced a trap composed of 166 places in 284 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-30 21:33:56] [INFO ] Deduced a trap composed of 242 places in 291 ms of which 4 ms to minimize.
[2024-05-30 21:33:56] [INFO ] Deduced a trap composed of 238 places in 254 ms of which 5 ms to minimize.
[2024-05-30 21:33:56] [INFO ] Deduced a trap composed of 236 places in 238 ms of which 3 ms to minimize.
[2024-05-30 21:33:56] [INFO ] Deduced a trap composed of 151 places in 263 ms of which 4 ms to minimize.
[2024-05-30 21:33:57] [INFO ] Deduced a trap composed of 166 places in 292 ms of which 6 ms to minimize.
[2024-05-30 21:33:57] [INFO ] Deduced a trap composed of 166 places in 281 ms of which 5 ms to minimize.
[2024-05-30 21:33:57] [INFO ] Deduced a trap composed of 238 places in 266 ms of which 4 ms to minimize.
[2024-05-30 21:33:58] [INFO ] Deduced a trap composed of 238 places in 247 ms of which 4 ms to minimize.
[2024-05-30 21:33:58] [INFO ] Deduced a trap composed of 240 places in 255 ms of which 4 ms to minimize.
[2024-05-30 21:33:58] [INFO ] Deduced a trap composed of 242 places in 248 ms of which 4 ms to minimize.
[2024-05-30 21:33:59] [INFO ] Deduced a trap composed of 242 places in 251 ms of which 4 ms to minimize.
[2024-05-30 21:33:59] [INFO ] Deduced a trap composed of 246 places in 269 ms of which 3 ms to minimize.
[2024-05-30 21:33:59] [INFO ] Deduced a trap composed of 244 places in 274 ms of which 4 ms to minimize.
[2024-05-30 21:34:00] [INFO ] Deduced a trap composed of 238 places in 254 ms of which 4 ms to minimize.
[2024-05-30 21:34:00] [INFO ] Deduced a trap composed of 228 places in 287 ms of which 4 ms to minimize.
[2024-05-30 21:34:00] [INFO ] Deduced a trap composed of 228 places in 263 ms of which 4 ms to minimize.
[2024-05-30 21:34:00] [INFO ] Deduced a trap composed of 232 places in 303 ms of which 4 ms to minimize.
[2024-05-30 21:34:01] [INFO ] Deduced a trap composed of 232 places in 293 ms of which 6 ms to minimize.
[2024-05-30 21:34:01] [INFO ] Deduced a trap composed of 238 places in 280 ms of which 4 ms to minimize.
[2024-05-30 21:34:01] [INFO ] Deduced a trap composed of 238 places in 272 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1879 variables, and 112 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1297/1297 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-30 21:34:11] [INFO ] Deduced a trap composed of 171 places in 264 ms of which 4 ms to minimize.
[2024-05-30 21:34:11] [INFO ] Deduced a trap composed of 171 places in 247 ms of which 4 ms to minimize.
[2024-05-30 21:34:12] [INFO ] Deduced a trap composed of 156 places in 264 ms of which 4 ms to minimize.
[2024-05-30 21:34:12] [INFO ] Deduced a trap composed of 156 places in 254 ms of which 4 ms to minimize.
[2024-05-30 21:34:12] [INFO ] Deduced a trap composed of 161 places in 238 ms of which 4 ms to minimize.
[2024-05-30 21:34:12] [INFO ] Deduced a trap composed of 156 places in 238 ms of which 4 ms to minimize.
[2024-05-30 21:34:13] [INFO ] Deduced a trap composed of 151 places in 279 ms of which 4 ms to minimize.
[2024-05-30 21:34:13] [INFO ] Deduced a trap composed of 151 places in 245 ms of which 4 ms to minimize.
[2024-05-30 21:34:13] [INFO ] Deduced a trap composed of 171 places in 243 ms of which 4 ms to minimize.
[2024-05-30 21:34:14] [INFO ] Deduced a trap composed of 151 places in 219 ms of which 3 ms to minimize.
[2024-05-30 21:34:14] [INFO ] Deduced a trap composed of 146 places in 238 ms of which 4 ms to minimize.
[2024-05-30 21:34:14] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 4 ms to minimize.
[2024-05-30 21:34:14] [INFO ] Deduced a trap composed of 161 places in 255 ms of which 4 ms to minimize.
[2024-05-30 21:34:15] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 3 ms to minimize.
[2024-05-30 21:34:15] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 3 ms to minimize.
[2024-05-30 21:34:15] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 3 ms to minimize.
[2024-05-30 21:34:15] [INFO ] Deduced a trap composed of 146 places in 201 ms of which 3 ms to minimize.
[2024-05-30 21:34:15] [INFO ] Deduced a trap composed of 146 places in 199 ms of which 4 ms to minimize.
[2024-05-30 21:34:16] [INFO ] Deduced a trap composed of 161 places in 242 ms of which 3 ms to minimize.
[2024-05-30 21:34:16] [INFO ] Deduced a trap composed of 161 places in 265 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-30 21:34:17] [INFO ] Deduced a trap composed of 161 places in 269 ms of which 4 ms to minimize.
[2024-05-30 21:34:17] [INFO ] Deduced a trap composed of 156 places in 269 ms of which 4 ms to minimize.
[2024-05-30 21:34:18] [INFO ] Deduced a trap composed of 156 places in 281 ms of which 3 ms to minimize.
[2024-05-30 21:34:18] [INFO ] Deduced a trap composed of 156 places in 241 ms of which 4 ms to minimize.
[2024-05-30 21:34:18] [INFO ] Deduced a trap composed of 230 places in 241 ms of which 4 ms to minimize.
[2024-05-30 21:34:18] [INFO ] Deduced a trap composed of 151 places in 267 ms of which 4 ms to minimize.
[2024-05-30 21:34:19] [INFO ] Deduced a trap composed of 146 places in 238 ms of which 3 ms to minimize.
[2024-05-30 21:34:19] [INFO ] Deduced a trap composed of 146 places in 205 ms of which 3 ms to minimize.
[2024-05-30 21:34:19] [INFO ] Deduced a trap composed of 151 places in 228 ms of which 3 ms to minimize.
[2024-05-30 21:34:19] [INFO ] Deduced a trap composed of 146 places in 288 ms of which 4 ms to minimize.
[2024-05-30 21:34:20] [INFO ] Deduced a trap composed of 171 places in 277 ms of which 4 ms to minimize.
[2024-05-30 21:34:20] [INFO ] Deduced a trap composed of 171 places in 276 ms of which 4 ms to minimize.
[2024-05-30 21:34:20] [INFO ] Deduced a trap composed of 156 places in 265 ms of which 5 ms to minimize.
[2024-05-30 21:34:21] [INFO ] Deduced a trap composed of 156 places in 231 ms of which 3 ms to minimize.
[2024-05-30 21:34:21] [INFO ] Deduced a trap composed of 146 places in 215 ms of which 4 ms to minimize.
[2024-05-30 21:34:21] [INFO ] Deduced a trap composed of 161 places in 215 ms of which 4 ms to minimize.
[2024-05-30 21:34:21] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 4 ms to minimize.
[2024-05-30 21:34:22] [INFO ] Deduced a trap composed of 236 places in 355 ms of which 3 ms to minimize.
[2024-05-30 21:34:22] [INFO ] Deduced a trap composed of 243 places in 379 ms of which 4 ms to minimize.
[2024-05-30 21:34:22] [INFO ] Deduced a trap composed of 236 places in 361 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-30 21:34:24] [INFO ] Deduced a trap composed of 166 places in 293 ms of which 5 ms to minimize.
[2024-05-30 21:34:24] [INFO ] Deduced a trap composed of 166 places in 253 ms of which 3 ms to minimize.
[2024-05-30 21:34:24] [INFO ] Deduced a trap composed of 161 places in 236 ms of which 3 ms to minimize.
[2024-05-30 21:34:24] [INFO ] Deduced a trap composed of 141 places in 269 ms of which 4 ms to minimize.
[2024-05-30 21:34:25] [INFO ] Deduced a trap composed of 161 places in 243 ms of which 3 ms to minimize.
[2024-05-30 21:34:25] [INFO ] Deduced a trap composed of 156 places in 275 ms of which 5 ms to minimize.
[2024-05-30 21:34:25] [INFO ] Deduced a trap composed of 151 places in 266 ms of which 4 ms to minimize.
[2024-05-30 21:34:26] [INFO ] Deduced a trap composed of 146 places in 285 ms of which 4 ms to minimize.
[2024-05-30 21:34:26] [INFO ] Deduced a trap composed of 156 places in 266 ms of which 4 ms to minimize.
[2024-05-30 21:34:27] [INFO ] Deduced a trap composed of 18 places in 294 ms of which 2 ms to minimize.
[2024-05-30 21:34:28] [INFO ] Deduced a trap composed of 244 places in 349 ms of which 4 ms to minimize.
[2024-05-30 21:34:29] [INFO ] Deduced a trap composed of 171 places in 371 ms of which 5 ms to minimize.
[2024-05-30 21:34:29] [INFO ] Deduced a trap composed of 166 places in 401 ms of which 4 ms to minimize.
[2024-05-30 21:34:29] [INFO ] Deduced a trap composed of 151 places in 280 ms of which 3 ms to minimize.
[2024-05-30 21:34:30] [INFO ] Deduced a trap composed of 165 places in 415 ms of which 5 ms to minimize.
[2024-05-30 21:34:30] [INFO ] Deduced a trap composed of 156 places in 424 ms of which 6 ms to minimize.
[2024-05-30 21:34:31] [INFO ] Deduced a trap composed of 150 places in 405 ms of which 4 ms to minimize.
[2024-05-30 21:34:31] [INFO ] Deduced a trap composed of 141 places in 387 ms of which 4 ms to minimize.
[2024-05-30 21:34:31] [INFO ] Deduced a trap composed of 165 places in 379 ms of which 4 ms to minimize.
[2024-05-30 21:34:32] [INFO ] Deduced a trap composed of 166 places in 363 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-30 21:34:34] [INFO ] Deduced a trap composed of 234 places in 431 ms of which 5 ms to minimize.
[2024-05-30 21:34:35] [INFO ] Deduced a trap composed of 156 places in 419 ms of which 4 ms to minimize.
[2024-05-30 21:34:35] [INFO ] Deduced a trap composed of 165 places in 377 ms of which 4 ms to minimize.
[2024-05-30 21:34:35] [INFO ] Deduced a trap composed of 156 places in 349 ms of which 4 ms to minimize.
[2024-05-30 21:34:36] [INFO ] Deduced a trap composed of 232 places in 376 ms of which 4 ms to minimize.
[2024-05-30 21:34:36] [INFO ] Deduced a trap composed of 156 places in 357 ms of which 4 ms to minimize.
[2024-05-30 21:34:37] [INFO ] Deduced a trap composed of 180 places in 335 ms of which 4 ms to minimize.
[2024-05-30 21:34:37] [INFO ] Deduced a trap composed of 171 places in 287 ms of which 3 ms to minimize.
[2024-05-30 21:34:37] [INFO ] Deduced a trap composed of 160 places in 345 ms of which 4 ms to minimize.
[2024-05-30 21:34:38] [INFO ] Deduced a trap composed of 171 places in 377 ms of which 5 ms to minimize.
[2024-05-30 21:34:38] [INFO ] Deduced a trap composed of 161 places in 422 ms of which 4 ms to minimize.
[2024-05-30 21:34:39] [INFO ] Deduced a trap composed of 151 places in 450 ms of which 5 ms to minimize.
[2024-05-30 21:34:39] [INFO ] Deduced a trap composed of 146 places in 397 ms of which 4 ms to minimize.
[2024-05-30 21:34:40] [INFO ] Deduced a trap composed of 155 places in 396 ms of which 4 ms to minimize.
SMT process timed out in 67504ms, After SMT, problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 67528ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71185 ms. Remains : 580/580 places, 1308/1308 transitions.
RANDOM walk for 400000 steps (29084 resets) in 5410 ms. (73 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-30 21:34:41] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-30 21:34:41] [INFO ] Invariant cache hit.
[2024-05-30 21:34:41] [INFO ] [Real]Absence check using 75 positive place invariants in 24 ms returned sat
[2024-05-30 21:34:41] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 21 ms returned sat
[2024-05-30 21:34:42] [INFO ] After 332ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-30 21:34:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:34:42] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 21:34:42] [INFO ] After 59ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 21:34:42] [INFO ] After 568ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 21:34:42] [INFO ] [Nat]Absence check using 75 positive place invariants in 19 ms returned sat
[2024-05-30 21:34:42] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-30 21:34:42] [INFO ] After 373ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 21:34:42] [INFO ] After 71ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 21:34:43] [INFO ] Deduced a trap composed of 224 places in 389 ms of which 4 ms to minimize.
[2024-05-30 21:34:43] [INFO ] Deduced a trap composed of 228 places in 428 ms of which 4 ms to minimize.
[2024-05-30 21:34:44] [INFO ] Deduced a trap composed of 230 places in 407 ms of which 4 ms to minimize.
[2024-05-30 21:34:44] [INFO ] Deduced a trap composed of 232 places in 387 ms of which 4 ms to minimize.
[2024-05-30 21:34:45] [INFO ] Deduced a trap composed of 236 places in 351 ms of which 4 ms to minimize.
[2024-05-30 21:34:45] [INFO ] Deduced a trap composed of 228 places in 383 ms of which 4 ms to minimize.
[2024-05-30 21:34:45] [INFO ] Deduced a trap composed of 234 places in 366 ms of which 4 ms to minimize.
[2024-05-30 21:34:46] [INFO ] Deduced a trap composed of 240 places in 416 ms of which 4 ms to minimize.
[2024-05-30 21:34:46] [INFO ] Deduced a trap composed of 220 places in 419 ms of which 5 ms to minimize.
[2024-05-30 21:34:47] [INFO ] Deduced a trap composed of 232 places in 425 ms of which 4 ms to minimize.
[2024-05-30 21:34:47] [INFO ] Deduced a trap composed of 222 places in 413 ms of which 4 ms to minimize.
[2024-05-30 21:34:48] [INFO ] Deduced a trap composed of 232 places in 399 ms of which 4 ms to minimize.
[2024-05-30 21:34:48] [INFO ] Deduced a trap composed of 232 places in 374 ms of which 4 ms to minimize.
[2024-05-30 21:34:49] [INFO ] Deduced a trap composed of 230 places in 411 ms of which 4 ms to minimize.
[2024-05-30 21:34:49] [INFO ] Deduced a trap composed of 230 places in 399 ms of which 4 ms to minimize.
[2024-05-30 21:34:50] [INFO ] Deduced a trap composed of 232 places in 440 ms of which 4 ms to minimize.
[2024-05-30 21:34:51] [INFO ] Deduced a trap composed of 238 places in 436 ms of which 5 ms to minimize.
[2024-05-30 21:34:51] [INFO ] Deduced a trap composed of 236 places in 401 ms of which 5 ms to minimize.
[2024-05-30 21:34:52] [INFO ] Deduced a trap composed of 237 places in 410 ms of which 5 ms to minimize.
[2024-05-30 21:34:52] [INFO ] Deduced a trap composed of 228 places in 373 ms of which 4 ms to minimize.
[2024-05-30 21:34:53] [INFO ] Deduced a trap composed of 228 places in 376 ms of which 4 ms to minimize.
[2024-05-30 21:34:53] [INFO ] Deduced a trap composed of 245 places in 384 ms of which 4 ms to minimize.
[2024-05-30 21:34:54] [INFO ] Deduced a trap composed of 226 places in 380 ms of which 4 ms to minimize.
[2024-05-30 21:34:54] [INFO ] Deduced a trap composed of 228 places in 384 ms of which 4 ms to minimize.
[2024-05-30 21:34:55] [INFO ] Deduced a trap composed of 238 places in 407 ms of which 4 ms to minimize.
[2024-05-30 21:34:55] [INFO ] Deduced a trap composed of 230 places in 372 ms of which 4 ms to minimize.
[2024-05-30 21:34:56] [INFO ] Deduced a trap composed of 226 places in 402 ms of which 4 ms to minimize.
[2024-05-30 21:34:56] [INFO ] Deduced a trap composed of 232 places in 381 ms of which 4 ms to minimize.
[2024-05-30 21:34:57] [INFO ] Deduced a trap composed of 230 places in 395 ms of which 4 ms to minimize.
[2024-05-30 21:34:57] [INFO ] Deduced a trap composed of 232 places in 390 ms of which 4 ms to minimize.
[2024-05-30 21:35:02] [INFO ] Deduced a trap composed of 238 places in 403 ms of which 4 ms to minimize.
[2024-05-30 21:35:03] [INFO ] Deduced a trap composed of 230 places in 390 ms of which 4 ms to minimize.
[2024-05-30 21:35:03] [INFO ] Deduced a trap composed of 231 places in 392 ms of which 4 ms to minimize.
[2024-05-30 21:35:04] [INFO ] Deduced a trap composed of 237 places in 385 ms of which 4 ms to minimize.
[2024-05-30 21:35:05] [INFO ] Deduced a trap composed of 230 places in 398 ms of which 4 ms to minimize.
[2024-05-30 21:35:05] [INFO ] Deduced a trap composed of 226 places in 433 ms of which 4 ms to minimize.
[2024-05-30 21:35:06] [INFO ] Deduced a trap composed of 234 places in 423 ms of which 4 ms to minimize.
[2024-05-30 21:35:06] [INFO ] Deduced a trap composed of 236 places in 427 ms of which 4 ms to minimize.
[2024-05-30 21:35:07] [INFO ] Deduced a trap composed of 230 places in 418 ms of which 4 ms to minimize.
[2024-05-30 21:35:08] [INFO ] Deduced a trap composed of 228 places in 406 ms of which 4 ms to minimize.
[2024-05-30 21:35:08] [INFO ] Deduced a trap composed of 224 places in 394 ms of which 5 ms to minimize.
[2024-05-30 21:35:09] [INFO ] Deduced a trap composed of 230 places in 345 ms of which 3 ms to minimize.
[2024-05-30 21:35:09] [INFO ] Deduced a trap composed of 232 places in 363 ms of which 4 ms to minimize.
[2024-05-30 21:35:09] [INFO ] Deduced a trap composed of 232 places in 332 ms of which 4 ms to minimize.
[2024-05-30 21:35:10] [INFO ] Deduced a trap composed of 232 places in 379 ms of which 4 ms to minimize.
[2024-05-30 21:35:11] [INFO ] Deduced a trap composed of 220 places in 450 ms of which 5 ms to minimize.
[2024-05-30 21:35:12] [INFO ] Deduced a trap composed of 232 places in 425 ms of which 4 ms to minimize.
[2024-05-30 21:35:12] [INFO ] Deduced a trap composed of 228 places in 419 ms of which 4 ms to minimize.
[2024-05-30 21:35:13] [INFO ] Deduced a trap composed of 234 places in 447 ms of which 4 ms to minimize.
[2024-05-30 21:35:14] [INFO ] Deduced a trap composed of 226 places in 420 ms of which 4 ms to minimize.
[2024-05-30 21:35:14] [INFO ] Deduced a trap composed of 234 places in 323 ms of which 4 ms to minimize.
[2024-05-30 21:35:15] [INFO ] Deduced a trap composed of 226 places in 364 ms of which 4 ms to minimize.
[2024-05-30 21:35:17] [INFO ] Deduced a trap composed of 232 places in 377 ms of which 4 ms to minimize.
[2024-05-30 21:35:18] [INFO ] Deduced a trap composed of 228 places in 358 ms of which 4 ms to minimize.
[2024-05-30 21:35:20] [INFO ] Deduced a trap composed of 238 places in 397 ms of which 5 ms to minimize.
[2024-05-30 21:35:40] [INFO ] Trap strengthening (SAT) tested/added 55/55 trap constraints in 58148 ms
TRAPS : Iteration 1
[2024-05-30 21:35:41] [INFO ] After 58559ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-30 21:35:41] [INFO ] After 59064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
RANDOM walk for 4000000 steps (290457 resets) in 38982 ms. (102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (35999 resets) in 7443 ms. (537 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 5330105 steps, run timeout after 33001 ms. (steps per millisecond=161 ) properties seen :0 out of 1
Probabilistic random walk after 5330105 steps, saw 918344 distinct states, run finished after 33001 ms. (steps per millisecond=161 ) properties seen :0
[2024-05-30 21:36:26] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-30 21:36:26] [INFO ] Invariant cache hit.
[2024-05-30 21:36:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1299/1878 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1878 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1879 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1879/1879 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:36:27] [INFO ] Deduced a trap composed of 228 places in 320 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/579 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1299/1878 variables, 579/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1878 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1879 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1879 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1879 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1879 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1879/1879 variables, and 665 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1326 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2082ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 27 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 580/580 places, 1308/1308 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 25 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2024-05-30 21:36:28] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-30 21:36:28] [INFO ] Invariant cache hit.
[2024-05-30 21:36:28] [INFO ] Implicit Places using invariants in 512 ms returned []
[2024-05-30 21:36:28] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-30 21:36:28] [INFO ] Invariant cache hit.
[2024-05-30 21:36:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:36:31] [INFO ] Implicit Places using invariants and state equation in 2600 ms returned []
Implicit Place search using SMT with State Equation took 3115 ms to find 0 implicit places.
[2024-05-30 21:36:31] [INFO ] Redundant transitions in 29 ms returned []
Running 1297 sub problems to find dead transitions.
[2024-05-30 21:36:31] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-30 21:36:31] [INFO ] Invariant cache hit.
[2024-05-30 21:36:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-30 21:36:49] [INFO ] Deduced a trap composed of 236 places in 267 ms of which 4 ms to minimize.
[2024-05-30 21:36:49] [INFO ] Deduced a trap composed of 230 places in 237 ms of which 4 ms to minimize.
[2024-05-30 21:36:49] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 4 ms to minimize.
[2024-05-30 21:36:49] [INFO ] Deduced a trap composed of 230 places in 243 ms of which 4 ms to minimize.
[2024-05-30 21:36:50] [INFO ] Deduced a trap composed of 238 places in 212 ms of which 3 ms to minimize.
[2024-05-30 21:36:50] [INFO ] Deduced a trap composed of 240 places in 184 ms of which 3 ms to minimize.
[2024-05-30 21:36:50] [INFO ] Deduced a trap composed of 244 places in 188 ms of which 3 ms to minimize.
[2024-05-30 21:36:50] [INFO ] Deduced a trap composed of 238 places in 186 ms of which 3 ms to minimize.
[2024-05-30 21:36:51] [INFO ] Deduced a trap composed of 242 places in 239 ms of which 3 ms to minimize.
[2024-05-30 21:36:51] [INFO ] Deduced a trap composed of 246 places in 263 ms of which 4 ms to minimize.
[2024-05-30 21:36:51] [INFO ] Deduced a trap composed of 246 places in 255 ms of which 4 ms to minimize.
[2024-05-30 21:36:51] [INFO ] Deduced a trap composed of 244 places in 248 ms of which 5 ms to minimize.
[2024-05-30 21:36:52] [INFO ] Deduced a trap composed of 236 places in 283 ms of which 4 ms to minimize.
[2024-05-30 21:36:52] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 4 ms to minimize.
[2024-05-30 21:36:52] [INFO ] Deduced a trap composed of 230 places in 239 ms of which 4 ms to minimize.
[2024-05-30 21:36:52] [INFO ] Deduced a trap composed of 236 places in 247 ms of which 4 ms to minimize.
[2024-05-30 21:36:53] [INFO ] Deduced a trap composed of 240 places in 204 ms of which 3 ms to minimize.
[2024-05-30 21:36:53] [INFO ] Deduced a trap composed of 166 places in 258 ms of which 3 ms to minimize.
[2024-05-30 21:36:53] [INFO ] Deduced a trap composed of 156 places in 188 ms of which 3 ms to minimize.
[2024-05-30 21:36:53] [INFO ] Deduced a trap composed of 166 places in 239 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-30 21:36:54] [INFO ] Deduced a trap composed of 242 places in 222 ms of which 3 ms to minimize.
[2024-05-30 21:36:54] [INFO ] Deduced a trap composed of 238 places in 221 ms of which 4 ms to minimize.
[2024-05-30 21:36:55] [INFO ] Deduced a trap composed of 236 places in 222 ms of which 3 ms to minimize.
[2024-05-30 21:36:55] [INFO ] Deduced a trap composed of 151 places in 231 ms of which 4 ms to minimize.
[2024-05-30 21:36:55] [INFO ] Deduced a trap composed of 166 places in 260 ms of which 4 ms to minimize.
[2024-05-30 21:36:55] [INFO ] Deduced a trap composed of 166 places in 251 ms of which 4 ms to minimize.
[2024-05-30 21:36:56] [INFO ] Deduced a trap composed of 238 places in 218 ms of which 7 ms to minimize.
[2024-05-30 21:36:56] [INFO ] Deduced a trap composed of 238 places in 276 ms of which 4 ms to minimize.
[2024-05-30 21:36:56] [INFO ] Deduced a trap composed of 240 places in 235 ms of which 4 ms to minimize.
[2024-05-30 21:36:57] [INFO ] Deduced a trap composed of 242 places in 285 ms of which 5 ms to minimize.
[2024-05-30 21:36:57] [INFO ] Deduced a trap composed of 242 places in 280 ms of which 4 ms to minimize.
[2024-05-30 21:36:57] [INFO ] Deduced a trap composed of 246 places in 261 ms of which 4 ms to minimize.
[2024-05-30 21:36:57] [INFO ] Deduced a trap composed of 244 places in 266 ms of which 4 ms to minimize.
[2024-05-30 21:36:58] [INFO ] Deduced a trap composed of 238 places in 286 ms of which 4 ms to minimize.
[2024-05-30 21:36:58] [INFO ] Deduced a trap composed of 228 places in 300 ms of which 4 ms to minimize.
[2024-05-30 21:36:58] [INFO ] Deduced a trap composed of 228 places in 280 ms of which 4 ms to minimize.
[2024-05-30 21:36:59] [INFO ] Deduced a trap composed of 232 places in 267 ms of which 4 ms to minimize.
[2024-05-30 21:36:59] [INFO ] Deduced a trap composed of 232 places in 283 ms of which 4 ms to minimize.
[2024-05-30 21:36:59] [INFO ] Deduced a trap composed of 238 places in 286 ms of which 4 ms to minimize.
[2024-05-30 21:37:00] [INFO ] Deduced a trap composed of 238 places in 288 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 timeout
0.0)
(s144 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1879 variables, and 112 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1297/1297 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-30 21:37:10] [INFO ] Deduced a trap composed of 171 places in 251 ms of which 4 ms to minimize.
[2024-05-30 21:37:10] [INFO ] Deduced a trap composed of 171 places in 210 ms of which 4 ms to minimize.
[2024-05-30 21:37:10] [INFO ] Deduced a trap composed of 156 places in 243 ms of which 4 ms to minimize.
[2024-05-30 21:37:11] [INFO ] Deduced a trap composed of 156 places in 279 ms of which 6 ms to minimize.
[2024-05-30 21:37:11] [INFO ] Deduced a trap composed of 161 places in 253 ms of which 4 ms to minimize.
[2024-05-30 21:37:11] [INFO ] Deduced a trap composed of 156 places in 241 ms of which 4 ms to minimize.
[2024-05-30 21:37:11] [INFO ] Deduced a trap composed of 151 places in 242 ms of which 4 ms to minimize.
[2024-05-30 21:37:12] [INFO ] Deduced a trap composed of 151 places in 216 ms of which 4 ms to minimize.
[2024-05-30 21:37:12] [INFO ] Deduced a trap composed of 171 places in 276 ms of which 4 ms to minimize.
[2024-05-30 21:37:12] [INFO ] Deduced a trap composed of 151 places in 240 ms of which 3 ms to minimize.
[2024-05-30 21:37:13] [INFO ] Deduced a trap composed of 146 places in 207 ms of which 3 ms to minimize.
[2024-05-30 21:37:13] [INFO ] Deduced a trap composed of 156 places in 252 ms of which 3 ms to minimize.
[2024-05-30 21:37:13] [INFO ] Deduced a trap composed of 161 places in 205 ms of which 3 ms to minimize.
[2024-05-30 21:37:13] [INFO ] Deduced a trap composed of 166 places in 245 ms of which 3 ms to minimize.
[2024-05-30 21:37:14] [INFO ] Deduced a trap composed of 156 places in 236 ms of which 3 ms to minimize.
[2024-05-30 21:37:14] [INFO ] Deduced a trap composed of 156 places in 224 ms of which 4 ms to minimize.
[2024-05-30 21:37:14] [INFO ] Deduced a trap composed of 146 places in 237 ms of which 3 ms to minimize.
[2024-05-30 21:37:14] [INFO ] Deduced a trap composed of 146 places in 204 ms of which 3 ms to minimize.
[2024-05-30 21:37:15] [INFO ] Deduced a trap composed of 161 places in 223 ms of which 3 ms to minimize.
[2024-05-30 21:37:15] [INFO ] Deduced a trap composed of 161 places in 248 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-30 21:37:16] [INFO ] Deduced a trap composed of 161 places in 271 ms of which 5 ms to minimize.
[2024-05-30 21:37:16] [INFO ] Deduced a trap composed of 156 places in 239 ms of which 4 ms to minimize.
[2024-05-30 21:37:16] [INFO ] Deduced a trap composed of 156 places in 244 ms of which 4 ms to minimize.
[2024-05-30 21:37:16] [INFO ] Deduced a trap composed of 156 places in 297 ms of which 4 ms to minimize.
[2024-05-30 21:37:17] [INFO ] Deduced a trap composed of 230 places in 225 ms of which 3 ms to minimize.
[2024-05-30 21:37:17] [INFO ] Deduced a trap composed of 151 places in 280 ms of which 4 ms to minimize.
[2024-05-30 21:37:17] [INFO ] Deduced a trap composed of 146 places in 179 ms of which 3 ms to minimize.
[2024-05-30 21:37:17] [INFO ] Deduced a trap composed of 146 places in 280 ms of which 6 ms to minimize.
[2024-05-30 21:37:18] [INFO ] Deduced a trap composed of 151 places in 201 ms of which 3 ms to minimize.
[2024-05-30 21:37:18] [INFO ] Deduced a trap composed of 146 places in 205 ms of which 4 ms to minimize.
[2024-05-30 21:37:18] [INFO ] Deduced a trap composed of 171 places in 270 ms of which 3 ms to minimize.
[2024-05-30 21:37:18] [INFO ] Deduced a trap composed of 171 places in 191 ms of which 4 ms to minimize.
[2024-05-30 21:37:19] [INFO ] Deduced a trap composed of 156 places in 214 ms of which 4 ms to minimize.
[2024-05-30 21:37:19] [INFO ] Deduced a trap composed of 156 places in 212 ms of which 4 ms to minimize.
[2024-05-30 21:37:19] [INFO ] Deduced a trap composed of 146 places in 255 ms of which 4 ms to minimize.
[2024-05-30 21:37:19] [INFO ] Deduced a trap composed of 161 places in 236 ms of which 4 ms to minimize.
[2024-05-30 21:37:20] [INFO ] Deduced a trap composed of 166 places in 232 ms of which 3 ms to minimize.
[2024-05-30 21:37:20] [INFO ] Deduced a trap composed of 236 places in 359 ms of which 4 ms to minimize.
[2024-05-30 21:37:20] [INFO ] Deduced a trap composed of 243 places in 376 ms of which 4 ms to minimize.
[2024-05-30 21:37:21] [INFO ] Deduced a trap composed of 236 places in 322 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-30 21:37:22] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 3 ms to minimize.
[2024-05-30 21:37:22] [INFO ] Deduced a trap composed of 166 places in 189 ms of which 3 ms to minimize.
[2024-05-30 21:37:22] [INFO ] Deduced a trap composed of 161 places in 223 ms of which 3 ms to minimize.
[2024-05-30 21:37:22] [INFO ] Deduced a trap composed of 141 places in 209 ms of which 3 ms to minimize.
[2024-05-30 21:37:23] [INFO ] Deduced a trap composed of 161 places in 206 ms of which 4 ms to minimize.
[2024-05-30 21:37:23] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 5 ms to minimize.
[2024-05-30 21:37:23] [INFO ] Deduced a trap composed of 151 places in 270 ms of which 4 ms to minimize.
[2024-05-30 21:37:24] [INFO ] Deduced a trap composed of 146 places in 174 ms of which 3 ms to minimize.
[2024-05-30 21:37:24] [INFO ] Deduced a trap composed of 156 places in 243 ms of which 4 ms to minimize.
[2024-05-30 21:37:25] [INFO ] Deduced a trap composed of 18 places in 266 ms of which 2 ms to minimize.
[2024-05-30 21:37:26] [INFO ] Deduced a trap composed of 244 places in 266 ms of which 4 ms to minimize.
[2024-05-30 21:37:26] [INFO ] Deduced a trap composed of 171 places in 275 ms of which 3 ms to minimize.
[2024-05-30 21:37:26] [INFO ] Deduced a trap composed of 166 places in 327 ms of which 3 ms to minimize.
[2024-05-30 21:37:27] [INFO ] Deduced a trap composed of 151 places in 275 ms of which 4 ms to minimize.
[2024-05-30 21:37:27] [INFO ] Deduced a trap composed of 165 places in 281 ms of which 4 ms to minimize.
[2024-05-30 21:37:27] [INFO ] Deduced a trap composed of 156 places in 313 ms of which 4 ms to minimize.
[2024-05-30 21:37:27] [INFO ] Deduced a trap composed of 150 places in 268 ms of which 3 ms to minimize.
[2024-05-30 21:37:28] [INFO ] Deduced a trap composed of 141 places in 315 ms of which 4 ms to minimize.
[2024-05-30 21:37:28] [INFO ] Deduced a trap composed of 165 places in 325 ms of which 3 ms to minimize.
[2024-05-30 21:37:28] [INFO ] Deduced a trap composed of 166 places in 294 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-30 21:37:31] [INFO ] Deduced a trap composed of 234 places in 280 ms of which 3 ms to minimize.
[2024-05-30 21:37:31] [INFO ] Deduced a trap composed of 156 places in 327 ms of which 4 ms to minimize.
[2024-05-30 21:37:31] [INFO ] Deduced a trap composed of 165 places in 319 ms of which 4 ms to minimize.
[2024-05-30 21:37:32] [INFO ] Deduced a trap composed of 156 places in 324 ms of which 4 ms to minimize.
[2024-05-30 21:37:32] [INFO ] Deduced a trap composed of 232 places in 323 ms of which 4 ms to minimize.
[2024-05-30 21:37:32] [INFO ] Deduced a trap composed of 156 places in 270 ms of which 3 ms to minimize.
[2024-05-30 21:37:33] [INFO ] Deduced a trap composed of 180 places in 323 ms of which 3 ms to minimize.
[2024-05-30 21:37:33] [INFO ] Deduced a trap composed of 171 places in 325 ms of which 3 ms to minimize.
[2024-05-30 21:37:33] [INFO ] Deduced a trap composed of 160 places in 318 ms of which 4 ms to minimize.
[2024-05-30 21:37:34] [INFO ] Deduced a trap composed of 171 places in 308 ms of which 3 ms to minimize.
[2024-05-30 21:37:34] [INFO ] Deduced a trap composed of 161 places in 273 ms of which 3 ms to minimize.
[2024-05-30 21:37:34] [INFO ] Deduced a trap composed of 151 places in 314 ms of which 4 ms to minimize.
[2024-05-30 21:37:35] [INFO ] Deduced a trap composed of 146 places in 309 ms of which 4 ms to minimize.
[2024-05-30 21:37:35] [INFO ] Deduced a trap composed of 155 places in 363 ms of which 4 ms to minimize.
[2024-05-30 21:37:35] [INFO ] Deduced a trap composed of 175 places in 277 ms of which 3 ms to minimize.
[2024-05-30 21:37:36] [INFO ] Deduced a trap composed of 165 places in 331 ms of which 3 ms to minimize.
[2024-05-30 21:37:36] [INFO ] Deduced a trap composed of 195 places in 322 ms of which 3 ms to minimize.
[2024-05-30 21:37:36] [INFO ] Deduced a trap composed of 180 places in 313 ms of which 4 ms to minimize.
[2024-05-30 21:37:37] [INFO ] Deduced a trap composed of 170 places in 313 ms of which 3 ms to minimize.
[2024-05-30 21:37:37] [INFO ] Deduced a trap composed of 175 places in 321 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1879 variables, and 192 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1297 constraints, Known Traps: 120/120 constraints]
After SMT, in 67256ms problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 67282ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70470 ms. Remains : 580/580 places, 1308/1308 transitions.
RANDOM walk for 400000 steps (29291 resets) in 3955 ms. (101 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-30 21:37:39] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-30 21:37:39] [INFO ] Invariant cache hit.
[2024-05-30 21:37:39] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2024-05-30 21:37:39] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-30 21:37:40] [INFO ] After 355ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-30 21:37:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:37:40] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 21:37:40] [INFO ] After 62ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 21:37:40] [INFO ] After 521ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 21:37:40] [INFO ] [Nat]Absence check using 75 positive place invariants in 15 ms returned sat
[2024-05-30 21:37:40] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-30 21:37:40] [INFO ] After 305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 21:37:40] [INFO ] After 55ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 21:37:40] [INFO ] Deduced a trap composed of 224 places in 274 ms of which 3 ms to minimize.
[2024-05-30 21:37:41] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 3 ms to minimize.
[2024-05-30 21:37:41] [INFO ] Deduced a trap composed of 230 places in 313 ms of which 3 ms to minimize.
[2024-05-30 21:37:42] [INFO ] Deduced a trap composed of 232 places in 344 ms of which 3 ms to minimize.
[2024-05-30 21:37:42] [INFO ] Deduced a trap composed of 236 places in 322 ms of which 3 ms to minimize.
[2024-05-30 21:37:42] [INFO ] Deduced a trap composed of 228 places in 323 ms of which 3 ms to minimize.
[2024-05-30 21:37:43] [INFO ] Deduced a trap composed of 234 places in 308 ms of which 4 ms to minimize.
[2024-05-30 21:37:43] [INFO ] Deduced a trap composed of 240 places in 349 ms of which 4 ms to minimize.
[2024-05-30 21:37:43] [INFO ] Deduced a trap composed of 220 places in 317 ms of which 3 ms to minimize.
[2024-05-30 21:37:44] [INFO ] Deduced a trap composed of 232 places in 317 ms of which 4 ms to minimize.
[2024-05-30 21:37:44] [INFO ] Deduced a trap composed of 222 places in 316 ms of which 3 ms to minimize.
[2024-05-30 21:37:44] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 3 ms to minimize.
[2024-05-30 21:37:45] [INFO ] Deduced a trap composed of 232 places in 283 ms of which 3 ms to minimize.
[2024-05-30 21:37:45] [INFO ] Deduced a trap composed of 230 places in 272 ms of which 3 ms to minimize.
[2024-05-30 21:37:45] [INFO ] Deduced a trap composed of 230 places in 311 ms of which 3 ms to minimize.
[2024-05-30 21:37:46] [INFO ] Deduced a trap composed of 232 places in 281 ms of which 3 ms to minimize.
[2024-05-30 21:37:46] [INFO ] Deduced a trap composed of 238 places in 276 ms of which 3 ms to minimize.
[2024-05-30 21:37:47] [INFO ] Deduced a trap composed of 236 places in 272 ms of which 3 ms to minimize.
[2024-05-30 21:37:47] [INFO ] Deduced a trap composed of 237 places in 294 ms of which 3 ms to minimize.
[2024-05-30 21:37:47] [INFO ] Deduced a trap composed of 228 places in 271 ms of which 3 ms to minimize.
[2024-05-30 21:37:48] [INFO ] Deduced a trap composed of 228 places in 258 ms of which 3 ms to minimize.
[2024-05-30 21:37:48] [INFO ] Deduced a trap composed of 245 places in 308 ms of which 4 ms to minimize.
[2024-05-30 21:37:49] [INFO ] Deduced a trap composed of 226 places in 282 ms of which 3 ms to minimize.
[2024-05-30 21:37:49] [INFO ] Deduced a trap composed of 228 places in 277 ms of which 3 ms to minimize.
[2024-05-30 21:37:50] [INFO ] Deduced a trap composed of 238 places in 257 ms of which 3 ms to minimize.
[2024-05-30 21:37:50] [INFO ] Deduced a trap composed of 230 places in 377 ms of which 3 ms to minimize.
[2024-05-30 21:37:51] [INFO ] Deduced a trap composed of 226 places in 315 ms of which 3 ms to minimize.
[2024-05-30 21:37:51] [INFO ] Deduced a trap composed of 232 places in 358 ms of which 4 ms to minimize.
[2024-05-30 21:37:52] [INFO ] Deduced a trap composed of 230 places in 396 ms of which 3 ms to minimize.
[2024-05-30 21:37:52] [INFO ] Deduced a trap composed of 232 places in 369 ms of which 4 ms to minimize.
[2024-05-30 21:37:56] [INFO ] Deduced a trap composed of 238 places in 285 ms of which 3 ms to minimize.
[2024-05-30 21:37:57] [INFO ] Deduced a trap composed of 230 places in 323 ms of which 3 ms to minimize.
[2024-05-30 21:37:58] [INFO ] Deduced a trap composed of 231 places in 354 ms of which 4 ms to minimize.
[2024-05-30 21:37:58] [INFO ] Deduced a trap composed of 237 places in 298 ms of which 4 ms to minimize.
[2024-05-30 21:37:59] [INFO ] Deduced a trap composed of 230 places in 391 ms of which 4 ms to minimize.
[2024-05-30 21:37:59] [INFO ] Deduced a trap composed of 226 places in 392 ms of which 4 ms to minimize.
[2024-05-30 21:38:00] [INFO ] Deduced a trap composed of 234 places in 349 ms of which 3 ms to minimize.
[2024-05-30 21:38:00] [INFO ] Deduced a trap composed of 236 places in 264 ms of which 3 ms to minimize.
[2024-05-30 21:38:01] [INFO ] Deduced a trap composed of 230 places in 308 ms of which 4 ms to minimize.
[2024-05-30 21:38:01] [INFO ] Deduced a trap composed of 228 places in 311 ms of which 3 ms to minimize.
[2024-05-30 21:38:02] [INFO ] Deduced a trap composed of 224 places in 344 ms of which 3 ms to minimize.
[2024-05-30 21:38:02] [INFO ] Deduced a trap composed of 230 places in 322 ms of which 3 ms to minimize.
[2024-05-30 21:38:02] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 3 ms to minimize.
[2024-05-30 21:38:03] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 3 ms to minimize.
[2024-05-30 21:38:03] [INFO ] Deduced a trap composed of 232 places in 313 ms of which 3 ms to minimize.
[2024-05-30 21:38:04] [INFO ] Deduced a trap composed of 220 places in 380 ms of which 4 ms to minimize.
[2024-05-30 21:38:05] [INFO ] Deduced a trap composed of 232 places in 267 ms of which 4 ms to minimize.
[2024-05-30 21:38:05] [INFO ] Deduced a trap composed of 228 places in 383 ms of which 4 ms to minimize.
[2024-05-30 21:38:05] [INFO ] Deduced a trap composed of 234 places in 267 ms of which 3 ms to minimize.
[2024-05-30 21:38:06] [INFO ] Deduced a trap composed of 226 places in 381 ms of which 3 ms to minimize.
[2024-05-30 21:38:06] [INFO ] Deduced a trap composed of 234 places in 377 ms of which 3 ms to minimize.
[2024-05-30 21:38:07] [INFO ] Deduced a trap composed of 226 places in 368 ms of which 4 ms to minimize.
[2024-05-30 21:38:09] [INFO ] Deduced a trap composed of 232 places in 361 ms of which 3 ms to minimize.
[2024-05-30 21:38:10] [INFO ] Deduced a trap composed of 228 places in 365 ms of which 3 ms to minimize.
[2024-05-30 21:38:12] [INFO ] Deduced a trap composed of 238 places in 347 ms of which 3 ms to minimize.
[2024-05-30 21:38:32] [INFO ] Trap strengthening (SAT) tested/added 55/55 trap constraints in 52192 ms
TRAPS : Iteration 1
[2024-05-30 21:38:33] [INFO ] After 52535ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-30 21:38:33] [INFO ] After 52948ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
RANDOM walk for 40000 steps (2920 resets) in 621 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (335 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 460355 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 1
Probabilistic random walk after 460355 steps, saw 74515 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
[2024-05-30 21:38:36] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-30 21:38:36] [INFO ] Invariant cache hit.
[2024-05-30 21:38:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1299/1878 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1878 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1879 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1879/1879 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1299/1878 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1878 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:38:37] [INFO ] Deduced a trap composed of 238 places in 360 ms of which 4 ms to minimize.
[2024-05-30 21:38:38] [INFO ] Deduced a trap composed of 239 places in 368 ms of which 4 ms to minimize.
[2024-05-30 21:38:38] [INFO ] Deduced a trap composed of 230 places in 356 ms of which 5 ms to minimize.
[2024-05-30 21:38:39] [INFO ] Deduced a trap composed of 232 places in 308 ms of which 4 ms to minimize.
[2024-05-30 21:38:39] [INFO ] Deduced a trap composed of 232 places in 304 ms of which 4 ms to minimize.
[2024-05-30 21:38:39] [INFO ] Deduced a trap composed of 230 places in 319 ms of which 4 ms to minimize.
[2024-05-30 21:38:40] [INFO ] Deduced a trap composed of 226 places in 310 ms of which 4 ms to minimize.
[2024-05-30 21:38:40] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 4 ms to minimize.
[2024-05-30 21:38:40] [INFO ] Deduced a trap composed of 232 places in 281 ms of which 4 ms to minimize.
[2024-05-30 21:38:41] [INFO ] Deduced a trap composed of 238 places in 301 ms of which 4 ms to minimize.
[2024-05-30 21:38:41] [INFO ] Deduced a trap composed of 236 places in 273 ms of which 4 ms to minimize.
[2024-05-30 21:38:42] [INFO ] Deduced a trap composed of 232 places in 302 ms of which 3 ms to minimize.
SMT process timed out in 5874ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 34 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Running 1297 sub problems to find dead transitions.
[2024-05-30 21:38:42] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-30 21:38:42] [INFO ] Invariant cache hit.
[2024-05-30 21:38:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-30 21:38:58] [INFO ] Deduced a trap composed of 236 places in 275 ms of which 4 ms to minimize.
[2024-05-30 21:38:58] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 4 ms to minimize.
[2024-05-30 21:38:58] [INFO ] Deduced a trap composed of 234 places in 196 ms of which 3 ms to minimize.
[2024-05-30 21:38:58] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 3 ms to minimize.
[2024-05-30 21:38:59] [INFO ] Deduced a trap composed of 238 places in 226 ms of which 3 ms to minimize.
[2024-05-30 21:38:59] [INFO ] Deduced a trap composed of 240 places in 206 ms of which 3 ms to minimize.
[2024-05-30 21:38:59] [INFO ] Deduced a trap composed of 244 places in 224 ms of which 3 ms to minimize.
[2024-05-30 21:38:59] [INFO ] Deduced a trap composed of 238 places in 284 ms of which 5 ms to minimize.
[2024-05-30 21:39:00] [INFO ] Deduced a trap composed of 242 places in 318 ms of which 4 ms to minimize.
[2024-05-30 21:39:00] [INFO ] Deduced a trap composed of 246 places in 289 ms of which 4 ms to minimize.
[2024-05-30 21:39:00] [INFO ] Deduced a trap composed of 246 places in 266 ms of which 4 ms to minimize.
[2024-05-30 21:39:01] [INFO ] Deduced a trap composed of 244 places in 286 ms of which 4 ms to minimize.
[2024-05-30 21:39:01] [INFO ] Deduced a trap composed of 236 places in 237 ms of which 3 ms to minimize.
[2024-05-30 21:39:01] [INFO ] Deduced a trap composed of 234 places in 226 ms of which 3 ms to minimize.
[2024-05-30 21:39:01] [INFO ] Deduced a trap composed of 230 places in 223 ms of which 3 ms to minimize.
[2024-05-30 21:39:02] [INFO ] Deduced a trap composed of 236 places in 210 ms of which 3 ms to minimize.
[2024-05-30 21:39:02] [INFO ] Deduced a trap composed of 240 places in 260 ms of which 3 ms to minimize.
[2024-05-30 21:39:02] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 4 ms to minimize.
[2024-05-30 21:39:03] [INFO ] Deduced a trap composed of 156 places in 294 ms of which 4 ms to minimize.
[2024-05-30 21:39:03] [INFO ] Deduced a trap composed of 166 places in 272 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-30 21:39:04] [INFO ] Deduced a trap composed of 242 places in 269 ms of which 4 ms to minimize.
[2024-05-30 21:39:04] [INFO ] Deduced a trap composed of 238 places in 254 ms of which 4 ms to minimize.
[2024-05-30 21:39:04] [INFO ] Deduced a trap composed of 236 places in 275 ms of which 4 ms to minimize.
[2024-05-30 21:39:04] [INFO ] Deduced a trap composed of 151 places in 265 ms of which 4 ms to minimize.
[2024-05-30 21:39:05] [INFO ] Deduced a trap composed of 166 places in 265 ms of which 4 ms to minimize.
[2024-05-30 21:39:05] [INFO ] Deduced a trap composed of 166 places in 281 ms of which 4 ms to minimize.
[2024-05-30 21:39:05] [INFO ] Deduced a trap composed of 238 places in 261 ms of which 4 ms to minimize.
[2024-05-30 21:39:06] [INFO ] Deduced a trap composed of 238 places in 260 ms of which 4 ms to minimize.
[2024-05-30 21:39:06] [INFO ] Deduced a trap composed of 240 places in 245 ms of which 4 ms to minimize.
[2024-05-30 21:39:06] [INFO ] Deduced a trap composed of 242 places in 211 ms of which 4 ms to minimize.
[2024-05-30 21:39:07] [INFO ] Deduced a trap composed of 242 places in 236 ms of which 4 ms to minimize.
[2024-05-30 21:39:07] [INFO ] Deduced a trap composed of 246 places in 236 ms of which 4 ms to minimize.
[2024-05-30 21:39:07] [INFO ] Deduced a trap composed of 244 places in 290 ms of which 4 ms to minimize.
[2024-05-30 21:39:07] [INFO ] Deduced a trap composed of 238 places in 232 ms of which 4 ms to minimize.
[2024-05-30 21:39:08] [INFO ] Deduced a trap composed of 228 places in 264 ms of which 4 ms to minimize.
[2024-05-30 21:39:08] [INFO ] Deduced a trap composed of 228 places in 206 ms of which 3 ms to minimize.
[2024-05-30 21:39:08] [INFO ] Deduced a trap composed of 232 places in 181 ms of which 3 ms to minimize.
SMT process timed out in 26204ms, After SMT, problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 26225ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26264 ms. Remains : 580/580 places, 1308/1308 transitions.
RANDOM walk for 40000 steps (2930 resets) in 481 ms. (82 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (351 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 431935 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 1
Probabilistic random walk after 431935 steps, saw 69674 distinct states, run finished after 3003 ms. (steps per millisecond=143 ) properties seen :0
[2024-05-30 21:39:11] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-30 21:39:11] [INFO ] Invariant cache hit.
[2024-05-30 21:39:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1299/1878 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1878 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1879 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1879/1879 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1299/1878 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1878 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:39:13] [INFO ] Deduced a trap composed of 238 places in 406 ms of which 4 ms to minimize.
[2024-05-30 21:39:13] [INFO ] Deduced a trap composed of 239 places in 357 ms of which 4 ms to minimize.
[2024-05-30 21:39:14] [INFO ] Deduced a trap composed of 230 places in 350 ms of which 4 ms to minimize.
[2024-05-30 21:39:14] [INFO ] Deduced a trap composed of 232 places in 314 ms of which 4 ms to minimize.
[2024-05-30 21:39:14] [INFO ] Deduced a trap composed of 232 places in 290 ms of which 4 ms to minimize.
[2024-05-30 21:39:15] [INFO ] Deduced a trap composed of 230 places in 290 ms of which 3 ms to minimize.
[2024-05-30 21:39:15] [INFO ] Deduced a trap composed of 226 places in 285 ms of which 3 ms to minimize.
[2024-05-30 21:39:15] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 3 ms to minimize.
[2024-05-30 21:39:16] [INFO ] Deduced a trap composed of 232 places in 328 ms of which 3 ms to minimize.
[2024-05-30 21:39:16] [INFO ] Deduced a trap composed of 238 places in 307 ms of which 3 ms to minimize.
[2024-05-30 21:39:16] [INFO ] Deduced a trap composed of 236 places in 274 ms of which 3 ms to minimize.
[2024-05-30 21:39:17] [INFO ] Deduced a trap composed of 232 places in 342 ms of which 4 ms to minimize.
[2024-05-30 21:39:17] [INFO ] Deduced a trap composed of 242 places in 342 ms of which 4 ms to minimize.
[2024-05-30 21:39:18] [INFO ] Deduced a trap composed of 238 places in 389 ms of which 4 ms to minimize.
[2024-05-30 21:39:19] [INFO ] Deduced a trap composed of 236 places in 349 ms of which 3 ms to minimize.
[2024-05-30 21:39:19] [INFO ] Deduced a trap composed of 230 places in 240 ms of which 3 ms to minimize.
[2024-05-30 21:39:19] [INFO ] Deduced a trap composed of 238 places in 294 ms of which 3 ms to minimize.
[2024-05-30 21:39:20] [INFO ] Deduced a trap composed of 238 places in 258 ms of which 3 ms to minimize.
[2024-05-30 21:39:20] [INFO ] Deduced a trap composed of 230 places in 235 ms of which 3 ms to minimize.
[2024-05-30 21:39:20] [INFO ] Deduced a trap composed of 244 places in 294 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 20/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:39:21] [INFO ] Deduced a trap composed of 232 places in 326 ms of which 4 ms to minimize.
[2024-05-30 21:39:21] [INFO ] Deduced a trap composed of 230 places in 330 ms of which 4 ms to minimize.
[2024-05-30 21:39:21] [INFO ] Deduced a trap composed of 241 places in 306 ms of which 3 ms to minimize.
[2024-05-30 21:39:22] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 3 ms to minimize.
[2024-05-30 21:39:22] [INFO ] Deduced a trap composed of 232 places in 243 ms of which 3 ms to minimize.
[2024-05-30 21:39:22] [INFO ] Deduced a trap composed of 230 places in 317 ms of which 4 ms to minimize.
[2024-05-30 21:39:23] [INFO ] Deduced a trap composed of 228 places in 347 ms of which 4 ms to minimize.
[2024-05-30 21:39:23] [INFO ] Deduced a trap composed of 236 places in 309 ms of which 4 ms to minimize.
[2024-05-30 21:39:23] [INFO ] Deduced a trap composed of 234 places in 295 ms of which 4 ms to minimize.
[2024-05-30 21:39:24] [INFO ] Deduced a trap composed of 236 places in 348 ms of which 4 ms to minimize.
[2024-05-30 21:39:24] [INFO ] Deduced a trap composed of 232 places in 354 ms of which 4 ms to minimize.
[2024-05-30 21:39:25] [INFO ] Deduced a trap composed of 238 places in 334 ms of which 4 ms to minimize.
[2024-05-30 21:39:26] [INFO ] Deduced a trap composed of 251 places in 321 ms of which 4 ms to minimize.
[2024-05-30 21:39:26] [INFO ] Deduced a trap composed of 236 places in 321 ms of which 4 ms to minimize.
[2024-05-30 21:39:27] [INFO ] Deduced a trap composed of 240 places in 290 ms of which 2 ms to minimize.
[2024-05-30 21:39:27] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 3 ms to minimize.
[2024-05-30 21:39:27] [INFO ] Deduced a trap composed of 240 places in 250 ms of which 3 ms to minimize.
[2024-05-30 21:39:28] [INFO ] Deduced a trap composed of 230 places in 315 ms of which 4 ms to minimize.
[2024-05-30 21:39:29] [INFO ] Deduced a trap composed of 230 places in 346 ms of which 4 ms to minimize.
[2024-05-30 21:39:29] [INFO ] Deduced a trap composed of 232 places in 308 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1878 variables, 20/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:39:29] [INFO ] Deduced a trap composed of 234 places in 312 ms of which 4 ms to minimize.
[2024-05-30 21:39:30] [INFO ] Deduced a trap composed of 228 places in 299 ms of which 3 ms to minimize.
[2024-05-30 21:39:30] [INFO ] Deduced a trap composed of 228 places in 314 ms of which 4 ms to minimize.
[2024-05-30 21:39:31] [INFO ] Deduced a trap composed of 232 places in 332 ms of which 4 ms to minimize.
[2024-05-30 21:39:31] [INFO ] Deduced a trap composed of 228 places in 244 ms of which 3 ms to minimize.
[2024-05-30 21:39:31] [INFO ] Deduced a trap composed of 238 places in 296 ms of which 3 ms to minimize.
[2024-05-30 21:39:32] [INFO ] Deduced a trap composed of 232 places in 288 ms of which 3 ms to minimize.
[2024-05-30 21:39:32] [INFO ] Deduced a trap composed of 232 places in 353 ms of which 4 ms to minimize.
[2024-05-30 21:39:32] [INFO ] Deduced a trap composed of 249 places in 324 ms of which 3 ms to minimize.
[2024-05-30 21:39:33] [INFO ] Deduced a trap composed of 238 places in 248 ms of which 3 ms to minimize.
[2024-05-30 21:39:33] [INFO ] Deduced a trap composed of 247 places in 296 ms of which 3 ms to minimize.
[2024-05-30 21:39:33] [INFO ] Deduced a trap composed of 230 places in 305 ms of which 4 ms to minimize.
[2024-05-30 21:39:34] [INFO ] Deduced a trap composed of 234 places in 280 ms of which 3 ms to minimize.
[2024-05-30 21:39:34] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 3 ms to minimize.
[2024-05-30 21:39:35] [INFO ] Deduced a trap composed of 230 places in 311 ms of which 3 ms to minimize.
[2024-05-30 21:39:36] [INFO ] Deduced a trap composed of 226 places in 405 ms of which 5 ms to minimize.
[2024-05-30 21:39:36] [INFO ] Deduced a trap composed of 234 places in 332 ms of which 4 ms to minimize.
[2024-05-30 21:39:37] [INFO ] Deduced a trap composed of 239 places in 346 ms of which 4 ms to minimize.
[2024-05-30 21:39:37] [INFO ] Deduced a trap composed of 230 places in 301 ms of which 3 ms to minimize.
[2024-05-30 21:39:37] [INFO ] Deduced a trap composed of 232 places in 279 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1878 variables, 20/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:39:38] [INFO ] Deduced a trap composed of 245 places in 315 ms of which 4 ms to minimize.
[2024-05-30 21:39:38] [INFO ] Deduced a trap composed of 230 places in 237 ms of which 3 ms to minimize.
[2024-05-30 21:39:39] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 3 ms to minimize.
[2024-05-30 21:39:40] [INFO ] Deduced a trap composed of 234 places in 353 ms of which 4 ms to minimize.
[2024-05-30 21:39:40] [INFO ] Deduced a trap composed of 234 places in 324 ms of which 4 ms to minimize.
[2024-05-30 21:39:41] [INFO ] Deduced a trap composed of 224 places in 357 ms of which 4 ms to minimize.
[2024-05-30 21:39:41] [INFO ] Deduced a trap composed of 239 places in 365 ms of which 4 ms to minimize.
[2024-05-30 21:39:41] [INFO ] Deduced a trap composed of 238 places in 331 ms of which 5 ms to minimize.
[2024-05-30 21:39:42] [INFO ] Deduced a trap composed of 240 places in 340 ms of which 4 ms to minimize.
[2024-05-30 21:39:44] [INFO ] Deduced a trap composed of 236 places in 282 ms of which 4 ms to minimize.
[2024-05-30 21:39:44] [INFO ] Deduced a trap composed of 232 places in 277 ms of which 3 ms to minimize.
[2024-05-30 21:39:45] [INFO ] Deduced a trap composed of 234 places in 329 ms of which 4 ms to minimize.
[2024-05-30 21:39:45] [INFO ] Deduced a trap composed of 226 places in 274 ms of which 3 ms to minimize.
[2024-05-30 21:39:45] [INFO ] Deduced a trap composed of 232 places in 242 ms of which 3 ms to minimize.
[2024-05-30 21:39:47] [INFO ] Deduced a trap composed of 230 places in 398 ms of which 3 ms to minimize.
[2024-05-30 21:39:47] [INFO ] Deduced a trap composed of 243 places in 320 ms of which 4 ms to minimize.
[2024-05-30 21:39:47] [INFO ] Deduced a trap composed of 232 places in 268 ms of which 3 ms to minimize.
[2024-05-30 21:39:48] [INFO ] Deduced a trap composed of 239 places in 295 ms of which 3 ms to minimize.
[2024-05-30 21:39:48] [INFO ] Deduced a trap composed of 232 places in 304 ms of which 4 ms to minimize.
[2024-05-30 21:39:49] [INFO ] Deduced a trap composed of 228 places in 285 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1878 variables, 20/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:39:50] [INFO ] Deduced a trap composed of 230 places in 317 ms of which 4 ms to minimize.
[2024-05-30 21:39:51] [INFO ] Deduced a trap composed of 251 places in 400 ms of which 4 ms to minimize.
[2024-05-30 21:39:51] [INFO ] Deduced a trap composed of 230 places in 343 ms of which 4 ms to minimize.
[2024-05-30 21:39:52] [INFO ] Deduced a trap composed of 234 places in 344 ms of which 4 ms to minimize.
[2024-05-30 21:39:53] [INFO ] Deduced a trap composed of 234 places in 345 ms of which 4 ms to minimize.
[2024-05-30 21:39:53] [INFO ] Deduced a trap composed of 230 places in 347 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1878/1879 variables, and 748 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45010 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 579/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 86/86 constraints]
After SMT, in 45664ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 34 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 580/580 places, 1308/1308 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 34 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2024-05-30 21:39:57] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-30 21:39:57] [INFO ] Invariant cache hit.
[2024-05-30 21:39:57] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-05-30 21:39:57] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-30 21:39:57] [INFO ] Invariant cache hit.
[2024-05-30 21:39:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:40:00] [INFO ] Implicit Places using invariants and state equation in 2407 ms returned []
Implicit Place search using SMT with State Equation took 2864 ms to find 0 implicit places.
[2024-05-30 21:40:00] [INFO ] Redundant transitions in 31 ms returned []
Running 1297 sub problems to find dead transitions.
[2024-05-30 21:40:00] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-30 21:40:00] [INFO ] Invariant cache hit.
[2024-05-30 21:40:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-30 21:40:18] [INFO ] Deduced a trap composed of 236 places in 265 ms of which 4 ms to minimize.
[2024-05-30 21:40:18] [INFO ] Deduced a trap composed of 230 places in 204 ms of which 3 ms to minimize.
[2024-05-30 21:40:18] [INFO ] Deduced a trap composed of 234 places in 231 ms of which 3 ms to minimize.
[2024-05-30 21:40:19] [INFO ] Deduced a trap composed of 230 places in 219 ms of which 4 ms to minimize.
[2024-05-30 21:40:19] [INFO ] Deduced a trap composed of 238 places in 245 ms of which 3 ms to minimize.
[2024-05-30 21:40:19] [INFO ] Deduced a trap composed of 240 places in 210 ms of which 3 ms to minimize.
[2024-05-30 21:40:19] [INFO ] Deduced a trap composed of 244 places in 225 ms of which 3 ms to minimize.
[2024-05-30 21:40:20] [INFO ] Deduced a trap composed of 238 places in 227 ms of which 4 ms to minimize.
[2024-05-30 21:40:20] [INFO ] Deduced a trap composed of 242 places in 210 ms of which 3 ms to minimize.
[2024-05-30 21:40:20] [INFO ] Deduced a trap composed of 246 places in 231 ms of which 4 ms to minimize.
[2024-05-30 21:40:20] [INFO ] Deduced a trap composed of 246 places in 269 ms of which 4 ms to minimize.
[2024-05-30 21:40:21] [INFO ] Deduced a trap composed of 244 places in 242 ms of which 4 ms to minimize.
[2024-05-30 21:40:21] [INFO ] Deduced a trap composed of 236 places in 240 ms of which 4 ms to minimize.
[2024-05-30 21:40:21] [INFO ] Deduced a trap composed of 234 places in 242 ms of which 5 ms to minimize.
[2024-05-30 21:40:21] [INFO ] Deduced a trap composed of 230 places in 255 ms of which 3 ms to minimize.
[2024-05-30 21:40:22] [INFO ] Deduced a trap composed of 236 places in 241 ms of which 4 ms to minimize.
[2024-05-30 21:40:22] [INFO ] Deduced a trap composed of 240 places in 245 ms of which 4 ms to minimize.
[2024-05-30 21:40:22] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 4 ms to minimize.
[2024-05-30 21:40:22] [INFO ] Deduced a trap composed of 156 places in 233 ms of which 6 ms to minimize.
[2024-05-30 21:40:23] [INFO ] Deduced a trap composed of 166 places in 242 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-30 21:40:23] [INFO ] Deduced a trap composed of 242 places in 217 ms of which 3 ms to minimize.
[2024-05-30 21:40:23] [INFO ] Deduced a trap composed of 238 places in 196 ms of which 3 ms to minimize.
[2024-05-30 21:40:24] [INFO ] Deduced a trap composed of 236 places in 187 ms of which 4 ms to minimize.
[2024-05-30 21:40:24] [INFO ] Deduced a trap composed of 151 places in 191 ms of which 3 ms to minimize.
[2024-05-30 21:40:24] [INFO ] Deduced a trap composed of 166 places in 194 ms of which 4 ms to minimize.
[2024-05-30 21:40:24] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 3 ms to minimize.
[2024-05-30 21:40:25] [INFO ] Deduced a trap composed of 238 places in 203 ms of which 3 ms to minimize.
[2024-05-30 21:40:25] [INFO ] Deduced a trap composed of 238 places in 198 ms of which 3 ms to minimize.
[2024-05-30 21:40:25] [INFO ] Deduced a trap composed of 240 places in 178 ms of which 3 ms to minimize.
[2024-05-30 21:40:25] [INFO ] Deduced a trap composed of 242 places in 175 ms of which 3 ms to minimize.
[2024-05-30 21:40:25] [INFO ] Deduced a trap composed of 242 places in 173 ms of which 3 ms to minimize.
[2024-05-30 21:40:26] [INFO ] Deduced a trap composed of 246 places in 178 ms of which 3 ms to minimize.
[2024-05-30 21:40:26] [INFO ] Deduced a trap composed of 244 places in 176 ms of which 2 ms to minimize.
[2024-05-30 21:40:26] [INFO ] Deduced a trap composed of 238 places in 174 ms of which 3 ms to minimize.
[2024-05-30 21:40:26] [INFO ] Deduced a trap composed of 228 places in 209 ms of which 3 ms to minimize.
[2024-05-30 21:40:27] [INFO ] Deduced a trap composed of 228 places in 225 ms of which 3 ms to minimize.
[2024-05-30 21:40:27] [INFO ] Deduced a trap composed of 232 places in 242 ms of which 3 ms to minimize.
[2024-05-30 21:40:27] [INFO ] Deduced a trap composed of 232 places in 275 ms of which 4 ms to minimize.
[2024-05-30 21:40:27] [INFO ] Deduced a trap composed of 238 places in 244 ms of which 4 ms to minimize.
[2024-05-30 21:40:28] [INFO ] Deduced a trap composed of 238 places in 292 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 timeout
0.0)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1879 variables, and 112 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1297/1297 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-30 21:40:39] [INFO ] Deduced a trap composed of 171 places in 250 ms of which 4 ms to minimize.
[2024-05-30 21:40:39] [INFO ] Deduced a trap composed of 171 places in 242 ms of which 4 ms to minimize.
[2024-05-30 21:40:39] [INFO ] Deduced a trap composed of 156 places in 250 ms of which 4 ms to minimize.
[2024-05-30 21:40:40] [INFO ] Deduced a trap composed of 156 places in 241 ms of which 4 ms to minimize.
[2024-05-30 21:40:40] [INFO ] Deduced a trap composed of 161 places in 265 ms of which 4 ms to minimize.
[2024-05-30 21:40:40] [INFO ] Deduced a trap composed of 156 places in 310 ms of which 4 ms to minimize.
[2024-05-30 21:40:40] [INFO ] Deduced a trap composed of 151 places in 282 ms of which 3 ms to minimize.
[2024-05-30 21:40:41] [INFO ] Deduced a trap composed of 151 places in 238 ms of which 3 ms to minimize.
[2024-05-30 21:40:41] [INFO ] Deduced a trap composed of 171 places in 263 ms of which 3 ms to minimize.
[2024-05-30 21:40:41] [INFO ] Deduced a trap composed of 151 places in 214 ms of which 3 ms to minimize.
[2024-05-30 21:40:42] [INFO ] Deduced a trap composed of 146 places in 215 ms of which 3 ms to minimize.
[2024-05-30 21:40:42] [INFO ] Deduced a trap composed of 156 places in 214 ms of which 3 ms to minimize.
[2024-05-30 21:40:42] [INFO ] Deduced a trap composed of 161 places in 208 ms of which 3 ms to minimize.
[2024-05-30 21:40:42] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 3 ms to minimize.
[2024-05-30 21:40:42] [INFO ] Deduced a trap composed of 156 places in 221 ms of which 3 ms to minimize.
[2024-05-30 21:40:43] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 4 ms to minimize.
[2024-05-30 21:40:43] [INFO ] Deduced a trap composed of 146 places in 236 ms of which 3 ms to minimize.
[2024-05-30 21:40:43] [INFO ] Deduced a trap composed of 146 places in 306 ms of which 4 ms to minimize.
[2024-05-30 21:40:44] [INFO ] Deduced a trap composed of 161 places in 262 ms of which 3 ms to minimize.
[2024-05-30 21:40:44] [INFO ] Deduced a trap composed of 161 places in 223 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-30 21:40:45] [INFO ] Deduced a trap composed of 161 places in 264 ms of which 3 ms to minimize.
[2024-05-30 21:40:45] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 4 ms to minimize.
[2024-05-30 21:40:45] [INFO ] Deduced a trap composed of 156 places in 228 ms of which 4 ms to minimize.
[2024-05-30 21:40:45] [INFO ] Deduced a trap composed of 156 places in 259 ms of which 3 ms to minimize.
[2024-05-30 21:40:46] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 4 ms to minimize.
[2024-05-30 21:40:46] [INFO ] Deduced a trap composed of 151 places in 244 ms of which 4 ms to minimize.
[2024-05-30 21:40:46] [INFO ] Deduced a trap composed of 146 places in 245 ms of which 4 ms to minimize.
[2024-05-30 21:40:47] [INFO ] Deduced a trap composed of 146 places in 249 ms of which 4 ms to minimize.
[2024-05-30 21:40:47] [INFO ] Deduced a trap composed of 151 places in 278 ms of which 4 ms to minimize.
[2024-05-30 21:40:47] [INFO ] Deduced a trap composed of 146 places in 257 ms of which 4 ms to minimize.
[2024-05-30 21:40:47] [INFO ] Deduced a trap composed of 171 places in 281 ms of which 4 ms to minimize.
[2024-05-30 21:40:48] [INFO ] Deduced a trap composed of 171 places in 281 ms of which 4 ms to minimize.
[2024-05-30 21:40:48] [INFO ] Deduced a trap composed of 156 places in 262 ms of which 4 ms to minimize.
[2024-05-30 21:40:48] [INFO ] Deduced a trap composed of 156 places in 298 ms of which 5 ms to minimize.
[2024-05-30 21:40:49] [INFO ] Deduced a trap composed of 146 places in 259 ms of which 4 ms to minimize.
[2024-05-30 21:40:49] [INFO ] Deduced a trap composed of 161 places in 198 ms of which 3 ms to minimize.
[2024-05-30 21:40:49] [INFO ] Deduced a trap composed of 166 places in 253 ms of which 4 ms to minimize.
[2024-05-30 21:40:50] [INFO ] Deduced a trap composed of 236 places in 370 ms of which 4 ms to minimize.
[2024-05-30 21:40:50] [INFO ] Deduced a trap composed of 243 places in 370 ms of which 4 ms to minimize.
[2024-05-30 21:40:50] [INFO ] Deduced a trap composed of 236 places in 333 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-30 21:40:51] [INFO ] Deduced a trap composed of 166 places in 265 ms of which 4 ms to minimize.
[2024-05-30 21:40:52] [INFO ] Deduced a trap composed of 166 places in 250 ms of which 4 ms to minimize.
[2024-05-30 21:40:52] [INFO ] Deduced a trap composed of 161 places in 286 ms of which 4 ms to minimize.
[2024-05-30 21:40:52] [INFO ] Deduced a trap composed of 141 places in 271 ms of which 3 ms to minimize.
[2024-05-30 21:40:52] [INFO ] Deduced a trap composed of 161 places in 234 ms of which 4 ms to minimize.
[2024-05-30 21:40:53] [INFO ] Deduced a trap composed of 156 places in 268 ms of which 4 ms to minimize.
[2024-05-30 21:40:53] [INFO ] Deduced a trap composed of 151 places in 278 ms of which 4 ms to minimize.
[2024-05-30 21:40:54] [INFO ] Deduced a trap composed of 146 places in 297 ms of which 4 ms to minimize.
[2024-05-30 21:40:54] [INFO ] Deduced a trap composed of 156 places in 299 ms of which 4 ms to minimize.
[2024-05-30 21:40:55] [INFO ] Deduced a trap composed of 18 places in 281 ms of which 2 ms to minimize.
[2024-05-30 21:40:56] [INFO ] Deduced a trap composed of 244 places in 373 ms of which 3 ms to minimize.
[2024-05-30 21:40:56] [INFO ] Deduced a trap composed of 171 places in 355 ms of which 4 ms to minimize.
[2024-05-30 21:40:57] [INFO ] Deduced a trap composed of 166 places in 279 ms of which 3 ms to minimize.
[2024-05-30 21:40:57] [INFO ] Deduced a trap composed of 151 places in 379 ms of which 4 ms to minimize.
[2024-05-30 21:40:57] [INFO ] Deduced a trap composed of 165 places in 356 ms of which 4 ms to minimize.
[2024-05-30 21:40:58] [INFO ] Deduced a trap composed of 156 places in 323 ms of which 4 ms to minimize.
[2024-05-30 21:40:58] [INFO ] Deduced a trap composed of 150 places in 322 ms of which 3 ms to minimize.
[2024-05-30 21:40:58] [INFO ] Deduced a trap composed of 141 places in 306 ms of which 3 ms to minimize.
[2024-05-30 21:40:59] [INFO ] Deduced a trap composed of 165 places in 318 ms of which 3 ms to minimize.
[2024-05-30 21:40:59] [INFO ] Deduced a trap composed of 166 places in 314 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-30 21:41:02] [INFO ] Deduced a trap composed of 234 places in 399 ms of which 4 ms to minimize.
[2024-05-30 21:41:02] [INFO ] Deduced a trap composed of 156 places in 435 ms of which 4 ms to minimize.
[2024-05-30 21:41:02] [INFO ] Deduced a trap composed of 165 places in 417 ms of which 4 ms to minimize.
[2024-05-30 21:41:03] [INFO ] Deduced a trap composed of 156 places in 315 ms of which 4 ms to minimize.
[2024-05-30 21:41:03] [INFO ] Deduced a trap composed of 232 places in 373 ms of which 4 ms to minimize.
[2024-05-30 21:41:04] [INFO ] Deduced a trap composed of 156 places in 361 ms of which 4 ms to minimize.
[2024-05-30 21:41:04] [INFO ] Deduced a trap composed of 180 places in 330 ms of which 3 ms to minimize.
[2024-05-30 21:41:04] [INFO ] Deduced a trap composed of 171 places in 291 ms of which 3 ms to minimize.
[2024-05-30 21:41:05] [INFO ] Deduced a trap composed of 160 places in 312 ms of which 3 ms to minimize.
[2024-05-30 21:41:05] [INFO ] Deduced a trap composed of 171 places in 315 ms of which 3 ms to minimize.
[2024-05-30 21:41:05] [INFO ] Deduced a trap composed of 161 places in 356 ms of which 3 ms to minimize.
[2024-05-30 21:41:06] [INFO ] Deduced a trap composed of 151 places in 343 ms of which 4 ms to minimize.
[2024-05-30 21:41:06] [INFO ] Deduced a trap composed of 146 places in 318 ms of which 3 ms to minimize.
[2024-05-30 21:41:06] [INFO ] Deduced a trap composed of 155 places in 316 ms of which 3 ms to minimize.
[2024-05-30 21:41:07] [INFO ] Deduced a trap composed of 175 places in 306 ms of which 3 ms to minimize.
[2024-05-30 21:41:07] [INFO ] Deduced a trap composed of 165 places in 308 ms of which 3 ms to minimize.
[2024-05-30 21:41:07] [INFO ] Deduced a trap composed of 195 places in 327 ms of which 4 ms to minimize.
SMT process timed out in 67468ms, After SMT, problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 67490ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70434 ms. Remains : 580/580 places, 1308/1308 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 580 transition count 1299
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 580 transition count 1298
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 579 transition count 1298
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 579 transition count 1297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 578 transition count 1297
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 22 place count 578 transition count 1288
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 31 place count 569 transition count 1288
Applied a total of 31 rules in 146 ms. Remains 569 /580 variables (removed 11) and now considering 1288/1308 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1288 rows 569 cols
[2024-05-30 21:41:08] [INFO ] Computed 82 invariants in 64 ms
[2024-05-30 21:41:08] [INFO ] [Real]Absence check using 75 positive place invariants in 19 ms returned sat
[2024-05-30 21:41:08] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-30 21:41:08] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 21:41:08] [INFO ] [Nat]Absence check using 75 positive place invariants in 19 ms returned sat
[2024-05-30 21:41:08] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-30 21:41:08] [INFO ] After 522ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 21:41:09] [INFO ] After 633ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 21:41:09] [INFO ] After 833ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1231 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 38 properties from file /home/mcc/execution/QuasiLiveness.xml in 5 ms.
Working with output stream class java.io.PrintStream
Total runtime 762901 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-COL-S10J30

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 48
TRANSITIONS: 38
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 8
COLOR VARS: 26
ARCS: 140
LOADING TIME: 0.214

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 694
TRANSITIONS: 12080
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 112619
UNFOLDING TIME: 1.123

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.275
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 1.83
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

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

Process ID: 2583
MODEL NAME: /home/mcc/execution/model
694 places, 12080 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J30"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBNT-COL-S10J30, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tajo-171654455200257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J30.tgz
mv PolyORBNT-COL-S10J30 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;