About the Execution of LTSMin+red for ShieldRVt-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16194.731 | 1751737.00 | 4328423.00 | 2687.80 | ?FFFFFFFTFFF?FFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r528-tall-171683762401052.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldRVt-PT-100B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762401052
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717279154153
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-100B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:59:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 21:59:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:59:15] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2024-06-01 21:59:15] [INFO ] Transformed 5003 places.
[2024-06-01 21:59:15] [INFO ] Transformed 5003 transitions.
[2024-06-01 21:59:15] [INFO ] Found NUPN structural information;
[2024-06-01 21:59:15] [INFO ] Parsed PT model containing 5003 places and 5003 transitions and 11806 arcs in 477 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldRVt-PT-100B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 5003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5003/5003 places, 5003/5003 transitions.
Discarding 1093 places :
Symmetric choice reduction at 0 with 1093 rule applications. Total rules 1093 place count 3910 transition count 3910
Iterating global reduction 0 with 1093 rules applied. Total rules applied 2186 place count 3910 transition count 3910
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2187 place count 3909 transition count 3909
Iterating global reduction 0 with 1 rules applied. Total rules applied 2188 place count 3909 transition count 3909
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2189 place count 3908 transition count 3908
Iterating global reduction 0 with 1 rules applied. Total rules applied 2190 place count 3908 transition count 3908
Applied a total of 2190 rules in 1842 ms. Remains 3908 /5003 variables (removed 1095) and now considering 3908/5003 (removed 1095) transitions.
// Phase 1: matrix 3908 rows 3908 cols
[2024-06-01 21:59:18] [INFO ] Computed 401 invariants in 46 ms
[2024-06-01 21:59:19] [INFO ] Implicit Places using invariants in 1201 ms returned []
[2024-06-01 21:59:19] [INFO ] Invariant cache hit.
[2024-06-01 21:59:23] [INFO ] Implicit Places using invariants and state equation in 4656 ms returned []
Implicit Place search using SMT with State Equation took 5890 ms to find 0 implicit places.
Running 3907 sub problems to find dead transitions.
[2024-06-01 21:59:23] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3907/7816 variables, and 0 constraints, problems are : Problem set: 0 solved, 3907 unsolved in 30090 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3908 constraints, PredecessorRefiner: 3907/3907 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3907 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3907/7816 variables, and 0 constraints, problems are : Problem set: 0 solved, 3907 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3908 constraints, PredecessorRefiner: 0/3907 constraints, Known Traps: 0/0 constraints]
After SMT, in 61880ms problems are : Problem set: 0 solved, 3907 unsolved
Search for dead transitions found 0 dead transitions in 61936ms
Starting structural reductions in LTL mode, iteration 1 : 3908/5003 places, 3908/5003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69711 ms. Remains : 3908/5003 places, 3908/5003 transitions.
Support contains 29 out of 3908 places after structural reductions.
[2024-06-01 22:00:26] [INFO ] Flatten gal took : 212 ms
[2024-06-01 22:00:26] [INFO ] Flatten gal took : 137 ms
[2024-06-01 22:00:26] [INFO ] Input system was already deterministic with 3908 transitions.
RANDOM walk for 40000 steps (8 resets) in 2107 ms. (18 steps per ms) remains 15/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
[2024-06-01 22:00:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 272/291 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 3617/3908 variables, 382/401 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3908 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 3908/7816 variables, 3908/4309 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7816 variables, 0/4309 constraints. Problems are: Problem set: 0 solved, 15 unsolved
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 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.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 1.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 1.0)
(s124 1.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 1.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 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.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 1.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 1.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 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.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 1.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 1.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 1.0)
(s246 0.0)
(s247 1.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 1.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 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 1.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 1.0)
(s306 0.0)
(s307 1.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 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.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 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.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 0.0)
(s373 1.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 1.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 1.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.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 1.0)
(s420 0.0)
(s421 1.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 1.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 1.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 1.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 1.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 1.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 1.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 1.0)
(s572 1.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 1.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 1.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 1.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 1.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 1.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 1.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 1.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 1.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 1.0)
(s665 0.0)
(s666 0.0)
(s667 1.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 1.0)
(s686 0.0)
(s687 1.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 1.0)
(s702 0.0)
(s703 1.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 1.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 1.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 1.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 1.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 1.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 1.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 1.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 1.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 1.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 1.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 1.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 1.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 1.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 1.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 1.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 1.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 1.0)
(s878 0.0)
(s879 1.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 1.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 (/ 1.0 2.0))
(s897 (/ 1.0 2.0))
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 1.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 1.0)
(s924 0.0)
(s925 0.0)
(s926 (/ 1.0 2.0))
(s927 (/ 1.0 2.0))
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 1.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 1.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 1.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 1.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 1.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 1.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 1.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 1.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 1.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 1.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 1.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 1.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 1.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 1.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 1.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 1.0)
(s1085 1.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 1.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 1.0)
(s1114 1.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 1.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 1.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 1.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 1.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 1.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 1.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 1.0)
(s1190 1.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 1.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 1.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 1.0)
(s1228 0.0)
(s1229 0.0)
(s1230 1.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 1.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 1.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 1.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 1.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 1.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 1.0)
(s1296 0.0)
(s1297 1.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 1.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 1.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 1.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 1.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 1.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 1.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 1.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 1.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 1.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 1.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 1.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 1.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 1.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 1.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 1.0)
(s1448 0.0)
(s1449 1.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 1.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 1.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 1.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 1.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 0.0)
(s1501 1.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 1.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 1.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 0.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 1.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 1.0)
(s1537 0.0)
(s1538 0.0)
(s1539 0.0)
(s1540 0.0)
(s1541 0.0)
(s1542 1.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 1.0)
(s1555 0.0)
(s1556 0.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 0.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 0.0)
(s1572 1.0)
(s1573 0.0)
(s1574 0.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 0.0)
(s1581 0.0)
(s1582 0.0)
(s1583 1.0)
(s1584 0.0)
(s1585 0.0)
(s1586 0.0)
(s1587 0.0)
(s1588 0.0)
(s1589 0.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 (/ 1.0 2.0))
(s1595 (/ 1.0 2.0))
(s1596 0.0)
(s1597 0.0)
(s1598 0.0)
(s1599 0.0)
(s1600 0.0)
(s1601 0.0)
(s1602 1.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
(s1609 0.0)
(s1610 0.0)
(s1611 0.0)
(s1612 1.0)
(s1613 0.0)
(s1614 0.0)
(s1615 0.0)
(s1616 0.0)
(s1617 0.0)
(s1618 0.0)
(s1619 0.0)
(s1620 0.0)
(s1621 0.0)
(s1622 1.0)
(s1623 0.0)
(s1624 0.0)
(s1625 0.0)
(s1626 0.0)
(s1627 0.0)
(s1628 0.0)
(s1629 0.0)
(s1630 0.0)
(s1631 0.0)
(s1632 0.0)
(s1633 0.0)
(s1634 0.0)
(s1635 0.0)
(s1636 0.0)
(s1637 0.0)
(s1638 0.0)
(s1639 1.0)
(s1640 0.0)
(s1641 0.0)
(s1642 0.0)
(s1643 0.0)
(s1644 0.0)
(s1645 0.0)
(s1646 0.0)
(s1647 1.0)
(s1648 0.0)
(s1649 0.0)
(s1650 0.0)
(s1651 0.0)
(s1652 0.0)
(s1653 0.0)
(s1654 0.0)
(s1655 1.0)
(s1656 0.0)
(s1657 0.0)
(s1658 0.0)
(s1659 0.0)
(s1660 0.0)
(s1661 0.0)
(s1662 0.0)
(s1663 0.0)
(s1664 1.0)
(s1665 0.0)
(s1666 0.0)
(s1667 0.0)
(s1668 0.0)
(s1669 0.0)
(s1670 0.0)
(s1671 1.0)
(s1672 0.0)
(s1673 0.0)
(s1674 0.0)
(s1675 0.0)
(s1676 0.0)
(s1677 0.0)
(s1678 0.0)
(s1679 1.0)
(s1680 0.0)
(s1681 0.0)
(s1682 0.0)
(s1683 0.0)
(s1684 0.0)
(s1685 0.0)
(s1686 0.0)
(s1687 0.0)
(s1688 1.0)
(s1689 0.0)
(s1690 0.0)
(s1691 0.0)
(s1692 0.0)
(s1693 0.0)
(s1694 0.0)
(s1695 1.0)
(s1696 0.0)
(s1697 0.0)
(s1698 0.0)
(s1699 0.0)
(s1700 0.0)
(s1701 0.0)
(s1702 0.0)
(s1703 0.0)
(s1704 0.0)
(s1705 0.0)
(s1706 0.0)
(s1707 0.0)
(s1708 0.0)
(s1709 0.0)
(s1710 0.0)
(s1711 0.0)
(s1712 0.0)
(s1713 0.0)
(s1714 0.0)
(s1715 1.0)
(s1716 0.0)
(s1717 0.0)
(s1718 0.0)
(s1719 0.0)
(s1720 0.0)
(s1721 0.0)
(s1722 0.0)
(s1723 1.0)
(s1724 1.0)
(s1725 0.0)
(s1726 0.0)
(s1727 0.0)
(s1728 0.0)
(s1729 0.0)
(s1730 0.0)
(s1731 0.0)
(s1732 0.0)
(s1733 1.0)
(s1734 0.0)
(s1735 0.0)
(s1736 0.0)
(s1737 0.0)
(s1738 0.0)
(s1739 0.0)
(s1740 0.0)
(s1741 0.0)
(s1742 0.0)
(s1743 0.0)
(s1744 0.0)
(s1745 0.0)
(s1746 0.0)
(s1747 0.0)
(s1748 0.0)
(s1749 0.0)
(s1750 0.0)
(s1751 0.0)
(s1752 0.0)
(s1753 1.0)
(s1754 0.0)
(s1755 1.0)
(s1756 0.0)
(s1757 0.0)
(s1758 0.0)
(s1759 0.0)
(s1760 0.0)
(s1761 0.0)
(s1762 1.0)
(s1763 0.0)
(s1764 0.0)
(s1765 0.0)
(s1766 0.0)
(s1767 0.0)
(s1768 0.0)
(s1769 0.0)
(s1770 0.0)
(s1771 0.0)
(s1772 0.0)
(s1773 0.0)
(s1774 0.0)
(s1775 0.0)
(s1776 1.0)
(s1777 0.0)
(s1778 0.0)
(s1779 0.0)
(s1780 0.0)
(s1781 0.0)
(s1782 0.0)
(s1783 0.0)
(s1784 0.0)
(s1785 0.0)
(s1786 0.0)
(s1787 0.0)
(s1788 0.0)
(s1789 0.0)
(s1790 0.0)
(s1791 1.0)
(s1792 0.0)
(s1793 0.0)
(s1794 0.0)
(s1795 0.0)
(s1796 0.0)
(s1797 0.0)
(s1798 1.0)
(s1799 0.0)
(s1800 0.0)
(s1801 0.0)
(s1802 0.0)
(s1803 0.0)
(s1804 0.0)
(s1805 0.0)
(s1806 0.0)
(s1807 0.0)
(s1808 1.0)
(s1809 0.0)
(s1810 0.0)
(s1811 0.0)
(s1812 1.0)
(s1813 0.0)
(s1814 0.0)
(s1815 0.0)
(s1816 0.0)
(s1817 0.0)
(s1818 0.0)
(s1819 0.0)
(s1820 0.0)
(s1821 0.0)
(s1822 0.0)
(s1823 0.0)
(s1824 0.0)
(s1825 0.0)
(s1826 0.0)
(s1827 0.0)
(s1828 0.0)
(s1829 1.0)
(s1830 0.0)
(s1831 0.0)
(s1832 0.0)
(s1833 0.0)
(s1834 0.0)
(s1835 0.0)
(s1836 1.0)
(s1837 0.0)
(s1838 0.0)
(s1839 0.0)
(s1840 0.0)
(s1841 1.0)
(s1842 0.0)
(s1843 0.0)
(s1844 0.0)
(s1845 0.0)
(s1846 0.0)
(s1847 0.0)
(s1848 0.0)
(s1849 1.0)
(s1850 0.0)
(s1851 0.0)
(s1852 0.0)
(s1853 0.0)
(s1854 0.0)
(s1855 0.0)
(s1856 0.0)
(s1857 0.0)
(s1858 0.0)
(s1859 0.0)
(s1860 0.0)
(s1861 0.0)
(s1862 0.0)
(s1863 0.0)
(s1864 0.0)
(s1865 0.0)
(s1866 0.0)
(s1867 1.0)
(s1868 0.0)
(s1869 0.0)
(s1870 0.0)
(s1871 0.0)
(s1872 0.0)
(s1873 0.0)
(s1874 0.0)
(s1875 1.0)
(s1876 0.0)
(s1877 0.0)
(s1878 0.0)
(s1879 0.0)
(s1880 0.0)
(s1881 0.0)
(s1882 0.0)
(s1883 1.0)
(s1884 0.0)
(s1885 0.0)
(s1886 0.0)
(s1887 1.0)
(s1888 0.0)
(s1889 0.0)
(s1890 0.0)
(s1891 0.0)
(s1892 0.0)
(s1893 0.0)
(s1894 0.0)
(s1895 0.0)
(s1896 0.0)
(s1897 0.0)
(s1898 0.0)
(s1899 0.0)
(s1900 0.0)
(s1901 0.0)
(s1902 0.0)
(s1903 0.0)
(s1904 0.0)
(s1905 1.0)
(s1906 0.0)
(s1907 0.0)
(s1908 0.0)
(s1909 0.0)
(s1910 0.0)
(s1911 0.0)
(s1912 1.0)
(s1913 0.0)
(s1914 1.0)
(s1915 0.0)
(s1916 0.0)
(s1917 0.0)
(s1918 0.0)
(s1919 0.0)
(s1920 0.0)
(s1921 0.0)
(s1922 0.0)
(s1923 0.0)
(s1924 0.0)
(s1925 1.0)
(s1926 0.0)
(s1927 0.0)
(s1928 0.0)
(s1929 0.0)
(s1930 0.0)
(s1931 0.0)
(s1932 0.0)
(s1933 0.0)
(s1934 0.0)
(s1935 0.0)
(s1936 1.0)
(s1937 0.0)
(s1938 0.0)
(s1939 0.0)
(s1940 0.0)
(s1941 0.0)
(s1942 0.0)
(s1943 0.0)
(s1944 0.0)
(s1945 0.0)
(s1946 0.0)
(s1947 0.0)
(s1948 0.0)
(s1949 0.0)
(s1950 0.0)
(s1951 1.0)
(s1952 0.0)
(s1953 0.0)
(s1954 0.0)
(s1955 1.0)
(s1956 0.0)
(s1957 0.0)
(s1958 0.0)
(s1959 0.0)
(s1960 0.0)
(s1961 0.0)
(s1962 0.0)
(s1963 1.0)
(s1964 0.0)
(s1965 0.0)
(s1966 0.0)
(s1967 0.0)
(s1968 0.0)
(s1969 0.0)
(s1970 0.0)
(s1971 0.0)
(s1972 0.0)
(s1973 0.0)
(s1974 0.0)
(s1975 0.0)
(s1976 0.0)
(s1977 0.0)
(s1978 0.0)
(s1979 0.0)
(s1980 0.0)
(s1981 1.0)
(s1982 0.0)
(s1983 0.0)
(s1984 0.0)
(s1985 0.0)
(s1986 0.0)
(s1987 0.0)
(s1988 1.0)
(s1989 0.0)
(s1990 0.0)
(s1991 0.0)
(s1992 0.0)
(s1993 0.0)
(s1994 0.0)
(s1995 0.0)
(s1996 0.0)
(s1997 1.0)
(s1998 0.0)
(s1999 0.0)
(s2000 0.0)
(s2001 0.0)
(s2002 0.0)
(s2003 1.0)
(s2004 0.0)
(s2005 0.0)
(s2006 0.0)
(s2007 0.0)
(s2008 0.0)
(s2009 0.0)
(s2010 0.0)
(s2011 1.0)
(s2012 0.0)
(s2013 0.0)
(s2014 0.0)
(s2015 0.0)
(s2016 0.0)
(s2017 0.0)
(s2018 0.0)
(s2019 0.0)
(s2020 1.0)
(s2021 0.0)
(s2022 0.0)
(s2023 0.0)
(s2024 0.0)
(s2025 0.0)
(s2026 0.0)
(s2027 0.0)
(s2028 0.0)
(s2029 0.0)
(s2030 0.0)
(s2031 0.0)
(s2032 0.0)
(s2033 0.0)
(s2034 0.0)
(s2035 1.0)
(s2036 0.0)
(s2037 0.0)
(s2038 0.0)
(s2039 0.0)
(s2040 1.0)
(s2041 0.0)
(s2042 0.0)
(s2043 0.0)
(s2044 0.0)
(s2045 0.0)
(s2046 0.0)
(s2047 0.0)
(s2048 1.0)
(s2049 0.0)
(s2050 0.0)
(s2051 0.0)
(s2052 0.0)
(s2053 0.0)
(s2054 0.0)
(s2055 0.0)
(s2056 0.0)
(s2057 0.0)
(s2058 0.0)
(s2059 0.0)
(s2060 0.0)
(s2061 0.0)
(s2062 0.0)
(s2063 0.0)
(s2064 0.0)
(s2065 0.0)
(s2066 0.0)
(s2067 0.0)
(s2068 0.0)
(s2069 1.0)
(s2070 0.0)
(s2071 0.0)
(s2072 0.0)
(s2073 0.0)
(s2074 0.0)
(s2075 0.0)
(s2076 0.0)
(s2077 1.0)
(s2078 0.0)
(s2079 0.0)
(s2080 0.0)
(s2081 0.0)
(s2082 0.0)
(s2083 0.0)
(s2084 0.0)
(s2085 0.0)
(s2086 0.0)
(s2087 0.0)
(s2088 1.0)
(s2089 0.0)
(s2090 0.0)
(s2091 0.0)
(s2092 0.0)
(s2093 0.0)
(s2094 0.0)
(s2095 0.0)
(s2096 0.0)
(s2097 0.0)
(s2098 0.0)
(s2099 0.0)
(s2100 1.0)
(s2101 0.0)
(s2102 0.0)
(s2103 0.0)
(s2104 0.0)
(s2105 0.0)
(s2106 0.0)
(s2107 0.0)
(s2108 0.0)
(s2109 0.0)
(s2110 1.0)
(s2111 0.0)
(s2112 0.0)
(s2113 0.0)
(s2114 0.0)
(s2115 0.0)
(s2116 0.0)
(s2117 0.0)
(s2118 0.0)
(s2119 0.0)
(s2120 1.0)
(s2121 0.0)
(s2122 0.0)
(s2123 0.0)
(s2124 0.0)
(s2125 0.0)
(s2126 0.0)
(s2127 0.0)
(s2128 0.0)
(s2129 0.0)
(s2130 0.0)
(s2131 0.0)
(s2132 0.0)
(s2133 1.0)
(s2134 0.0)
(s2135 0.0)
(s2136 0.0)
(s2137 0.0)
(s2138 0.0)
(s2139 0.0)
(s2140 1.0)
(s2141 0.0)
(s2142 0.0)
(s2143 0.0)
(s2144 (/ 1.0 2.0))
(s2145 0.0)
(s2146 0.0)
(s2147 0.0)
(s2148 (/ 1.0 2.0))
(s2149 0.0)
(s2150 0.0)
(s2151 0.0)
(s2152 0.0)
(s2153 1.0)
(s2154 0.0)
(s2155 0.0)
(s2156 0.0)
(s2157 0.0)
(s2158 0.0)
(s2159 0.0)
(s2160 0.0)
(s2161 0.0)
(s2162 0.0)
(s2163 0.0)
(s2164 0.0)
(s2165 1.0)
(s2166 0.0)
(s2167 0.0)
(s2168 0.0)
(s2169 0.0)
(s2170 0.0)
(s2171 0.0)
(s2172 0.0)
(s2173 1.0)
(s2174 0.0)
(s2175 0.0)
(s2176 0.0)
(s2177 0.0)
(s2178 0.0)
(s2179 0.0)
(s2180 0.0)
(s2181 0.0)
(s2182 1.0)
(s2183 0.0)
(s2184 0.0)
(s2185 0.0)
(s2186 0.0)
(s2187 0.0)
(s2188 0.0)
(s2189 0.0)
(s2190 1.0)
(s2191 0.0)
(s2192 0.0)
(s2193 0.0)
(s2194 0.0)
(s2195 0.0)
(s2196 0.0)
(s2197 0.0)
(s2198 0.0)
(s2199 0.0)
(s2200 0.0)
(s2201 1.0)
(s2202 0.0)
(s2203 0.0)
(s2204 0.0)
(s2205 0.0)
(s2206 0.0)
(s2207 0.0)
(s2208 0.0)
(s2209 0.0)
(s2210 0.0)
(s2211 1.0)
(s2212 0.0)
(s2213 0.0)
(s2214 0.0)
(s2215 0.0)
(s2216 0.0)
(s2217 0.0)
(s2218 0.0)
(s2219 0.0)
(s2220 0.0)
(s2221 1.0)
(s2222 0.0)
(s2223 0.0)
(s2224 0.0)
(s2225 0.0)
(s2226 0.0)
(s2227 0.0)
(s2228 0.0)
(s2229 1.0)
(s2230 0.0)
(s2231 0.0)
(s2232 0.0)
(s2233 0.0)
(s2234 0.0)
(s2235 0.0)
(s2236 0.0)
(s2237 0.0)
(s2238 0.0)
(s2239 0.0)
(s2240 0.0)
(s2241 0.0)
(s2242 0.0)
(s2243 0.0)
(s2244 0.0)
(s2245 0.0)
(s2246 1.0)
(s2247 0.0)
(s2248 0.0)
(s2249 0.0)
(s2250 0.0)
(s2251 0.0)
(s2252 0.0)
(s2253 0.0)
(s2254 1.0)
(s2255 0.0)
(s2256 0.0)
(s2257 0.0)
(s2258 0.0)
(s2259 0.0)
(s2260 0.0)
(s2261 0.0)
(s2262 0.0)
(s2263 0.0)
(s2264 1.0)
(s2265 0.0)
(s2266 0.0)
(s2267 1.0)
(s2268 0.0)
(s2269 0.0)
(s2270 0.0)
(s2271 0.0)
(s2272 0.0)
(s2273 0.0)
(s2274 0.0)
(s2275 0.0)
(s2276 0.0)
(s2277 0.0)
(s2278 0.0)
(s2279 0.0)
(s2280 0.0)
(s2281 0.0)
(s2282 0.0)
(s2283 0.0)
(s2284 0.0)
(s2285 1.0)
(s2286 1.0)
(s2287 0.0)
(s2288 0.0)
(s2289 0.0)
(s2290 0.0)
(s2291 0.0)
(s2292 0.0)
(s2293 0.0)
(s2294 1.0)
(s2295 0.0)
(s2296 0.0)
(s2297 0.0)
(s2298 0.0)
(s2299 0.0)
(s2300 0.0)
(s2301 0.0)
(s2302 0.0)
(s2303 0.0)
(s2304 0.0)
(s2305 1.0)
(s2306 0.0)
(s2307 0.0)
(s2308 0.0)
(s2309 0.0)
(s2310 0.0)
(s2311 0.0)
(s2312 0.0)
(s2313 0.0)
(s2314 0.0)
(s2315 1.0)
(s2316 0.0)
(s2317 0.0)
(s2318 0.0)
(s2319 0.0)
(s2320 0.0)
(s2321 0.0)
(s2322 0.0)
(s2323 0.0)
(s2324 0.0)
(s2325 0.0)
(s2326 0.0)
(s2327 0.0)
(s2328 0.0)
(s2329 0.0)
(s2330 0.0)
(s2331 1.0)
(s2332 1.0)
(s2333 0.0)
(s2334 0.0)
(s2335 0.0)
(s2336 0.0)
(s2337 0.0)
(s2338 0.0)
(s2339 0.0)
(s2340 0.0)
(s2341 0.0)
(s2342 0.0)
(s2343 1.0)
(s2344 0.0)
(s2345 0.0)
(s2346 0.0)
(s2347 0.0)
(s2348 0.0)
(s2349 0.0)
(s2350 0.0)
(s2351 0.0)
(s2352 0.0)
(s2353 0.0)
(s2354 0.0)
(s2355 1.0)
(s2356 0.0)
(s2357 0.0)
(s2358 0.0)
(s2359 0.0)
(s2360 0.0)
(s2361 0.0)
(s2362 1.0)
(s2363 0.0)
(s2364 0.0)
(s2365 0.0)
(s2366 0.0)
(s2367 0.0)
(s2368 0.0)
(s2369 0.0)
(s2370 0.0)
(s2371 0.0)
(s2372 1.0)
(s2373 0.0)
(s2374 0.0)
(s2375 0.0)
(s2376 0.0)
(s2377 0.0)
(s2378 0.0)
(s2379 1.0)
(s2380 0.0)
(s2381 0.0)
(s2382 0.0)
(s2383 0.0)
(s2384 0.0)
(s2385 0.0)
(s2386 0.0)
(s2387 0.0)
(s2388 0.0)
(s2389 0.0)
(s2390 1.0)
(s2391 0.0)
(s2392 0.0)
(s2393 0.0)
(s2394 0.0)
(s2395 0.0)
(s2396 0.0)
(s2397 0.0)
(s2398 0.0)
(s2399 0.0)
(s2400 0.0)
(s2401 0.0)
(s2402 0.0)
(s2403 0.0)
(s2404 0.0)
(s2405 0.0)
(s2406 0.0)
(s2407 0.0)
(s2408 1.0)
(s2409 0.0)
(s2410 0.0)
(s2411 0.0)
(s2412 0.0)
(s2413 0.0)
(s2414 0.0)
(s2415 0.0)
(s2416 0.0)
(s2417 1.0)
(s2418 0.0)
(s2419 0.0)
(s2420 0.0)
(s2421 0.0)
(s2422 0.0)
(s2423 0.0)
(s2424 0.0)
(s2425 0.0)
(s2426 0.0)
(s2427 0.0)
(s2428 1.0)
(s2429 0.0)
(s2430 0.0)
(s2431 0.0)
(s2432 0.0)
(s2433 0.0)
(s2434 0.0)
(s2435 0.0)
(s2436 0.0)
(s2437 0.0)
(s2438 0.0)
(s2439 0.0)
(s2440 0.0)
(s2441 0.0)
(s2442 0.0)
(s2443 0.0)
(s2444 0.0)
(s2445 0.0)
(s2446 0.0)
(s2447 1.0)
(s2448 0.0)
(s2449 0.0)
(s2450 0.0)
(s2451 0.0)
(s2452 0.0)
(s2453 0.0)
(s2454 0.0)
(s2455 0.0)
(s2456 0.0)
(s2457 1.0)
(s2458 0.0)
(s2459 0.0)
(s2460 0.0)
(s2461 0.0)
(s2462 0.0)
(s2463 0.0)
(s2464 0.0)
(s2465 0.0)
(s2466 0.0)
(s2467 0.0)
(s2468 0.0)
(s2469 0.0)
(s2470 0.0)
(s2471 0.0)
(s2472 0.0)
(s2473 0.0)
(s2474 0.0)
(s2475 1.0)
(s2476 0.0)
(s2477 0.0)
(s2478 0.0)
(s2479 0.0)
(s2480 0.0)
(s2481 0.0)
(s2482 0.0)
(s2483 1.0)
(s2484 0.0)
(s2485 0.0)
(s2486 1.0)
(s2487 0.0)
(s2488 0.0)
(s2489 0.0)
(s2490 0.0)
(s2491 0.0)
(s2492 0.0)
(s2493 0.0)
(s2494 0.0)
(s2495 0.0)
(s2496 0.0)
(s2497 0.0)
(s2498 0.0)
(s2499 0.0)
(s2500 1.0)
(s2501 0.0)
(s2502 0.0)
(s2503 0.0)
(s2504 0.0)
(s2505 0.0)
(s2506 0.0)
(s2507 0.0)
(s2508 1.0)
(s2509 0.0)
(s2510 0.0)
(s2511 0.0)
(s2512 0.0)
(s2513 0.0)
(s2514 1.0)
(s2515 0.0)
(s2516 0.0)
(s2517 0.0)
(s2518 0.0)
(s2519 0.0)
(s2520 0.0)
(s2521 0.0)
(s2522 0.0)
(s2523 0.0)
(s2524 0.0)
(s2525 0.0)
(s2526 0.0)
(s2527 0.0)
(s2528 0.0)
(s2529 1.0)
(s2530 0.0)
(s2531 0.0)
(s2532 0.0)
(s2533 0.0)
(s2534 1.0)
(s2535 0.0)
(s2536 0.0)
(s2537 0.0)
(s2538 0.0)
(s2539 0.0)
(s2540 0.0)
(s2541 0.0)
(s2542 0.0)
(s2543 0.0)
(s2544 0.0)
(s2545 0.0)
(s2546 0.0)
(s2547 0.0)
(s2548 0.0)
(s2549 0.0)
(s2550 0.0)
(s2551 1.0)
(s2552 0.0)
(s2553 1.0)
(s2554 0.0)
(s2555 0.0)
(s2556 0.0)
(s2557 0.0)
(s2558 0.0)
(s2559 0.0)
(s2560 1.0)
(s2561 0.0)
(s2562 0.0)
(s2563 0.0)
(s2564 0.0)
(s2565 0.0)
(s2566 0.0)
(s2567 0.0)
(s2568 0.0)
(s2569 0.0)
(s2570 0.0)
(s2571 1.0)
(s2572 0.0)
(s2573 0.0)
(s2574 0.0)
(s2575 0.0)
(s2576 0.0)
(s2577 0.0)
(s2578 0.0)
(s2579 0.0)
(s2580 0.0)
(s2581 0.0)
(s2582 0.0)
(s2583 0.0)
(s2584 0.0)
(s2585 0.0)
(s2586 0.0)
(s2587 0.0)
(s2588 0.0)
(s2589 1.0)
(s2590 1.0)
(s2591 0.0)
(s2592 0.0)
(s2593 0.0)
(s2594 0.0)
(s2595 0.0)
(s2596 0.0)
(s2597 0.0)
(s2598 0.0)
(s2599 0.0)
(s2600 0.0)
(s2601 0.0)
(s2602 0.0)
(s2603 0.0)
(s2604 0.0)
(s2605 1.0)
(s2606 0.0)
(s2607 1.0)
(s2608 0.0)
(s2609 0.0)
(s2610 0.0)
(s2611 0.0)
(s2612 0.0)
(s2613 0.0)
(s2614 0.0)
(s2615 0.0)
(s2616 0.0)
(s2617 0.0)
(s2618 0.0)
(s2619 1.0)
(s2620 0.0)
(s2621 0.0)
(s2622 0.0)
(s2623 0.0)
(s2624 0.0)
(s2625 0.0)
(s2626 0.0)
(s2627 0.0)
(s2628 1.0)
(s2629 0.0)
(s2630 0.0)
(s2631 0.0)
(s2632 0.0)
(s2633 0.0)
(s2634 0.0)
(s2635 0.0)
(s2636 0.0)
(s2637 0.0)
(s2638 0.0)
(s2639 0.0)
(s2640 0.0)
(s2641 0.0)
(s2642 0.0)
(s2643 1.0)
(s2644 0.0)
(s2645 0.0)
(s2646 0.0)
(s2647 1.0)
(s2648 0.0)
(s2649 0.0)
(s2650 0.0)
(s2651 0.0)
(s2652 0.0)
(s2653 0.0)
(s2654 0.0)
(s2655 0.0)
(s2656 0.0)
(s2657 0.0)
(s2658 0.0)
(s2659 0.0)
(s2660 0.0)
(s2661 0.0)
(s2662 0.0)
(s2663 1.0)
(s2664 0.0)
(s2665 0.0)
(s2666 0.0)
(s2667 0.0)
(s2668 0.0)
(s2669 1.0)
(s2670 0.0)
(s2671 0.0)
(s2672 0.0)
(s2673 0.0)
(s2674 1.0)
(s2675 0.0)
(s2676 0.0)
(s2677 0.0)
(s2678 0.0)
(s2679 0.0)
(s2680 0.0)
(s2681 0.0)
(s2682 0.0)
(s2683 0.0)
(s2684 0.0)
(s2685 1.0)
(s2686 0.0)
(s2687 0.0)
(s2688 0.0)
(s2689 0.0)
(s2690 0.0)
(s2691 0.0)
(s2692 0.0)
(s2693 0.0)
(s2694 0.0)
(s2695 0.0)
(s2696 0.0)
(s2697 0.0)
(s2698 1.0)
(s2699 0.0)
(s2700 0.0)
(s2701 0.0)
(s2702 0.0)
(s2703 0.0)
(s2704 0.0)
(s2705 0.0)
(s2706 0.0)
(s2707 0.0)
(s2708 1.0)
(s2709 0.0)
(s2710 0.0)
(s2711 0.0)
(s2712 0.0)
(s2713 0.0)
(s2714 0.0)
(s2715 1.0)
(s2716 0.0)
(s2717 0.0)
(s2718 0.0)
(s2719 0.0)
(s2720 0.0)
(s2721 0.0)
(s2722 1.0)
(s2723 0.0)
(s2724 0.0)
(s2725 0.0)
(s2726 0.0)
(s2727 0.0)
(s2728 0.0)
(s2729 0.0)
(s2730 0.0)
(s2731 0.0)
(s2732 0.0)
(s2733 0.0)
(s2734 0.0)
(s2735 0.0)
(s2736 0.0)
(s2737 0.0)
(s2738 0.0)
(s2739 0.0)
(s2740 0.0)
(s2741 0.0)
(s2742 1.0)
(s2743 0.0)
(s2744 0.0)
(s2745 0.0)
(s2746 0.0)
(s2747 0.0)
(s2748 1.0)
(s2749 0.0)
(s2750 0.0)
(s2751 0.0)
(s2752 0.0)
(s2753 0.0)
(s2754 0.0)
(s2755 0.0)
(s2756 0.0)
(s2757 0.0)
(s2758 1.0)
(s2759 0.0)
(s2760 0.0)
(s2761 0.0)
(s2762 0.0)
(s2763 0.0)
(s2764 0.0)
(s2765 0.0)
(s2766 0.0)
(s2767 1.0)
(s2768 0.0)
(s2769 0.0)
(s2770 0.0)
(s2771 0.0)
(s2772 1.0)
(s2773 0.0)
(s2774 0.0)
(s2775 0.0)
(s2776 0.0)
(s2777 0.0)
(s2778 0.0)
(s2779 0.0)
(s2780 0.0)
(s2781 0.0)
(s2782 0.0)
(s2783 0.0)
(s2784 0.0)
(s2785 0.0)
(s2786 0.0)
(s2787 0.0)
(s2788 1.0)
(s2789 1.0)
(s2790 0.0)
(s2791 0.0)
(s2792 0.0)
(s2793 0.0)
(s2794 0.0)
(s2795 0.0)
(s2796 0.0)
(s2797 0.0)
(s2798 0.0)
(s2799 0.0)
(s2800 1.0)
(s2801 0.0)
(s2802 0.0)
(s2803 0.0)
(s2804 0.0)
(s2805 0.0)
(s2806 0.0)
(s2807 0.0)
(s2808 0.0)
(s2809 0.0)
(s2810 0.0)
(s2811 0.0)
(s2812 0.0)
(s2813 0.0)
(s2814 0.0)
(s2815 0.0)
(s2816 0.0)
(s2817 0.0)
(s2818 1.0)
(s2819 0.0)
(s2820 1.0)
(s2821 0.0)
(s2822 0.0)
(s2823 0.0)
(s2824 0.0)
(s2825 0.0)
(s2826 0.0)
(s2827 0.0)
(s2828 0.0)
(s2829 0.0)
(s2830 1.0)
(s2831 0.0)
(s2832 0.0)
(s2833 0.0)
(s2834 0.0)
(s2835 0.0)
(s2836 0.0)
(s2837 0.0)
(s2838 1.0)
(s2839 0.0)
(s2840 0.0)
(s2841 0.0)
(s2842 0.0)
(s2843 0.0)
(s2844 0.0)
(s2845 0.0)
(s2846 0.0)
(s2847 0.0)
(s2848 0.0)
(s2849 0.0)
(s2850 0.0)
(s2851 0.0)
(s2852 0.0)
(s2853 0.0)
(s2854 0.0)
(s2855 0.0)
(s2856 1.0)
(s2857 0.0)
(s2858 1.0)
(s2859 0.0)
(s2860 0.0)
(s2861 0.0)
(s2862 0.0)
(s2863 0.0)
(s2864 0.0)
(s2865 0.0)
(s2866 0.0)
(s2867 0.0)
(s2868 1.0)
(s2869 0.0)
(s2870 0.0)
(s2871 0.0)
(s2872 0.0)
(s2873 0.0)
(s2874 0.0)
(s2875 0.0)
(s2876 1.0)
(s2877 0.0)
(s2878 0.0)
(s2879 0.0)
(s2880 0.0)
(s2881 0.0)
(s2882 0.0)
(s2883 0.0)
(s2884 0.0)
(s2885 1.0)
(s2886 0.0)
(s2887 0.0)
(s2888 0.0)
(s2889 0.0)
(s2890 0.0)
(s2891 0.0)
(s2892 0.0)
(s2893 0.0)
(s2894 0.0)
(s2895 0.0)
(s2896 0.0)
(s2897 0.0)
(s2898 0.0)
(s2899 0.0)
(s2900 0.0)
(s2901 0.0)
(s2902 0.0)
(s2903 0.0)
(s2904 0.0)
(s2905 1.0)
(s2906 0.0)
(s2907 0.0)
(s2908 0.0)
(s2909 0.0)
(s2910 0.0)
(s2911 0.0)
(s2912 0.0)
(s2913 0.0)
(s2914 1.0)
(s2915 0.0)
(s2916 0.0)
(s2917 0.0)
(s2918 0.0)
(s2919 0.0)
(s2920 0.0)
(s2921 0.0)
(s2922 0.0)
(s2923 1.0)
(s2924 0.0)
(s2925 0.0)
(s2926 0.0)
(s2927 0.0)
(s2928 0.0)
(s2929 0.0)
(s2930 0.0)
(s2931 0.0)
(s2932 0.0)
(s2933 0.0)
(s2934 0.0)
(s2935 0.0)
(s2936 0.0)
(s2937 0.0)
(s2938 0.0)
(s2939 0.0)
(s2940 0.0)
(s2941 0.0)
(s2942 0.0)
(s2943 0.0)
(s2944 1.0)
(s2945 0.0)
(s2946 0.0)
(s2947 0.0)
(s2948 0.0)
(s2949 0.0)
(s2950 0.0)
(s2951 0.0)
(s2952 1.0)
(s2953 0.0)
(s2954 0.0)
(s2955 0.0)
(s2956 0.0)
(s2957 0.0)
(s2958 0.0)
(s2959 0.0)
(s2960 0.0)
(s2961 0.0)
(s2962 0.0)
(s2963 1.0)
(s2964 0.0)
(s2965 0.0)
(s2966 0.0)
(s2967 0.0)
(s2968 0.0)
(s2969 0.0)
(s2970 0.0)
(s2971 1.0)
(s2972 0.0)
(s2973 0.0)
(s2974 0.0)
(s2975 0.0)
(s2976 0.0)
(s2977 0.0)
(s2978 0.0)
(s2979 0.0)
(s2980 0.0)
(s2981 0.0)
(s2982 1.0)
(s2983 0.0)
(s2984 0.0)
(s2985 0.0)
(s2986 0.0)
(s2987 0.0)
(s2988 0.0)
(s2989 0.0)
(s2990 1.0)
(s2991 0.0)
(s2992 0.0)
(s2993 0.0)
(s2994 0.0)
(s2995 0.0)
(s2996 0.0)
(s2997 0.0)
(s2998 0.0)
(s2999 0.0)
(s3000 1.0)
(s3001 0.0)
(s3002 0.0)
(s3003 0.0)
(s3004 0.0)
(s3005 0.0)
(s3006 0.0)
(s3007 0.0)
(s3008 0.0)
(s3009 0.0)
(s3010 1.0)
(s3011 0.0)
(s3012 0.0)
(s3013 0.0)
(s3014 0.0)
(s3015 0.0)
(s3016 0.0)
(s3017 0.0)
(s3018 0.0)
(s3019 0.0)
(s3020 0.0)
(s3021 0.0)
(s3022 0.0)
(s3023 0.0)
(s3024 0.0)
(s3025 1.0)
(s3026 0.0)
(s3027 0.0)
(s3028 (/ 7.0 8.0))
(s3029 0.0)
(s3030 0.0)
(s3031 (/ 1.0 8.0))
(s3032 0.0)
(s3033 0.0)
(s3034 0.0)
(s3035 0.0)
(s3036 0.0)
(s3037 0.0)
(s3038 1.0)
(s3039 0.0)
(s3040 0.0)
(s3041 0.0)
(s3042 0.0)
(s3043 0.0)
(s3044 0.0)
(s3045 0.0)
(s3046 0.0)
(s3047 1.0)
(s3048 0.0)
(s3049 0.0)
(s3050 0.0)
(s3051 0.0)
(s3052 0.0)
(s3053 0.0)
(s3054 0.0)
(s3055 0.0)
(s3056 0.0)
(s3057 1.0)
(s3058 0.0)
(s3059 0.0)
(s3060 0.0)
(s3061 0.0)
(s3062 0.0)
(s3063 0.0)
(s3064 0.0)
(s3065 0.0)
(s3066 0.0)
(s3067 0.0)
(s3068 0.0)
(s3069 0.0)
(s3070 (/ 1.0 8.0))
(s3071 (/ 7.0 8.0))
(s3072 0.0)
(s3073 0.0)
(s3074 (/ 7.0 8.0))
(s3075 0.0)
(s3076 0.0)
(s3077 0.0)
(s3078 0.0)
(s3079 0.0)
(s3080 0.0)
(s3081 0.0)
(s3082 (/ 1.0 8.0))
(s3083 0.0)
(s3084 0.0)
(s3085 0.0)
(s3086 0.0)
(s3087 0.0)
(s3088 0.0)
(s3089 0.0)
(s3090 0.0)
(s3091 0.0)
(s3092 (/ 1.0 8.0))
(s3093 0.0)
(s3094 0.0)
(s3095 0.0)
(s3096 0.0)
(s3097 0.0)
(s3098 (/ 1.0 8.0))
(s3099 0.0)
(s3100 0.0)
(s3101 0.0)
(s3102 0.0)
(s3103 0.0)
(s3104 0.0)
(s3105 0.0)
(s3106 0.0)
(s3107 0.0)
(s3108 0.0)
(s3109 1.0)
(s3110 0.0)
(s3111 0.0)
(s3112 0.0)
(s3113 0.0)
(s3114 0.0)
(s3115 0.0)
(s3116 1.0)
(s3117 0.0)
(s3118 0.0)
(s3119 0.0)
(s3120 0.0)
(s3121 0.0)
(s3122 0.0)
(s3123 0.0)
(s3124 0.0)
(s3125 0.0)
(s3126 0.0)
(s3127 0.0)
(s3128 0.0)
(s3129 1.0)
(s3130 0.0)
(s3131 0.0)
(s3132 0.0)
(s3133 0.0)
(s3134 0.0)
(s3135 0.0)
(s3136 0.0)
(s3137 0.0)
(s3138 1.0)
(s3139 0.0)
(s3140 0.0)
(s3141 0.0)
(s3142 0.0)
(s3143 1.0)
(s3144 0.0)
(s3145 0.0)
(s3146 0.0)
(s3147 0.0)
(s3148 0.0)
(s3149 0.0)
(s3150 0.0)
(s3151 0.0)
(s3152 0.0)
(s3153 0.0)
(s3154 1.0)
(s3155 0.0)
(s3156 0.0)
(s3157 0.0)
(s3158 0.0)
(s3159 0.0)
(s3160 0.0)
(s3161 0.0)
(s3162 0.0)
(s3163 0.0)
(s3164 0.0)
(s3165 0.0)
(s3166 0.0)
(s3167 1.0)
(s3168 0.0)
(s3169 1.0)
(s3170 0.0)
(s3171 0.0)
(s3172 0.0)
(s3173 0.0)
(s3174 0.0)
(s3175 0.0)
(s3176 0.0)
(s3177 0.0)
(s3178 1.0)
(s3179 0.0)
(s3180 0.0)
(s3181 0.0)
(s3182 0.0)
(s3183 0.0)
(s3184 0.0)
(s3185 0.0)
(s3186 0.0)
(s3187 0.0)
(s3188 0.0)
(s3189 0.0)
(s3190 0.0)
(s3191 0.0)
(s3192 0.0)
(s3193 0.0)
(s3194 0.0)
(s3195 0.0)
(s3196 0.0)
(s3197 0.0)
(s3198 1.0)
(s3199 0.0)
(s3200 1.0)
(s3201 0.0)
(s3202 0.0)
(s3203 0.0)
(s3204 0.0)
(s3205 0.0)
(s3206 0.0)
(s3207 0.0)
(s3208 1.0)
(s3209 0.0)
(s3210 0.0)
(s3211 0.0)
(s3212 0.0)
(s3213 0.0)
(s3214 0.0)
(s3215 0.0)
(s3216 0.0)
(s3217 0.0)
(s3218 (/ 7.0 8.0))
(s3219 0.0)
(s3220 (/ 1.0 8.0))
(s3221 0.0)
(s3222 0.0)
(s3223 0.0)
(s3224 0.0)
(s3225 0.0)
(s3226 0.0)
(s3227 0.0)
(s3228 0.0)
(s3229 0.0)
(s3230 1.0)
(s3231 0.0)
(s3232 0.0)
(s3233 0.0)
(s3234 0.0)
(s3235 0.0)
(s3236 0.0)
(s3237 0.0)
(s3238 1.0)
(s3239 0.0)
(s3240 0.0)
(s3241 0.0)
(s3242 0.0)
(s3243 0.0)
(s3244 0.0)
(s3245 0.0)
(s3246 1.0)
(s3247 0.0)
(s3248 0.0)
(s3249 0.0)
(s3250 0.0)
(s3251 0.0)
(s3252 0.0)
(s3253 0.0)
(s3254 0.0)
(s3255 0.0)
(s3256 0.0)
(s3257 0.0)
(s3258 0.0)
(s3259 0.0)
(s3260 0.0)
(s3261 0.0)
(s3262 1.0)
(s3263 0.0)
(s3264 0.0)
(s3265 0.0)
(s3266 0.0)
(s3267 0.0)
(s3268 0.0)
(s3269 1.0)
(s3270 0.0)
(s3271 0.0)
(s3272 0.0)
(s3273 0.0)
(s3274 0.0)
(s3275 0.0)
(s3276 0.0)
(s3277 0.0)
(s3278 0.0)
(s3279 0.0)
(s3280 0.0)
(s3281 0.0)
(s3282 0.0)
(s3283 0.0)
(s3284 1.0)
(s3285 0.0)
(s3286 0.0)
(s3287 1.0)
(s3288 0.0)
(s3289 0.0)
(s3290 0.0)
(s3291 0.0)
(s3292 0.0)
(s3293 0.0)
(s3294 1.0)
(s3295 0.0)
(s3296 0.0)
(s3297 0.0)
(s3298 0.0)
(s3299 0.0)
(s3300 0.0)
(s3301 0.0)
(s3302 0.0)
(s3303 0.0)
(s3304 0.0)
(s3305 0.0)
(s3306 1.0)
(s3307 0.0)
(s3308 0.0)
(s3309 0.0)
(s3310 0.0)
(s3311 0.0)
(s3312 0.0)
(s3313 0.0)
(s3314 0.0)
(s3315 0.0)
(s3316 0.0)
(s3317 0.0)
(s3318 0.0)
(s3319 0.0)
(s3320 0.0)
(s3321 1.0)
(s3322 0.0)
(s3323 1.0)
(s3324 0.0)
(s3325 0.0)
(s3326 0.0)
(s3327 0.0)
(s3328 0.0)
(s3329 0.0)
(s3330 0.0)
(s3331 0.0)
(s3332 0.0)
(s3333 1.0)
(s3334 0.0)
(s3335 0.0)
(s3336 0.0)
(s3337 0.0)
(s3338 0.0)
(s3339 0.0)
(s3340 0.0)
(s3341 0.0)
(s3342 0.0)
(s3343 0.0)
(s3344 0.0)
(s3345 1.0)
(s3346 0.0)
(s3347 0.0)
(s3348 0.0)
(s3349 0.0)
(s3350 0.0)
(s3351 0.0)
(s3352 0.0)
(s3353 0.0)
(s3354 1.0)
(s3355 0.0)
(s3356 0.0)
(s3357 0.0)
(s3358 0.0)
(s3359 0.0)
(s3360 0.0)
(s3361 0.0)
(s3362 0.0)
(s3363 0.0)
(s3364 1.0)
(s3365 0.0)
(s3366 0.0)
(s3367 0.0)
(s3368 0.0)
(s3369 0.0)
(s3370 0.0)
(s3371 0.0)
(s3372 0.0)
(s3373 0.0)
(s3374 0.0)
(s3375 0.0)
(s3376 0.0)
(s3377 1.0)
(s3378 0.0)
(s3379 0.0)
(s3380 0.0)
(s3381 0.0)
(s3382 0.0)
(s3383 0.0)
(s3384 0.0)
(s3385 0.0)
(s3386 0.0)
(s3387 0.0)
(s3388 0.0)
(s3389 0.0)
(s3390 1.0)
(s3391 0.0)
(s3392 0.0)
(s3393 0.0)
(s3394 0.0)
(s3395 0.0)
(s3396 0.0)
(s3397 0.0)
(s3398 1.0)
(s3399 0.0)
(s3400 0.0)
(s3401 0.0)
(s3402 0.0)
(s3403 0.0)
(s3404 0.0)
(s3405 0.0)
(s3406 1.0)
(s3407 0.0)
(s3408 0.0)
(s3409 0.0)
(s3410 0.0)
(s3411 0.0)
(s3412 0.0)
(s3413 0.0)
(s3414 0.0)
(s3415 1.0)
(s3416 0.0)
(s3417 0.0)
(s3418 0.0)
(s3419 0.0)
(s3420 0.0)
(s3421 1.0)
(s3422 0.0)
(s3423 0.0)
(s3424 0.0)
(s3425 0.0)
(s3426 0.0)
(s3427 0.0)
(s3428 0.0)
(s3429 1.0)
(s3430 0.0)
(s3431 0.0)
(s3432 0.0)
(s3433 0.0)
(s3434 0.0)
(s3435 0.0)
(s3436 0.0)
(s3437 0.0)
(s3438 0.0)
(s3439 0.0)
(s3440 1.0)
(s3441 0.0)
(s3442 0.0)
(s3443 0.0)
(s3444 0.0)
(s3445 0.0)
(s3446 1.0)
(s3447 0.0)
(s3448 0.0)
(s3449 0.0)
(s3450 0.0)
(s3451 0.0)
(s3452 0.0)
(s3453 0.0)
(s3454 0.0)
(s3455 0.0)
(s3456 0.0)
(s3457 0.0)
(s3458 0.0)
(s3459 0.0)
(s3460 1.0)
(s3461 0.0)
(s3462 0.0)
(s3463 0.0)
(s3464 0.0)
(s3465 0.0)
(s3466 0.0)
(s3467 0.0)
(s3468 0.0)
(s3469 0.0)
(s3470 1.0)
(s3471 0.0)
(s3472 0.0)
(s3473 0.0)
(s3474 0.0)
(s3475 0.0)
(s3476 0.0)
(s3477 1.0)
(s3478 0.0)
(s3479 0.0)
(s3480 0.0)
(s3481 0.0)
(s3482 0.0)
(s3483 0.0)
(s3484 0.0)
(s3485 0.0)
(s3486 1.0)
(s3487 0.0)
(s3488 0.0)
(s3489 0.0)
(s3490 0.0)
(s3491 0.0)
(s3492 0.0)
(s3493 0.0)
(s3494 0.0)
(s3495 1.0)
(s3496 0.0)
(s3497 0.0)
(s3498 0.0)
(s3499 0.0)
(s3500 0.0)
(s3501 0.0)
(s3502 0.0)
(s3503 0.0)
(s3504 0.0)
(s3505 0.0)
(s3506 0.0)
(s3507 0.0)
(s3508 0.0)
(s3509 0.0)
(s3510 0.0)
(s3511 0.0)
(s3512 0.0)
(s3513 0.0)
(s3514 0.0)
(s3515 0.0)
(s3516 0.0)
(s3517 0.0)
(s3518 0.0)
(s3519 0.0)
(s3520 0.0)
(s3521 1.0)
(s3522 0.0)
(s3523 0.0)
(s3524 0.0)
(s3525 1.0)
(s3526 0.0)
(s3527 0.0)
(s3528 0.0)
(s3529 0.0)
(s3530 0.0)
(s3531 0.0)
(s3532 0.0)
(s3533 0.0)
(s3534 1.0)
(s3535 0.0)
(s3536 0.0)
(s3537 0.0)
(s3538 0.0)
(s3539 0.0)
(s3540 0.0)
(s3541 0.0)
(s3542 0.0)
(s3543 0.0)
(s3544 1.0)
(s3545 0.0)
(s3546 0.0)
(s3547 0.0)
(s3548 0.0)
(s3549 0.0)
(s3550 0.0)
(s3551 1.0)
(s3552 0.0)
(s3553 0.0)
(s3554 0.0)
(s3555 0.0)
(s3556 0.0)
(s3557 0.0)
(s3558 0.0)
(s3559 0.0)
(s3560 0.0)
(s3561 0.0)
(s3562 0.0)
(s3563 0.0)
(s3564 0.0)
(s3565 0.0)
(s3566 0.0)
(s3567 1.0)
(s3568 0.0)
(s3569 0.0)
(s3570 0.0)
(s3571 1.0)
(s3572 0.0)
(s3573 0.0)
(s3574 0.0)
(s3575 0.0)
(s3576 0.0)
(s3577 0.0)
(s3578 0.0)
(s3579 0.0)
(s3580 0.0)
(s3581 0.0)
(s3582 0.0)
(s3583 0.0)
(s3584 0.0)
(s3585 0.0)
(s3586 0.0)
(s3587 0.0)
(s3588 0.0)
(s3589 0.0)
(s3590 0.0)
(s3591 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7816/7816 variables, and 4309 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 3908/3908 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 272/291 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 22:00:32] [INFO ] Deduced a trap composed of 101 places in 65 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 3617/3908 variables, 382/402 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 22:00:34] [INFO ] Deduced a trap composed of 28 places in 407 ms of which 9 ms to minimize.
[2024-06-01 22:00:34] [INFO ] Deduced a trap composed of 36 places in 436 ms of which 8 ms to minimize.
[2024-06-01 22:00:35] [INFO ] Deduced a trap composed of 19 places in 426 ms of which 8 ms to minimize.
[2024-06-01 22:00:35] [INFO ] Deduced a trap composed of 31 places in 428 ms of which 8 ms to minimize.
[2024-06-01 22:00:35] [INFO ] Deduced a trap composed of 37 places in 374 ms of which 8 ms to minimize.
[2024-06-01 22:00:36] [INFO ] Deduced a trap composed of 51 places in 362 ms of which 7 ms to minimize.
[2024-06-01 22:00:36] [INFO ] Deduced a trap composed of 37 places in 350 ms of which 7 ms to minimize.
[2024-06-01 22:00:37] [INFO ] Deduced a trap composed of 43 places in 345 ms of which 7 ms to minimize.
[2024-06-01 22:00:37] [INFO ] Deduced a trap composed of 27 places in 346 ms of which 6 ms to minimize.
SMT process timed out in 10120ms, After SMT, problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 3908 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1084 transitions
Trivial Post-agglo rules discarded 1084 transitions
Performed 1084 trivial Post agglomeration. Transition count delta: 1084
Iterating post reduction 0 with 1084 rules applied. Total rules applied 1084 place count 3908 transition count 2824
Reduce places removed 1084 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 1089 rules applied. Total rules applied 2173 place count 2824 transition count 2819
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 2178 place count 2819 transition count 2819
Performed 790 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 790 Pre rules applied. Total rules applied 2178 place count 2819 transition count 2029
Deduced a syphon composed of 790 places in 5 ms
Reduce places removed 790 places and 0 transitions.
Iterating global reduction 3 with 1580 rules applied. Total rules applied 3758 place count 2029 transition count 2029
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 3759 place count 2028 transition count 2028
Iterating global reduction 3 with 1 rules applied. Total rules applied 3760 place count 2028 transition count 2028
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 3760 place count 2028 transition count 2027
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3762 place count 2027 transition count 2027
Performed 905 Post agglomeration using F-continuation condition.Transition count delta: 905
Deduced a syphon composed of 905 places in 1 ms
Reduce places removed 905 places and 0 transitions.
Iterating global reduction 3 with 1810 rules applied. Total rules applied 5572 place count 1122 transition count 1122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5573 place count 1122 transition count 1121
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5575 place count 1121 transition count 1120
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5777 place count 1020 transition count 1217
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5979 place count 919 transition count 1317
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 90 places in 6 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 4 with 180 rules applied. Total rules applied 6159 place count 829 transition count 1402
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6160 place count 829 transition count 1401
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6161 place count 829 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6162 place count 828 transition count 1400
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 6163 place count 828 transition count 1399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 6164 place count 827 transition count 1398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 6165 place count 826 transition count 1398
Applied a total of 6165 rules in 989 ms. Remains 826 /3908 variables (removed 3082) and now considering 1398/3908 (removed 2510) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 989 ms. Remains : 826/3908 places, 1398/3908 transitions.
RANDOM walk for 40000 steps (11 resets) in 708 ms. (56 steps per ms) remains 13/15 properties
BEST_FIRST walk for 40002 steps (9 resets) in 327 ms. (121 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 313 ms. (127 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (10 resets) in 323 ms. (123 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (9 resets) in 211 ms. (188 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 208 ms. (191 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 289 ms. (137 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 276 ms. (144 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 13/13 properties
// Phase 1: matrix 1398 rows 826 cols
[2024-06-01 22:00:39] [INFO ] Computed 400 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 35/49 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 111/160 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 280/440 variables, 100/163 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 49/212 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/441 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 279/720 variables, 108/322 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/720 variables, 54/376 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/720 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 220/940 variables, 80/456 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/940 variables, 40/496 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/940 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 200/1140 variables, 74/570 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1140 variables, 36/606 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1140 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 1/1141 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1141 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1141 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (OVERLAPS) 153/1294 variables, 61/669 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1294 variables, 29/698 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1294 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (OVERLAPS) 1/1295 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1295 variables, 1/700 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1295 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (OVERLAPS) 135/1430 variables, 50/750 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1430 variables, 25/775 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1430 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 32 (OVERLAPS) 132/1562 variables, 48/823 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1562 variables, 24/847 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1562 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 35 (OVERLAPS) 113/1675 variables, 44/891 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1675 variables, 21/912 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1675 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 38 (OVERLAPS) 1/1676 variables, 1/913 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1676 variables, 1/914 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1676 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 41 (OVERLAPS) 88/1764 variables, 32/946 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1764 variables, 16/962 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1764 variables, 0/962 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 44 (OVERLAPS) 88/1852 variables, 32/994 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1852 variables, 16/1010 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1852 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 47 (OVERLAPS) 75/1927 variables, 30/1040 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1927 variables, 15/1055 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1927 variables, 0/1055 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 50 (OVERLAPS) 47/1974 variables, 18/1073 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1974 variables, 9/1082 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1974 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 53 (OVERLAPS) 44/2018 variables, 16/1098 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2018 variables, 8/1106 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2018 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 56 (OVERLAPS) 44/2062 variables, 16/1122 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2062 variables, 8/1130 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2062 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 59 (OVERLAPS) 44/2106 variables, 16/1146 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2106 variables, 8/1154 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2106 variables, 0/1154 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 62 (OVERLAPS) 44/2150 variables, 16/1170 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2150 variables, 8/1178 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2150 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 65 (OVERLAPS) 41/2191 variables, 16/1194 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2191 variables, 8/1202 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2191 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 68 (OVERLAPS) 27/2218 variables, 12/1214 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2218 variables, 6/1220 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2218 variables, 0/1220 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 71 (OVERLAPS) 6/2224 variables, 4/1224 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2224 variables, 2/1226 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2224 variables, 0/1226 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 74 (OVERLAPS) 0/2224 variables, 0/1226 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2224/2224 variables, and 1226 constraints, problems are : Problem set: 0 solved, 13 unsolved in 6486 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 826/826 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 35/49 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 111/160 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 280/440 variables, 100/172 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 49/221 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 1/441 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 279/720 variables, 108/335 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/720 variables, 54/389 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/720 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 220/940 variables, 80/469 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/940 variables, 40/509 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/940 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 200/1140 variables, 74/583 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1140 variables, 36/619 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1140 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (OVERLAPS) 1/1141 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1141 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1141 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (OVERLAPS) 153/1294 variables, 61/682 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1294 variables, 29/711 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1294 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (OVERLAPS) 1/1295 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1295 variables, 1/713 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1295 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (OVERLAPS) 135/1430 variables, 50/763 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1430 variables, 25/788 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1430 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 34 (OVERLAPS) 132/1562 variables, 48/836 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1562 variables, 24/860 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1562 variables, 0/860 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 37 (OVERLAPS) 113/1675 variables, 44/904 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1675 variables, 21/925 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1675 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 40 (OVERLAPS) 1/1676 variables, 1/926 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1676 variables, 1/927 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1676 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 43 (OVERLAPS) 88/1764 variables, 32/959 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1764 variables, 16/975 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1764 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 46 (OVERLAPS) 88/1852 variables, 32/1007 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1852 variables, 16/1023 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1852 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 49 (OVERLAPS) 75/1927 variables, 30/1053 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1927 variables, 15/1068 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1927 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 52 (OVERLAPS) 47/1974 variables, 18/1086 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1974 variables, 9/1095 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1974 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 55 (OVERLAPS) 44/2018 variables, 16/1111 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2018 variables, 8/1119 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2018 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 58 (OVERLAPS) 44/2062 variables, 16/1135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2062 variables, 8/1143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2062 variables, 0/1143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 61 (OVERLAPS) 44/2106 variables, 16/1159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2106 variables, 8/1167 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2106 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 64 (OVERLAPS) 44/2150 variables, 16/1183 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2150 variables, 8/1191 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2150 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 67 (OVERLAPS) 41/2191 variables, 16/1207 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/2191 variables, 8/1215 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2191 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 70 (OVERLAPS) 27/2218 variables, 12/1227 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2218 variables, 6/1233 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2218 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 73 (OVERLAPS) 6/2224 variables, 4/1237 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/2224 variables, 2/1239 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2224 variables, 0/1239 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 76 (OVERLAPS) 0/2224 variables, 0/1239 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2224/2224 variables, and 1239 constraints, problems are : Problem set: 0 solved, 13 unsolved in 8034 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 826/826 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 14542ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 1597 ms.
Support contains 12 out of 826 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 826/826 places, 1398/1398 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 826 transition count 1397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 825 transition count 1397
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 825 transition count 1394
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 822 transition count 1394
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 821 transition count 1393
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 818 transition count 1395
Applied a total of 16 rules in 91 ms. Remains 818 /826 variables (removed 8) and now considering 1395/1398 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 818/826 places, 1395/1398 transitions.
RANDOM walk for 40000 steps (14 resets) in 639 ms. (62 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (9 resets) in 337 ms. (118 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (9 resets) in 239 ms. (166 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 204 ms. (195 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (9 resets) in 206 ms. (193 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (9 resets) in 205 ms. (194 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (9 resets) in 206 ms. (193 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 112871 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 10
Probabilistic random walk after 112871 steps, saw 70429 distinct states, run finished after 3004 ms. (steps per millisecond=37 ) properties seen :0
// Phase 1: matrix 1395 rows 818 cols
[2024-06-01 22:01:00] [INFO ] Computed 400 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 27/38 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 86/124 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 200/324 variables, 72/121 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 36/157 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 206/530 variables, 78/235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 39/274 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 176/706 variables, 64/338 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/706 variables, 32/370 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/706 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 151/857 variables, 58/428 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/857 variables, 29/457 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/857 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 135/992 variables, 50/507 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/992 variables, 25/532 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/992 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 132/1124 variables, 48/580 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1124 variables, 24/604 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1124 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 132/1256 variables, 48/652 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1256 variables, 24/676 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1256 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (OVERLAPS) 112/1368 variables, 44/720 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1368 variables, 22/742 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1368 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (OVERLAPS) 88/1456 variables, 32/774 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1456 variables, 16/790 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1456 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (OVERLAPS) 88/1544 variables, 32/822 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1544 variables, 15/837 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1544 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (OVERLAPS) 2/1546 variables, 1/838 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1546 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 37 (OVERLAPS) 74/1620 variables, 32/870 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1620 variables, 15/885 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1620 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 40 (OVERLAPS) 47/1667 variables, 18/903 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1667 variables, 9/912 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1667 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 43 (OVERLAPS) 44/1711 variables, 16/928 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1711 variables, 8/936 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1711 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 46 (OVERLAPS) 44/1755 variables, 16/952 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1755 variables, 8/960 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1755 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 49 (OVERLAPS) 44/1799 variables, 16/976 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1799 variables, 8/984 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1799 variables, 0/984 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 52 (OVERLAPS) 44/1843 variables, 16/1000 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1843 variables, 8/1008 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1843 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 55 (OVERLAPS) 44/1887 variables, 16/1024 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1887 variables, 8/1032 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1887 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 58 (OVERLAPS) 41/1928 variables, 16/1048 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1928 variables, 8/1056 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1928 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 61 (OVERLAPS) 28/1956 variables, 12/1068 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1956 variables, 6/1074 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1956 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 64 (OVERLAPS) 22/1978 variables, 8/1082 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1978 variables, 4/1086 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1978 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 67 (OVERLAPS) 22/2000 variables, 8/1094 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/2000 variables, 4/1098 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2000 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 70 (OVERLAPS) 22/2022 variables, 8/1106 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2022 variables, 4/1110 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2022 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 73 (OVERLAPS) 22/2044 variables, 8/1118 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/2044 variables, 4/1122 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2044 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 76 (OVERLAPS) 22/2066 variables, 8/1130 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/2066 variables, 4/1134 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/2066 variables, 0/1134 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 79 (OVERLAPS) 22/2088 variables, 8/1142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/2088 variables, 4/1146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/2088 variables, 0/1146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 82 (OVERLAPS) 22/2110 variables, 8/1154 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2110 variables, 4/1158 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2110 variables, 0/1158 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 85 (OVERLAPS) 22/2132 variables, 8/1166 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2132 variables, 4/1170 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2132 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 88 (OVERLAPS) 22/2154 variables, 8/1178 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2154 variables, 4/1182 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/2154 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 91 (OVERLAPS) 22/2176 variables, 8/1190 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2176 variables, 4/1194 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/2176 variables, 0/1194 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 94 (OVERLAPS) 20/2196 variables, 8/1202 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2196 variables, 4/1206 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2196 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 97 (OVERLAPS) 14/2210 variables, 6/1212 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2210 variables, 3/1215 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/2210 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 100 (OVERLAPS) 3/2213 variables, 2/1217 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2213 variables, 1/1218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/2213 variables, 0/1218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 103 (OVERLAPS) 0/2213 variables, 0/1218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2213/2213 variables, and 1218 constraints, problems are : Problem set: 0 solved, 10 unsolved in 7253 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 818/818 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 27/38 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 86/124 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 200/324 variables, 72/128 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 36/164 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 206/530 variables, 78/245 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/530 variables, 39/284 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/530 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 176/706 variables, 64/348 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/706 variables, 32/380 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/706 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 151/857 variables, 58/438 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/857 variables, 29/467 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/857 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 135/992 variables, 50/517 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/992 variables, 25/542 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/992 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 132/1124 variables, 48/590 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1124 variables, 24/614 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1124 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 132/1256 variables, 48/662 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1256 variables, 24/686 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1256 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (OVERLAPS) 112/1368 variables, 44/730 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1368 variables, 22/752 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1368 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (OVERLAPS) 88/1456 variables, 32/784 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1456 variables, 16/800 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1456 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 34 (OVERLAPS) 88/1544 variables, 32/832 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1544 variables, 15/847 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1544 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 37 (OVERLAPS) 2/1546 variables, 1/848 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1546 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 39 (OVERLAPS) 74/1620 variables, 32/880 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1620 variables, 15/895 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1620 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 42 (OVERLAPS) 47/1667 variables, 18/913 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1667 variables, 9/922 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1667 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 45 (OVERLAPS) 44/1711 variables, 16/938 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1711 variables, 8/946 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1711 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 48 (OVERLAPS) 44/1755 variables, 16/962 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1755 variables, 8/970 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1755 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 51 (OVERLAPS) 44/1799 variables, 16/986 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1799 variables, 8/994 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1799 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 54 (OVERLAPS) 44/1843 variables, 16/1010 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1843 variables, 8/1018 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1843 variables, 0/1018 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 57 (OVERLAPS) 44/1887 variables, 16/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1887 variables, 8/1042 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1887 variables, 0/1042 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 60 (OVERLAPS) 41/1928 variables, 16/1058 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1928 variables, 8/1066 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1928 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 63 (OVERLAPS) 28/1956 variables, 12/1078 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1956 variables, 6/1084 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1956 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 66 (OVERLAPS) 22/1978 variables, 8/1092 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1978 variables, 4/1096 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1978 variables, 0/1096 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 69 (OVERLAPS) 22/2000 variables, 8/1104 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2000 variables, 4/1108 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2000 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 72 (OVERLAPS) 22/2022 variables, 8/1116 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2022 variables, 4/1120 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/2022 variables, 0/1120 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 75 (OVERLAPS) 22/2044 variables, 8/1128 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/2044 variables, 4/1132 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/2044 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 78 (OVERLAPS) 22/2066 variables, 8/1140 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/2066 variables, 4/1144 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/2066 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 81 (OVERLAPS) 22/2088 variables, 8/1152 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/2088 variables, 4/1156 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2088 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 84 (OVERLAPS) 22/2110 variables, 8/1164 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/2110 variables, 4/1168 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2110 variables, 0/1168 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 87 (OVERLAPS) 22/2132 variables, 8/1176 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/2132 variables, 4/1180 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2132 variables, 0/1180 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 90 (OVERLAPS) 22/2154 variables, 8/1188 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/2154 variables, 4/1192 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2154 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 93 (OVERLAPS) 22/2176 variables, 8/1200 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/2176 variables, 4/1204 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2176 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 96 (OVERLAPS) 20/2196 variables, 8/1212 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/2196 variables, 4/1216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2196 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 99 (OVERLAPS) 14/2210 variables, 6/1222 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/2210 variables, 3/1225 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2210 variables, 0/1225 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 102 (OVERLAPS) 3/2213 variables, 2/1227 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/2213 variables, 1/1228 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2213 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 105 (OVERLAPS) 0/2213 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2213/2213 variables, and 1228 constraints, problems are : Problem set: 0 solved, 10 unsolved in 8622 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 818/818 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 15890ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1200 ms.
Support contains 11 out of 818 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 818/818 places, 1395/1395 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 818 transition count 1394
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 817 transition count 1394
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 816 transition count 1396
Applied a total of 4 rules in 63 ms. Remains 816 /818 variables (removed 2) and now considering 1396/1395 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 816/818 places, 1396/1395 transitions.
RANDOM walk for 40000 steps (15 resets) in 518 ms. (77 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 320 ms. (124 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 318 ms. (125 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (9 resets) in 247 ms. (161 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 206 ms. (193 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 201 ms. (198 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (9 resets) in 204 ms. (195 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 121903 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 10
Probabilistic random walk after 121903 steps, saw 75066 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
// Phase 1: matrix 1396 rows 816 cols
[2024-06-01 22:01:21] [INFO ] Computed 400 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 27/38 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 86/124 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 200/324 variables, 72/121 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 36/157 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 206/530 variables, 78/235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 39/274 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 176/706 variables, 64/338 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/706 variables, 32/370 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/706 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 151/857 variables, 58/428 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/857 variables, 29/457 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/857 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 135/992 variables, 50/507 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/992 variables, 25/532 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/992 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 132/1124 variables, 48/580 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1124 variables, 24/604 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1124 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 132/1256 variables, 48/652 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1256 variables, 24/676 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1256 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (OVERLAPS) 112/1368 variables, 44/720 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1368 variables, 22/742 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1368 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (OVERLAPS) 88/1456 variables, 32/774 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1456 variables, 16/790 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1456 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (OVERLAPS) 88/1544 variables, 32/822 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1544 variables, 16/838 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1544 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (OVERLAPS) 75/1619 variables, 30/868 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1619 variables, 15/883 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1619 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 38 (OVERLAPS) 47/1666 variables, 18/901 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1666 variables, 9/910 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1666 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 41 (OVERLAPS) 44/1710 variables, 16/926 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1710 variables, 8/934 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1710 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 44 (OVERLAPS) 44/1754 variables, 16/950 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1754 variables, 8/958 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1754 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 47 (OVERLAPS) 44/1798 variables, 16/974 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1798 variables, 8/982 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1798 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 50 (OVERLAPS) 44/1842 variables, 16/998 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1842 variables, 8/1006 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1842 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 53 (OVERLAPS) 44/1886 variables, 16/1022 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1886 variables, 8/1030 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1886 variables, 0/1030 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 56 (OVERLAPS) 41/1927 variables, 16/1046 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1927 variables, 8/1054 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1927 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 59 (OVERLAPS) 28/1955 variables, 12/1066 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1955 variables, 6/1072 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1955 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 62 (OVERLAPS) 22/1977 variables, 8/1080 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1977 variables, 4/1084 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1977 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 65 (OVERLAPS) 22/1999 variables, 8/1092 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1999 variables, 4/1096 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1999 variables, 0/1096 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 68 (OVERLAPS) 22/2021 variables, 8/1104 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2021 variables, 4/1108 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2021 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 71 (OVERLAPS) 22/2043 variables, 8/1116 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2043 variables, 4/1120 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2043 variables, 0/1120 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 74 (OVERLAPS) 22/2065 variables, 8/1128 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2065 variables, 4/1132 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/2065 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 77 (OVERLAPS) 22/2087 variables, 8/1140 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/2087 variables, 4/1144 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/2087 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 80 (OVERLAPS) 22/2109 variables, 8/1152 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/2109 variables, 4/1156 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/2109 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 83 (OVERLAPS) 22/2131 variables, 8/1164 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2131 variables, 4/1168 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/2131 variables, 0/1168 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 86 (OVERLAPS) 22/2153 variables, 8/1176 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2153 variables, 4/1180 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/2153 variables, 0/1180 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 89 (OVERLAPS) 22/2175 variables, 8/1188 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/2175 variables, 4/1192 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/2175 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 92 (OVERLAPS) 20/2195 variables, 8/1200 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/2195 variables, 4/1204 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/2195 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 95 (OVERLAPS) 14/2209 variables, 6/1210 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2209 variables, 3/1213 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/2209 variables, 0/1213 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 98 (OVERLAPS) 3/2212 variables, 2/1215 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/2212 variables, 1/1216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/2212 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 101 (OVERLAPS) 0/2212 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2212/2212 variables, and 1216 constraints, problems are : Problem set: 0 solved, 10 unsolved in 6946 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 816/816 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 27/38 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 86/124 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 200/324 variables, 72/128 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 36/164 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 206/530 variables, 78/245 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/530 variables, 39/284 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/530 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 176/706 variables, 64/348 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/706 variables, 32/380 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/706 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 151/857 variables, 58/438 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/857 variables, 29/467 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/857 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 135/992 variables, 50/517 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/992 variables, 25/542 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/992 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 132/1124 variables, 48/590 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1124 variables, 24/614 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1124 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 132/1256 variables, 48/662 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1256 variables, 24/686 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1256 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (OVERLAPS) 112/1368 variables, 44/730 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1368 variables, 22/752 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1368 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (OVERLAPS) 88/1456 variables, 32/784 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1456 variables, 16/800 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1456 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 34 (OVERLAPS) 88/1544 variables, 32/832 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1544 variables, 16/848 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1544 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 37 (OVERLAPS) 75/1619 variables, 30/878 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1619 variables, 15/893 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1619 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 40 (OVERLAPS) 47/1666 variables, 18/911 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1666 variables, 9/920 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1666 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 43 (OVERLAPS) 44/1710 variables, 16/936 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1710 variables, 8/944 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1710 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 46 (OVERLAPS) 44/1754 variables, 16/960 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1754 variables, 8/968 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1754 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 49 (OVERLAPS) 44/1798 variables, 16/984 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1798 variables, 8/992 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1798 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 52 (OVERLAPS) 44/1842 variables, 16/1008 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1842 variables, 8/1016 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1842 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 55 (OVERLAPS) 44/1886 variables, 16/1032 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1886 variables, 8/1040 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1886 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 58 (OVERLAPS) 41/1927 variables, 16/1056 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1927 variables, 8/1064 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1927 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 61 (OVERLAPS) 28/1955 variables, 12/1076 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1955 variables, 6/1082 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1955 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 64 (OVERLAPS) 22/1977 variables, 8/1090 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1977 variables, 4/1094 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1977 variables, 0/1094 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 67 (OVERLAPS) 22/1999 variables, 8/1102 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1999 variables, 4/1106 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1999 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 70 (OVERLAPS) 22/2021 variables, 8/1114 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2021 variables, 4/1118 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2021 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 73 (OVERLAPS) 22/2043 variables, 8/1126 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/2043 variables, 4/1130 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2043 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 76 (OVERLAPS) 22/2065 variables, 8/1138 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/2065 variables, 4/1142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/2065 variables, 0/1142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 79 (OVERLAPS) 22/2087 variables, 8/1150 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/2087 variables, 4/1154 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/2087 variables, 0/1154 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 82 (OVERLAPS) 22/2109 variables, 8/1162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2109 variables, 4/1166 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2109 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 85 (OVERLAPS) 22/2131 variables, 8/1174 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2131 variables, 4/1178 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2131 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 88 (OVERLAPS) 22/2153 variables, 8/1186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2153 variables, 4/1190 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/2153 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 91 (OVERLAPS) 22/2175 variables, 8/1198 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2175 variables, 4/1202 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/2175 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 94 (OVERLAPS) 20/2195 variables, 8/1210 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2195 variables, 4/1214 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2195 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 97 (OVERLAPS) 14/2209 variables, 6/1220 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2209 variables, 3/1223 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/2209 variables, 0/1223 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 100 (OVERLAPS) 3/2212 variables, 2/1225 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2212 variables, 1/1226 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/2212 variables, 0/1226 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 103 (OVERLAPS) 0/2212 variables, 0/1226 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2212/2212 variables, and 1226 constraints, problems are : Problem set: 0 solved, 10 unsolved in 8469 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 816/816 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 15430ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 823 ms.
Support contains 11 out of 816 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 816/816 places, 1396/1396 transitions.
Applied a total of 0 rules in 27 ms. Remains 816 /816 variables (removed 0) and now considering 1396/1396 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 816/816 places, 1396/1396 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 816/816 places, 1396/1396 transitions.
Applied a total of 0 rules in 24 ms. Remains 816 /816 variables (removed 0) and now considering 1396/1396 (removed 0) transitions.
[2024-06-01 22:01:37] [INFO ] Invariant cache hit.
[2024-06-01 22:01:37] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-06-01 22:01:37] [INFO ] Invariant cache hit.
[2024-06-01 22:01:38] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
[2024-06-01 22:01:38] [INFO ] Redundant transitions in 68 ms returned []
Running 1392 sub problems to find dead transitions.
[2024-06-01 22:01:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/815 variables, 399/399 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 815/2212 variables, and 399 constraints, problems are : Problem set: 0 solved, 1392 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 399/400 constraints, State Equation: 0/816 constraints, PredecessorRefiner: 1392/1392 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/815 variables, 399/399 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/815 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
At refinement iteration 2 (OVERLAPS) 1/816 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 816/2212 variables, and 400 constraints, problems are : Problem set: 0 solved, 1392 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 0/816 constraints, PredecessorRefiner: 0/1392 constraints, Known Traps: 0/0 constraints]
After SMT, in 60529ms problems are : Problem set: 0 solved, 1392 unsolved
Search for dead transitions found 0 dead transitions in 60543ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62029 ms. Remains : 816/816 places, 1396/1396 transitions.
FORMULA ShieldRVt-PT-100B-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1199 stabilizing places and 1199 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G((p1||X(p2)))))))'
Support contains 3 out of 3908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3902 transition count 3902
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3902 transition count 3902
Applied a total of 12 rules in 614 ms. Remains 3902 /3908 variables (removed 6) and now considering 3902/3908 (removed 6) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2024-06-01 22:02:40] [INFO ] Computed 401 invariants in 21 ms
[2024-06-01 22:02:41] [INFO ] Implicit Places using invariants in 983 ms returned []
[2024-06-01 22:02:41] [INFO ] Invariant cache hit.
[2024-06-01 22:02:46] [INFO ] Implicit Places using invariants and state equation in 4806 ms returned []
Implicit Place search using SMT with State Equation took 5790 ms to find 0 implicit places.
Running 3901 sub problems to find dead transitions.
[2024-06-01 22:02:46] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 3901/3901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 0/3901 constraints, Known Traps: 0/0 constraints]
After SMT, in 61504ms problems are : Problem set: 0 solved, 3901 unsolved
Search for dead transitions found 0 dead transitions in 61549ms
Starting structural reductions in LTL mode, iteration 1 : 3902/3908 places, 3902/3908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67963 ms. Remains : 3902/3908 places, 3902/3908 transitions.
Stuttering acceptance computed with spot in 312 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-00
Product exploration explored 100000 steps with 2 reset in 822 ms.
Product exploration explored 100000 steps with 4 reset in 983 ms.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 396 ms. (100 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
[2024-06-01 22:03:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3860/3902 variables, 399/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3902 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3902/7804 variables, 3902/4303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7804 variables, 0/4303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/7804 variables, 0/4303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7804/7804 variables, and 4303 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1901 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 3902/3902 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3860/3902 variables, 399/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 22:03:53] [INFO ] Deduced a trap composed of 26 places in 406 ms of which 8 ms to minimize.
[2024-06-01 22:03:53] [INFO ] Deduced a trap composed of 28 places in 406 ms of which 8 ms to minimize.
[2024-06-01 22:03:54] [INFO ] Deduced a trap composed of 33 places in 395 ms of which 8 ms to minimize.
[2024-06-01 22:03:54] [INFO ] Deduced a trap composed of 46 places in 394 ms of which 7 ms to minimize.
[2024-06-01 22:03:55] [INFO ] Deduced a trap composed of 28 places in 375 ms of which 7 ms to minimize.
[2024-06-01 22:03:55] [INFO ] Deduced a trap composed of 24 places in 371 ms of which 7 ms to minimize.
[2024-06-01 22:03:55] [INFO ] Deduced a trap composed of 28 places in 357 ms of which 7 ms to minimize.
[2024-06-01 22:03:56] [INFO ] Deduced a trap composed of 45 places in 363 ms of which 6 ms to minimize.
[2024-06-01 22:03:56] [INFO ] Deduced a trap composed of 36 places in 345 ms of which 6 ms to minimize.
[2024-06-01 22:03:57] [INFO ] Deduced a trap composed of 57 places in 356 ms of which 6 ms to minimize.
[2024-06-01 22:03:57] [INFO ] Deduced a trap composed of 63 places in 342 ms of which 6 ms to minimize.
SMT process timed out in 7129ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1095 transitions
Trivial Post-agglo rules discarded 1095 transitions
Performed 1095 trivial Post agglomeration. Transition count delta: 1095
Iterating post reduction 0 with 1095 rules applied. Total rules applied 1095 place count 3902 transition count 2807
Reduce places removed 1095 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2191 place count 2807 transition count 2806
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2192 place count 2806 transition count 2806
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 800 Pre rules applied. Total rules applied 2192 place count 2806 transition count 2006
Deduced a syphon composed of 800 places in 4 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 3 with 1600 rules applied. Total rules applied 3792 place count 2006 transition count 2006
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 3793 place count 2005 transition count 2005
Iterating global reduction 3 with 1 rules applied. Total rules applied 3794 place count 2005 transition count 2005
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 3794 place count 2005 transition count 2004
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3796 place count 2004 transition count 2004
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: 900
Deduced a syphon composed of 900 places in 1 ms
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 3 with 1800 rules applied. Total rules applied 5596 place count 1104 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5597 place count 1104 transition count 1103
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5599 place count 1103 transition count 1102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5801 place count 1002 transition count 1202
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 6003 place count 901 transition count 1303
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -93
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 6193 place count 806 transition count 1396
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6194 place count 806 transition count 1395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6195 place count 805 transition count 1394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6196 place count 804 transition count 1394
Applied a total of 6196 rules in 584 ms. Remains 804 /3902 variables (removed 3098) and now considering 1394/3902 (removed 2508) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 585 ms. Remains : 804/3902 places, 1394/3902 transitions.
RANDOM walk for 25167 steps (7 resets) in 398 ms. (63 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (AND p2 p1))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 3902 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 321 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
[2024-06-01 22:03:59] [INFO ] Invariant cache hit.
[2024-06-01 22:04:00] [INFO ] Implicit Places using invariants in 974 ms returned []
[2024-06-01 22:04:00] [INFO ] Invariant cache hit.
[2024-06-01 22:04:04] [INFO ] Implicit Places using invariants and state equation in 4655 ms returned []
Implicit Place search using SMT with State Equation took 5634 ms to find 0 implicit places.
Running 3901 sub problems to find dead transitions.
[2024-06-01 22:04:04] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 3901/3901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 0/3901 constraints, Known Traps: 0/0 constraints]
After SMT, in 61480ms problems are : Problem set: 0 solved, 3901 unsolved
Search for dead transitions found 0 dead transitions in 61515ms
Finished structural reductions in LTL mode , in 1 iterations and 67482 ms. Remains : 3902/3902 places, 3902/3902 transitions.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [(AND p2 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 376 ms. (106 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
[2024-06-01 22:05:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3860/3902 variables, 399/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3902 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3902/7804 variables, 3902/4303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7804 variables, 0/4303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/7804 variables, 0/4303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7804/7804 variables, and 4303 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1909 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 3902/3902 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3860/3902 variables, 399/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 22:05:09] [INFO ] Deduced a trap composed of 26 places in 395 ms of which 7 ms to minimize.
[2024-06-01 22:05:10] [INFO ] Deduced a trap composed of 28 places in 388 ms of which 7 ms to minimize.
[2024-06-01 22:05:10] [INFO ] Deduced a trap composed of 33 places in 388 ms of which 7 ms to minimize.
[2024-06-01 22:05:11] [INFO ] Deduced a trap composed of 46 places in 380 ms of which 7 ms to minimize.
[2024-06-01 22:05:11] [INFO ] Deduced a trap composed of 28 places in 360 ms of which 7 ms to minimize.
[2024-06-01 22:05:11] [INFO ] Deduced a trap composed of 24 places in 368 ms of which 6 ms to minimize.
[2024-06-01 22:05:12] [INFO ] Deduced a trap composed of 28 places in 352 ms of which 6 ms to minimize.
[2024-06-01 22:05:12] [INFO ] Deduced a trap composed of 45 places in 352 ms of which 7 ms to minimize.
[2024-06-01 22:05:13] [INFO ] Deduced a trap composed of 36 places in 334 ms of which 6 ms to minimize.
[2024-06-01 22:05:13] [INFO ] Deduced a trap composed of 57 places in 318 ms of which 6 ms to minimize.
[2024-06-01 22:05:13] [INFO ] Deduced a trap composed of 63 places in 323 ms of which 6 ms to minimize.
SMT process timed out in 6968ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1095 transitions
Trivial Post-agglo rules discarded 1095 transitions
Performed 1095 trivial Post agglomeration. Transition count delta: 1095
Iterating post reduction 0 with 1095 rules applied. Total rules applied 1095 place count 3902 transition count 2807
Reduce places removed 1095 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2191 place count 2807 transition count 2806
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2192 place count 2806 transition count 2806
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 800 Pre rules applied. Total rules applied 2192 place count 2806 transition count 2006
Deduced a syphon composed of 800 places in 5 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 3 with 1600 rules applied. Total rules applied 3792 place count 2006 transition count 2006
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 3793 place count 2005 transition count 2005
Iterating global reduction 3 with 1 rules applied. Total rules applied 3794 place count 2005 transition count 2005
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 3794 place count 2005 transition count 2004
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3796 place count 2004 transition count 2004
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: 900
Deduced a syphon composed of 900 places in 0 ms
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 3 with 1800 rules applied. Total rules applied 5596 place count 1104 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5597 place count 1104 transition count 1103
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5599 place count 1103 transition count 1102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5801 place count 1002 transition count 1202
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 6003 place count 901 transition count 1303
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -93
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 6193 place count 806 transition count 1396
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6194 place count 806 transition count 1395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6195 place count 805 transition count 1394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6196 place count 804 transition count 1394
Applied a total of 6196 rules in 513 ms. Remains 804 /3902 variables (removed 3098) and now considering 1394/3902 (removed 2508) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 513 ms. Remains : 804/3902 places, 1394/3902 transitions.
RANDOM walk for 32368 steps (16 resets) in 531 ms. (60 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p2 p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 745 ms.
Product exploration explored 100000 steps with 1 reset in 995 ms.
Support contains 2 out of 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 3901 transition count 3901
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3901 transition count 3901
Applied a total of 2 rules in 607 ms. Remains 3901 /3902 variables (removed 1) and now considering 3901/3902 (removed 1) transitions.
// Phase 1: matrix 3901 rows 3901 cols
[2024-06-01 22:05:17] [INFO ] Computed 401 invariants in 19 ms
[2024-06-01 22:05:18] [INFO ] Implicit Places using invariants in 939 ms returned []
[2024-06-01 22:05:18] [INFO ] Invariant cache hit.
[2024-06-01 22:05:22] [INFO ] Implicit Places using invariants and state equation in 3616 ms returned []
Implicit Place search using SMT with State Equation took 4556 ms to find 0 implicit places.
Running 3900 sub problems to find dead transitions.
[2024-06-01 22:05:22] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3900/7802 variables, and 0 constraints, problems are : Problem set: 0 solved, 3900 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3901 constraints, PredecessorRefiner: 3900/3900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3900/7802 variables, and 0 constraints, problems are : Problem set: 0 solved, 3900 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3901 constraints, PredecessorRefiner: 0/3900 constraints, Known Traps: 0/0 constraints]
After SMT, in 61489ms problems are : Problem set: 0 solved, 3900 unsolved
Search for dead transitions found 0 dead transitions in 61528ms
Starting structural reductions in LTL mode, iteration 1 : 3901/3902 places, 3901/3902 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66701 ms. Remains : 3901/3902 places, 3901/3902 transitions.
Treatment of property ShieldRVt-PT-100B-LTLFireability-00 finished in 224503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 3908 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1098 transitions
Trivial Post-agglo rules discarded 1098 transitions
Performed 1098 trivial Post agglomeration. Transition count delta: 1098
Iterating post reduction 0 with 1098 rules applied. Total rules applied 1098 place count 3907 transition count 2809
Reduce places removed 1098 places and 0 transitions.
Iterating post reduction 1 with 1098 rules applied. Total rules applied 2196 place count 2809 transition count 2809
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 796 Pre rules applied. Total rules applied 2196 place count 2809 transition count 2013
Deduced a syphon composed of 796 places in 5 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 3788 place count 2013 transition count 2013
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 3793 place count 2008 transition count 2008
Iterating global reduction 2 with 5 rules applied. Total rules applied 3798 place count 2008 transition count 2008
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 3798 place count 2008 transition count 2003
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 3808 place count 2003 transition count 2003
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 0 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 5606 place count 1104 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5607 place count 1104 transition count 1103
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5609 place count 1103 transition count 1102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5811 place count 1002 transition count 1202
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6013 place count 901 transition count 1303
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6207 place count 804 transition count 1399
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6209 place count 802 transition count 1397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6210 place count 801 transition count 1397
Applied a total of 6210 rules in 620 ms. Remains 801 /3908 variables (removed 3107) and now considering 1397/3908 (removed 2511) transitions.
// Phase 1: matrix 1397 rows 801 cols
[2024-06-01 22:06:24] [INFO ] Computed 400 invariants in 6 ms
[2024-06-01 22:06:25] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-06-01 22:06:25] [INFO ] Invariant cache hit.
[2024-06-01 22:06:26] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned []
Implicit Place search using SMT with State Equation took 1458 ms to find 0 implicit places.
[2024-06-01 22:06:26] [INFO ] Redundant transitions in 63 ms returned []
Running 1393 sub problems to find dead transitions.
[2024-06-01 22:06:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/801 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 801/2198 variables, and 400 constraints, problems are : Problem set: 0 solved, 1393 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 0/801 constraints, PredecessorRefiner: 1393/1393 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/801 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/801 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1393 unsolved
At refinement iteration 2 (OVERLAPS) 1396/2197 variables, 801/1201 constraints. Problems are: Problem set: 0 solved, 1393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2197 variables, 1393/2594 constraints. Problems are: Problem set: 0 solved, 1393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2197/2198 variables, and 2594 constraints, problems are : Problem set: 0 solved, 1393 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 801/801 constraints, PredecessorRefiner: 1393/1393 constraints, Known Traps: 0/0 constraints]
After SMT, in 60616ms problems are : Problem set: 0 solved, 1393 unsolved
Search for dead transitions found 0 dead transitions in 60628ms
Starting structural reductions in SI_LTL mode, iteration 1 : 801/3908 places, 1397/3908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62780 ms. Remains : 801/3908 places, 1397/3908 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-01
Stuttering criterion allowed to conclude after 46453 steps with 12 reset in 402 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-01 finished in 63277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 3908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3902 transition count 3902
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3902 transition count 3902
Applied a total of 12 rules in 619 ms. Remains 3902 /3908 variables (removed 6) and now considering 3902/3908 (removed 6) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2024-06-01 22:07:28] [INFO ] Computed 401 invariants in 18 ms
[2024-06-01 22:07:29] [INFO ] Implicit Places using invariants in 959 ms returned []
[2024-06-01 22:07:29] [INFO ] Invariant cache hit.
[2024-06-01 22:07:32] [INFO ] Implicit Places using invariants and state equation in 3710 ms returned []
Implicit Place search using SMT with State Equation took 4671 ms to find 0 implicit places.
Running 3901 sub problems to find dead transitions.
[2024-06-01 22:07:32] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 3901/3901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 0/3901 constraints, Known Traps: 0/0 constraints]
After SMT, in 61477ms problems are : Problem set: 0 solved, 3901 unsolved
Search for dead transitions found 0 dead transitions in 61531ms
Starting structural reductions in LTL mode, iteration 1 : 3902/3908 places, 3902/3908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66831 ms. Remains : 3902/3908 places, 3902/3908 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-03
Product exploration explored 100000 steps with 3 reset in 820 ms.
Stack based approach found an accepted trace after 2008 steps with 0 reset with depth 2009 and stack size 2009 in 21 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-03 finished in 67801 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X((p1 U G(p2)))))'
Support contains 3 out of 3908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3902 transition count 3902
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3902 transition count 3902
Applied a total of 12 rules in 608 ms. Remains 3902 /3908 variables (removed 6) and now considering 3902/3908 (removed 6) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2024-06-01 22:08:35] [INFO ] Computed 401 invariants in 13 ms
[2024-06-01 22:08:36] [INFO ] Implicit Places using invariants in 952 ms returned []
[2024-06-01 22:08:36] [INFO ] Invariant cache hit.
[2024-06-01 22:08:41] [INFO ] Implicit Places using invariants and state equation in 4565 ms returned []
Implicit Place search using SMT with State Equation took 5517 ms to find 0 implicit places.
Running 3901 sub problems to find dead transitions.
[2024-06-01 22:08:41] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 3901/3901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3901 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 0/3901 constraints, Known Traps: 0/0 constraints]
After SMT, in 61460ms problems are : Problem set: 0 solved, 3901 unsolved
Search for dead transitions found 0 dead transitions in 61491ms
Starting structural reductions in LTL mode, iteration 1 : 3902/3908 places, 3902/3908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67626 ms. Remains : 3902/3908 places, 3902/3908 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-05
Product exploration explored 100000 steps with 53 reset in 609 ms.
Product exploration explored 100000 steps with 53 reset in 757 ms.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Detected a total of 1198/3902 stabilizing places and 1198/3902 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 182 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (8 resets) in 532 ms. (75 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
[2024-06-01 22:09:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 148/151 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3751/3902 variables, 396/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 22:09:46] [INFO ] Deduced a trap composed of 23 places in 357 ms of which 7 ms to minimize.
[2024-06-01 22:09:46] [INFO ] Deduced a trap composed of 34 places in 352 ms of which 6 ms to minimize.
[2024-06-01 22:09:47] [INFO ] Deduced a trap composed of 36 places in 338 ms of which 6 ms to minimize.
[2024-06-01 22:09:47] [INFO ] Deduced a trap composed of 57 places in 326 ms of which 6 ms to minimize.
[2024-06-01 22:09:48] [INFO ] Deduced a trap composed of 63 places in 300 ms of which 6 ms to minimize.
[2024-06-01 22:09:48] [INFO ] Deduced a trap composed of 42 places in 318 ms of which 6 ms to minimize.
[2024-06-01 22:09:48] [INFO ] Deduced a trap composed of 28 places in 302 ms of which 6 ms to minimize.
[2024-06-01 22:09:49] [INFO ] Deduced a trap composed of 58 places in 300 ms of which 6 ms to minimize.
[2024-06-01 22:09:49] [INFO ] Deduced a trap composed of 48 places in 291 ms of which 6 ms to minimize.
[2024-06-01 22:09:49] [INFO ] Deduced a trap composed of 58 places in 285 ms of which 6 ms to minimize.
[2024-06-01 22:09:50] [INFO ] Deduced a trap composed of 57 places in 286 ms of which 6 ms to minimize.
[2024-06-01 22:09:50] [INFO ] Deduced a trap composed of 58 places in 288 ms of which 6 ms to minimize.
SMT process timed out in 5209ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1098 transitions
Trivial Post-agglo rules discarded 1098 transitions
Performed 1098 trivial Post agglomeration. Transition count delta: 1098
Iterating post reduction 0 with 1098 rules applied. Total rules applied 1098 place count 3902 transition count 2804
Reduce places removed 1098 places and 0 transitions.
Iterating post reduction 1 with 1098 rules applied. Total rules applied 2196 place count 2804 transition count 2804
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2196 place count 2804 transition count 2005
Deduced a syphon composed of 799 places in 5 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3794 place count 2005 transition count 2005
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 0 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 5592 place count 1106 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5593 place count 1106 transition count 1105
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5595 place count 1105 transition count 1104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5797 place count 1004 transition count 1204
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5999 place count 903 transition count 1305
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6193 place count 806 transition count 1402
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6194 place count 806 transition count 1401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6195 place count 805 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6196 place count 804 transition count 1400
Applied a total of 6196 rules in 542 ms. Remains 804 /3902 variables (removed 3098) and now considering 1400/3902 (removed 2502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 543 ms. Remains : 804/3902 places, 1400/3902 transitions.
RANDOM walk for 40000 steps (14 resets) in 1130 ms. (35 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (9 resets) in 327 ms. (121 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 341 ms. (116 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 343 ms. (116 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 130505 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 5
Probabilistic random walk after 130505 steps, saw 80739 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
// Phase 1: matrix 1400 rows 804 cols
[2024-06-01 22:09:54] [INFO ] Computed 400 invariants in 7 ms
[2024-06-01 22:09:54] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 38/54 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 97/151 variables, 30/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 131/282 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 23/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/282 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 132/414 variables, 48/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/414 variables, 24/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/414 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 129/543 variables, 48/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/543 variables, 24/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/543 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 116/659 variables, 44/334 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/659 variables, 22/356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/659 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 110/769 variables, 40/396 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/769 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/769 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 85/854 variables, 34/450 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/854 variables, 17/467 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/854 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 69/923 variables, 26/493 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/923 variables, 13/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/923 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 66/989 variables, 24/530 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/989 variables, 12/542 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/989 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 66/1055 variables, 24/566 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1055 variables, 12/578 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1055 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 66/1121 variables, 24/602 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1121 variables, 12/614 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1121 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (OVERLAPS) 66/1187 variables, 24/638 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1187 variables, 12/650 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1187 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (OVERLAPS) 66/1253 variables, 24/674 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1253 variables, 12/686 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1253 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (OVERLAPS) 66/1319 variables, 24/710 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1319 variables, 12/722 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1319 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (OVERLAPS) 66/1385 variables, 24/746 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1385 variables, 12/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1385 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (OVERLAPS) 66/1451 variables, 24/782 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1451 variables, 12/794 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1451 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (OVERLAPS) 66/1517 variables, 24/818 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1517 variables, 12/830 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1517 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 60 (OVERLAPS) 66/1583 variables, 24/854 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1583 variables, 12/866 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1583 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 63 (OVERLAPS) 66/1649 variables, 24/890 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1649 variables, 12/902 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1649 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 66 (OVERLAPS) 66/1715 variables, 24/926 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1715 variables, 12/938 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1715 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 69 (OVERLAPS) 66/1781 variables, 24/962 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1781 variables, 12/974 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1781 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 72 (OVERLAPS) 66/1847 variables, 24/998 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1847 variables, 12/1010 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1847 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 75 (OVERLAPS) 66/1913 variables, 24/1034 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1913 variables, 12/1046 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1913 variables, 0/1046 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 78 (OVERLAPS) 66/1979 variables, 24/1070 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1979 variables, 12/1082 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1979 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 81 (OVERLAPS) 66/2045 variables, 24/1106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/2045 variables, 12/1118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2045 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 84 (OVERLAPS) 53/2098 variables, 22/1140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/2098 variables, 11/1151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2098 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 87 (OVERLAPS) 25/2123 variables, 10/1161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/2123 variables, 5/1166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2123 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 90 (OVERLAPS) 22/2145 variables, 8/1174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/2145 variables, 4/1178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2145 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 93 (OVERLAPS) 22/2167 variables, 8/1186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/2167 variables, 4/1190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2167 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 96 (OVERLAPS) 20/2187 variables, 8/1198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/2187 variables, 4/1202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2187 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 99 (OVERLAPS) 14/2201 variables, 6/1208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/2201 variables, 3/1211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2201 variables, 0/1211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 102 (OVERLAPS) 3/2204 variables, 2/1213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/2204 variables, 1/1214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2204 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 105 (OVERLAPS) 0/2204 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2204/2204 variables, and 1214 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3161 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 804/804 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 38/54 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 97/151 variables, 30/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/151 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 131/282 variables, 46/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/282 variables, 23/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/282 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 132/414 variables, 48/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/414 variables, 24/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/414 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 129/543 variables, 48/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/543 variables, 24/295 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/543 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 116/659 variables, 44/339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/659 variables, 22/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/659 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 110/769 variables, 40/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/769 variables, 20/421 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/769 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 85/854 variables, 34/455 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/854 variables, 17/472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/854 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 69/923 variables, 26/498 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/923 variables, 13/511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/923 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (OVERLAPS) 66/989 variables, 24/535 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/989 variables, 12/547 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/989 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (OVERLAPS) 66/1055 variables, 24/571 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1055 variables, 12/583 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1055 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (OVERLAPS) 66/1121 variables, 24/607 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1121 variables, 12/619 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1121 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (OVERLAPS) 66/1187 variables, 24/643 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1187 variables, 12/655 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1187 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (OVERLAPS) 66/1253 variables, 24/679 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1253 variables, 12/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1253 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (OVERLAPS) 66/1319 variables, 24/715 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1319 variables, 12/727 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1319 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (OVERLAPS) 66/1385 variables, 24/751 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1385 variables, 12/763 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1385 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (OVERLAPS) 66/1451 variables, 24/787 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1451 variables, 12/799 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1451 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 58 (OVERLAPS) 66/1517 variables, 24/823 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1517 variables, 12/835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1517 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 61 (OVERLAPS) 66/1583 variables, 24/859 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1583 variables, 12/871 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1583 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 64 (OVERLAPS) 66/1649 variables, 24/895 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1649 variables, 12/907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1649 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 67 (OVERLAPS) 66/1715 variables, 24/931 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1715 variables, 12/943 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1715 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 70 (OVERLAPS) 66/1781 variables, 24/967 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1781 variables, 12/979 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1781 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 73 (OVERLAPS) 66/1847 variables, 24/1003 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1847 variables, 12/1015 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1847 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 76 (OVERLAPS) 66/1913 variables, 24/1039 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1913 variables, 12/1051 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1913 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 79 (OVERLAPS) 66/1979 variables, 24/1075 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1979 variables, 12/1087 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1979 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 82 (OVERLAPS) 66/2045 variables, 24/1111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2045 variables, 12/1123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2045 variables, 0/1123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 85 (OVERLAPS) 53/2098 variables, 22/1145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2098 variables, 11/1156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2098 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 88 (OVERLAPS) 25/2123 variables, 10/1166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2123 variables, 5/1171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/2123 variables, 0/1171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 91 (OVERLAPS) 22/2145 variables, 8/1179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2145 variables, 4/1183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/2145 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 94 (OVERLAPS) 22/2167 variables, 8/1191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2167 variables, 4/1195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2167 variables, 0/1195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 97 (OVERLAPS) 20/2187 variables, 8/1203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2187 variables, 4/1207 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/2187 variables, 0/1207 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 100 (OVERLAPS) 14/2201 variables, 6/1213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2201 variables, 3/1216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/2201 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 103 (OVERLAPS) 3/2204 variables, 2/1218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2204 variables, 1/1219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/2204 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 106 (OVERLAPS) 0/2204 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2204/2204 variables, and 1219 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3769 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 804/804 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 6948ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1879 ms.
Support contains 3 out of 804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1400/1400 transitions.
Applied a total of 0 rules in 22 ms. Remains 804 /804 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 804/804 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1400/1400 transitions.
Applied a total of 0 rules in 22 ms. Remains 804 /804 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2024-06-01 22:10:03] [INFO ] Invariant cache hit.
[2024-06-01 22:10:04] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-06-01 22:10:04] [INFO ] Invariant cache hit.
[2024-06-01 22:10:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 22:10:05] [INFO ] Implicit Places using invariants and state equation in 1074 ms returned []
Implicit Place search using SMT with State Equation took 1493 ms to find 0 implicit places.
[2024-06-01 22:10:05] [INFO ] Redundant transitions in 28 ms returned []
Running 1396 sub problems to find dead transitions.
[2024-06-01 22:10:05] [INFO ] Invariant cache hit.
[2024-06-01 22:10:05] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/803 variables, 396/396 constraints. Problems are: Problem set: 0 solved, 1396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 803/2204 variables, and 396 constraints, problems are : Problem set: 0 solved, 1396 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 396/400 constraints, State Equation: 0/804 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 1396/1396 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/803 variables, 396/396 constraints. Problems are: Problem set: 0 solved, 1396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/803 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1396 unsolved
At refinement iteration 2 (OVERLAPS) 1/804 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 1396 unsolved
[2024-06-01 22:10:57] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 804/2204 variables, and 401 constraints, problems are : Problem set: 0 solved, 1396 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 0/804 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 0/1396 constraints, Known Traps: 1/1 constraints]
After SMT, in 60516ms problems are : Problem set: 0 solved, 1396 unsolved
Search for dead transitions found 0 dead transitions in 60528ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62077 ms. Remains : 804/804 places, 1400/1400 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 399 edges and 804 vertex of which 4 / 804 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2787 edges and 802 vertex of which 800 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 396 edges and 798 vertex of which 4 / 798 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 796 transition count 1391
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 395 edges and 794 vertex of which 6 / 794 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 791 transition count 1382
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 393 edges and 788 vertex of which 8 / 788 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 784 transition count 1371
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 389 edges and 780 vertex of which 8 / 780 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 776 transition count 1357
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 385 edges and 772 vertex of which 8 / 772 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 768 transition count 1343
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 381 edges and 764 vertex of which 8 / 764 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 760 transition count 1329
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 377 edges and 756 vertex of which 8 / 756 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 752 transition count 1315
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 373 edges and 748 vertex of which 8 / 748 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 744 transition count 1301
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 369 edges and 740 vertex of which 8 / 740 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 736 transition count 1287
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 365 edges and 732 vertex of which 8 / 732 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 728 transition count 1273
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 361 edges and 724 vertex of which 8 / 724 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 720 transition count 1259
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 357 edges and 716 vertex of which 8 / 716 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 712 transition count 1245
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 353 edges and 708 vertex of which 8 / 708 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 704 transition count 1231
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 349 edges and 700 vertex of which 8 / 700 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 696 transition count 1217
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 345 edges and 692 vertex of which 8 / 692 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 688 transition count 1203
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 341 edges and 684 vertex of which 8 / 684 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 680 transition count 1189
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 337 edges and 676 vertex of which 8 / 676 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 672 transition count 1175
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 333 edges and 668 vertex of which 8 / 668 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 664 transition count 1161
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 329 edges and 660 vertex of which 8 / 660 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 656 transition count 1147
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 325 edges and 652 vertex of which 8 / 652 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 648 transition count 1133
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 321 edges and 644 vertex of which 8 / 644 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 640 transition count 1119
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 317 edges and 636 vertex of which 8 / 636 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 632 transition count 1105
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 313 edges and 628 vertex of which 8 / 628 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 624 transition count 1091
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 309 edges and 620 vertex of which 8 / 620 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 616 transition count 1077
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 305 edges and 612 vertex of which 8 / 612 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 608 transition count 1063
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 301 edges and 604 vertex of which 8 / 604 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 600 transition count 1049
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 297 edges and 596 vertex of which 8 / 596 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 592 transition count 1035
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 293 edges and 588 vertex of which 8 / 588 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 584 transition count 1021
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 289 edges and 580 vertex of which 8 / 580 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 576 transition count 1007
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 285 edges and 572 vertex of which 6 / 572 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 569 transition count 993
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 282 edges and 566 vertex of which 6 / 566 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 30 with 14 rules applied. Total rules applied 562 place count 563 transition count 983
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 279 edges and 560 vertex of which 6 / 560 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 31 with 16 rules applied. Total rules applied 578 place count 557 transition count 971
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 277 edges and 554 vertex of which 8 / 554 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 15 rules applied. Total rules applied 593 place count 550 transition count 960
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 274 edges and 546 vertex of which 10 / 546 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 33 with 20 rules applied. Total rules applied 613 place count 541 transition count 945
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 268 edges and 536 vertex of which 8 / 536 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 34 with 25 rules applied. Total rules applied 638 place count 532 transition count 926
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 263 edges and 527 vertex of which 8 / 527 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 21 rules applied. Total rules applied 659 place count 523 transition count 911
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 259 edges and 519 vertex of which 8 / 519 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 678 place count 515 transition count 897
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 255 edges and 511 vertex of which 8 / 511 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 697 place count 507 transition count 883
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 251 edges and 503 vertex of which 8 / 503 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 716 place count 499 transition count 869
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 247 edges and 495 vertex of which 8 / 495 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 735 place count 491 transition count 855
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 243 edges and 487 vertex of which 8 / 487 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 754 place count 483 transition count 841
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 239 edges and 479 vertex of which 8 / 479 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 773 place count 475 transition count 827
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 235 edges and 471 vertex of which 8 / 471 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 19 rules applied. Total rules applied 792 place count 467 transition count 813
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 231 edges and 463 vertex of which 8 / 463 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 19 rules applied. Total rules applied 811 place count 459 transition count 799
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 227 edges and 455 vertex of which 8 / 455 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 44 with 19 rules applied. Total rules applied 830 place count 451 transition count 785
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 223 edges and 447 vertex of which 8 / 447 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 45 with 19 rules applied. Total rules applied 849 place count 443 transition count 771
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 219 edges and 439 vertex of which 8 / 439 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 46 with 19 rules applied. Total rules applied 868 place count 435 transition count 757
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 215 edges and 431 vertex of which 8 / 431 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 47 with 19 rules applied. Total rules applied 887 place count 427 transition count 743
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 211 edges and 423 vertex of which 8 / 423 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 48 with 19 rules applied. Total rules applied 906 place count 419 transition count 729
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 207 edges and 415 vertex of which 8 / 415 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 49 with 19 rules applied. Total rules applied 925 place count 411 transition count 715
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 203 edges and 407 vertex of which 8 / 407 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 50 with 19 rules applied. Total rules applied 944 place count 403 transition count 701
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 199 edges and 399 vertex of which 8 / 399 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 51 with 19 rules applied. Total rules applied 963 place count 395 transition count 687
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 195 edges and 391 vertex of which 8 / 391 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 52 with 19 rules applied. Total rules applied 982 place count 387 transition count 673
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 191 edges and 383 vertex of which 8 / 383 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 53 with 19 rules applied. Total rules applied 1001 place count 379 transition count 659
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 187 edges and 375 vertex of which 8 / 375 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 54 with 19 rules applied. Total rules applied 1020 place count 371 transition count 645
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 183 edges and 367 vertex of which 8 / 367 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 55 with 19 rules applied. Total rules applied 1039 place count 363 transition count 631
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 179 edges and 359 vertex of which 8 / 359 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 56 with 19 rules applied. Total rules applied 1058 place count 355 transition count 617
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 175 edges and 351 vertex of which 8 / 351 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 57 with 19 rules applied. Total rules applied 1077 place count 347 transition count 603
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 171 edges and 343 vertex of which 8 / 343 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 58 with 19 rules applied. Total rules applied 1096 place count 339 transition count 589
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 335 vertex of which 8 / 335 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 59 with 19 rules applied. Total rules applied 1115 place count 331 transition count 575
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 327 vertex of which 8 / 327 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 60 with 19 rules applied. Total rules applied 1134 place count 323 transition count 561
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 319 vertex of which 8 / 319 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 61 with 19 rules applied. Total rules applied 1153 place count 315 transition count 547
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 311 vertex of which 8 / 311 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 62 with 19 rules applied. Total rules applied 1172 place count 307 transition count 533
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 303 vertex of which 8 / 303 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 63 with 19 rules applied. Total rules applied 1191 place count 299 transition count 519
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 147 edges and 295 vertex of which 8 / 295 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 64 with 19 rules applied. Total rules applied 1210 place count 291 transition count 505
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 143 edges and 287 vertex of which 8 / 287 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 65 with 19 rules applied. Total rules applied 1229 place count 283 transition count 491
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 139 edges and 279 vertex of which 8 / 279 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 66 with 19 rules applied. Total rules applied 1248 place count 275 transition count 477
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 135 edges and 271 vertex of which 8 / 271 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 67 with 19 rules applied. Total rules applied 1267 place count 267 transition count 463
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 131 edges and 263 vertex of which 8 / 263 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 68 with 19 rules applied. Total rules applied 1286 place count 259 transition count 449
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 127 edges and 255 vertex of which 8 / 255 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 69 with 19 rules applied. Total rules applied 1305 place count 251 transition count 435
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 123 edges and 247 vertex of which 8 / 247 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 70 with 19 rules applied. Total rules applied 1324 place count 243 transition count 421
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 119 edges and 239 vertex of which 8 / 239 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 71 with 19 rules applied. Total rules applied 1343 place count 235 transition count 407
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 115 edges and 231 vertex of which 8 / 231 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 72 with 19 rules applied. Total rules applied 1362 place count 227 transition count 393
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 111 edges and 223 vertex of which 8 / 223 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 73 with 19 rules applied. Total rules applied 1381 place count 219 transition count 379
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 107 edges and 215 vertex of which 8 / 215 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 74 with 19 rules applied. Total rules applied 1400 place count 211 transition count 365
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 103 edges and 207 vertex of which 8 / 207 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 75 with 19 rules applied. Total rules applied 1419 place count 203 transition count 351
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 99 edges and 199 vertex of which 8 / 199 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 76 with 19 rules applied. Total rules applied 1438 place count 195 transition count 337
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 95 edges and 191 vertex of which 8 / 191 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 77 with 19 rules applied. Total rules applied 1457 place count 187 transition count 323
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 91 edges and 183 vertex of which 8 / 183 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 78 with 19 rules applied. Total rules applied 1476 place count 179 transition count 309
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 87 edges and 175 vertex of which 8 / 175 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 79 with 19 rules applied. Total rules applied 1495 place count 171 transition count 295
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 83 edges and 167 vertex of which 6 / 167 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 80 with 19 rules applied. Total rules applied 1514 place count 164 transition count 281
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 79 edges and 161 vertex of which 4 / 161 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 81 with 14 rules applied. Total rules applied 1528 place count 159 transition count 271
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 76 edges and 157 vertex of which 2 / 157 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 82 with 9 rules applied. Total rules applied 1537 place count 156 transition count 265
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 83 with 5 rules applied. Total rules applied 1542 place count 155 transition count 261
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 84 with 2 Pre rules applied. Total rules applied 1542 place count 155 transition count 259
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 84 with 5 rules applied. Total rules applied 1547 place count 152 transition count 259
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 84 with 3 rules applied. Total rules applied 1550 place count 150 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 84 with 4 rules applied. Total rules applied 1554 place count 150 transition count 254
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 85 with 1 rules applied. Total rules applied 1555 place count 150 transition count 254
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 85 with 1 rules applied. Total rules applied 1556 place count 150 transition count 253
Applied a total of 1556 rules in 192 ms. Remains 150 /804 variables (removed 654) and now considering 253/1400 (removed 1147) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 253 rows 150 cols
[2024-06-01 22:11:05] [INFO ] Computed 74 invariants in 0 ms
[2024-06-01 22:11:05] [INFO ] [Real]Absence check using 74 positive place invariants in 8 ms returned sat
[2024-06-01 22:11:06] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-01 22:11:06] [INFO ] [Nat]Absence check using 74 positive place invariants in 7 ms returned sat
[2024-06-01 22:11:06] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-06-01 22:11:06] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-06-01 22:11:06] [INFO ] After 252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 576 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p0)]
Knowledge based reduction with 14 factoid took 226 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
// Phase 1: matrix 3902 rows 3902 cols
[2024-06-01 22:11:06] [INFO ] Computed 401 invariants in 17 ms
[2024-06-01 22:11:09] [INFO ] [Real]Absence check using 401 positive place invariants in 748 ms returned sat
[2024-06-01 22:11:21] [INFO ] [Real]Absence check using state equation in 12719 ms returned unknown
Could not prove EG (NOT p2)
Support contains 3 out of 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 305 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
[2024-06-01 22:11:22] [INFO ] Invariant cache hit.
[2024-06-01 22:11:23] [INFO ] Implicit Places using invariants in 979 ms returned []
[2024-06-01 22:11:23] [INFO ] Invariant cache hit.
[2024-06-01 22:11:27] [INFO ] Implicit Places using invariants and state equation in 4616 ms returned []
Implicit Place search using SMT with State Equation took 5605 ms to find 0 implicit places.
Running 3901 sub problems to find dead transitions.
[2024-06-01 22:11:27] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 3901/3901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3901 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 1)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 1)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 1)
(s1446 1)
(s1447 1)
(s1448 1)
(s1449 1)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 1)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 1)
(s1478 1)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 1)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 1)
(s1489 1)
(s1490 1)
(s1491 1)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 1)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1510 1)
(s1511 1)
(s1512 1)
(s1513 1)
(s1514 1)
(s1515 1)
(s1516 1)
(s1517 1)
(s1518 1)
(s1519 1)
(s1520 1)
(s1521 1)
(s1522 1)
(s1523 1)
(s1524 1)
(s1525 1)
(s1526 1)
(s1527 1)
(s1528 1)
(s1529 1)
(s1530 1)
(s1531 1)
(s1532 1)
(s1533 1)
(s1534 1)
(s1535 1)
(s1536 1)
(s1537 1)
(s1538 1)
(s1539 1)
(s1540 1)
(s1541 1)
(s1542 1)
(s1543 1)
(s1544 1)
(s1545 1)
(s1546 1)
(s1547 1)
(s1548 1)
(s1549 1)
(s1550 1)
(s1551 1)
(s1552 1)
(s1553 1)
(s1554 1)
(s1555 1)
(s1556 1)
(s1557 1)
(s1558 1)
(s1559 1)
(s1560 1)
(s1561 1)
(s1562 1)
(s1563 1)
(s1564 1)
(s1565 1)
(s1566 1)
(s1567 1)
(s1568 1)
(s1569 1)
(s1570 1)
(s1571 1)
(s1572 1)
(s1573 1)
(s1574 1)
(s1575 1)
(s1576 1)
(s1577 1)
(s1578 1)
(s1579 1)
(s1580 1)
(s1581 1)
(s1582 1)
(s1583 1)
(s1584 1)
(s1585 1)
(s1586 1)
(s1587 1)
(s1588 1)
(s1589 1)
(s1590 1)
(s1591 1)
(s1592 1)
(s1593 1)
(s1594 1)
(s1595 1)
(s1596 1)
(s1597 1)
(s1598 1)
(s1599 1)
(s1600 1)
(s1601 1)
(s1602 1)
(s1603 1)
(s1604 1)
(s1605 1)
(s1606 1)
(s1607 1)
(s1608 1)
(s1609 1)
(s1610 1)
(s1611 1)
(s1612 1)
(s1613 1)
(s1614 1)
(s1615 1)
(s1616 1)
(s1617 1)
(s1618 1)
(s1619 1)
(s1620 1)
(s1621 1)
(s1622 1)
(s1623 1)
(s1624 1)
(s1625 1)
(s1626 1)
(s1627 1)
(s1628 1)
(s1629 1)
(s1630 1)
(s1631 1)
(s1632 1)
(s1633 1)
(s1634 1)
(s1635 1)
(s1636 1)
(s1637 1)
(s1638 1)
(s1639 1)
(s1640 1)
(s1641 1)
(s1642 1)
(s1643 1)
(s1644 1)
(s1645 1)
(s1646 1)
(s1647 1)
(s1648 1)
(s1649 1)
(s1650 1)
(s1651 1)
(s1652 1)
(s1653 1)
(s1654 1)
(s1655 1)
(s1656 1)
(s1657 1)
(s1658 1)
(s1659 1)
(s1660 1)
(s1661 1)
(s1662 1)
(s1663 1)
(s1664 1)
(s1665 1)
(s1666 1)
(s1667 1)
(s1668 1)
(s1669 1)
(s1670 1)
(s1671 1)
(s1672 1)
(s1673 1)
(s1674 1)
(s1675 1)
(s1676 1)
(s1677 1)
(s1678 1)
(s1679 1)
(s1680 1)
(s1681 1)
(s1682 1)
(s1683 1)
(s1684 1)
(s1685 1)
(s1686 1)
(s1687 1)
(s1688 1)
(s1689 1)
(s1690 1)
(s1691 1)
(s1692 1)
(s1693 1)
(s1694 1)
(s1695 1)
(s1696 1)
(s1697 1)
(s1698 1)
(s1699 1)
(s1700 1)
(s1701 1)
(s1702 1)
(s1703 1)
(s1704 1)
(s1705 1)
(s1706 1)
(s1707 1)
(s1708 1)
(s1709 1)
(s1710 1)
(s1711 1)
(s1712 1)
(s1713 1)
(s1714 1)
(s1715 1)
(s1716 1)
(s1717 1)
(s1718 1)
(s1719 1)
(s1720 1)
(s1721 1)
(s1722 1)
(s1723 1)
(s1724 1)
(s1725 1)
(s1726 1)
(s1727 1)
(s1728 1)
(s1729 1)
(s1730 1)
(s1731 1)
(s1732 1)
(s1733 1)
(s1734 1)
(s1735 1)
(s1736 1)
(s1737 1)
(s1738 1)
(s1739 1)
(s1740 1)
(s1741 1)
(s1742 1)
(s1743 1)
(s1744 1)
(s1745 1)
(s1746 1)
(s1747 1)
(s1748 1)
(s1749 1)
(s1750 1)
(s1751 1)
(s1752 1)
(s1753 1)
(s1754 1)
(s1755 1)
(s1756 1)
(s1757 1)
(s1758 1)
(s1759 1)
(s1760 1)
(s1761 1)
(s1762 1)
(s1763 1)
(s1764 1)
(s1765 1)
(s1766 1)
(s1767 1)
(s1768 1)
(s1769 1)
(s1770 1)
(s1771 1)
(s1772 1)
(s1773 1)
(s1774 1)
(s1775 1)
(s1776 1)
(s1777 1)
(s1778 1)
(s1779 1)
(s1780 1)
(s1781 1)
(s1782 1)
(s1783 1)
(s1784 1)
(s1785 1)
(s1786 1)
(s1787 1)
(s1788 1)
(s1789 1)
(s1790 1)
(s1791 1)
(s1792 1)
(s1793 1)
(s1794 1)
(s1795 1)
(s1796 1)
(s1797 1)
(s1798 1)
(s1799 1)
(s1800 1)
(s1801 1)
(s1802 1)
(s1803 1)
(s1804 1)
(s1805 1)
(s1806 1)
(s1807 1)
(s1808 1)
(s1809 1)
(s1810 1)
(s1811 1)
(s1812 1)
(s1813 1)
(s1814 1)
(s1815 1)
(s1816 1)
(s1817 1)
(s1818 1)
(s1819 1)
(s1820 1)
(s1821 1)
(s1822 1)
(s1823 1)
(s1824 1)
(s1825 1)
(s1826 1)
(s1827 1)
(s1828 1)
(s1829 1)
(s1830 1)
(s1831 1)
(s1832 1)
(s1833 1)
(s1834 1)
(s1835 1)
(s1836 1)
(s1837 1)
(s1838 1)
(s1839 1)
(s1840 1)
(s1841 1)
(s1842 1)
(s1843 1)
(s1844 1)
(s1845 1)
(s1846 1)
(s1847 1)
(s1848 1)
(s1849 1)
(s1850 1)
(s1851 1)
(s1852 1)
(s1853 1)
(s1854 1)
(s1855 1)
(s1856 1)
(s1857 1)
(s1858 1)
(s1859 1)
(s1860 1)
(s1861 1)
(s1862 1)
(s1863 1)
(s1864 1)
(s1865 1)
(s1866 1)
(s1867 1)
(s1868 1)
(s1869 1)
(s1870 1)
(s1871 1)
(s1872 1)
(s1873 1)
(s1874 1)
(s1875 1)
(s1876 1)
(s1877 1)
(s1878 1)
(s1879 1)
(s1880 1)
(s1881 1)
(s1882 1)
(s1883 1)
(s1884 1)
(s1885 1)
(s1886 1)
(s1887 1)
(s1888 1)
(s1889 1)
(s1890 1)
(s1891 1)
(s1892 1)
(s1893 1)
(s1894 1)
(s1895 1)
(s1896 1)
(s1897 1)
(s1898 1)
(s1899 1)
(s1900 1)
(s1901 1)
(s1902 1)
(s1903 1)
(s1904 1)
(s1905 1)
(s1906 1)
(s1907 1)
(s1908 1)
(s1909 1)
(s1910 1)
(s1911 1)
(s1912 1)
(s1913 1)
(s1914 1)
(s1915 1)
(s1916 1)
(s1917 1)
(s1918 1)
(s1919 1)
(s1920 1)
(s1921 1)
(s1922 1)
(s1923 1)
(s1924 1)
(s1925 1)
(s1926 1)
(s1927 1)
(s1928 1)
(s1929 1)
(s1930 1)
(s1931 1)
(s1932 1)
(s1933 1)
(s1934 1)
(s1935 1)
(s1936 1)
(s1937 1)
(s1938 1)
(s1939 1)
(s1940 1)
(s1941 1)
(s1942 1)
(s1943 1)
(s1944 1)
(s1945 1)
(s1946 1)
(s1947 1)
(s1948 1)
(s1949 1)
(s1950 1)
(s1951 1)
(s1952 1)
(s1953 1)
(s1954 1)
(s1955 1)
(s1956 1)
(s1957 1)
(s1958 1)
(s1959 1)
(s1960 1)
(s1961 1)
(s1962 1)
(s1963 1)
(s1964 1)
(s1965 1)
(s1966 1)
(s1967 1)
(s1968 1)
(s1969 1)
(s1970 1)
(s1971 1)
(s1972 1)
(s1973 1)
(s1974 1)
(s1975 1)
(s1976 1)
(s1977 1)
(s1978 1)
(s1979 1)
(s1980 1)
(s1981 1)
(s1982 1)
(s1983 1)
(s1984 1)
(s1985 1)
(s1986 1)
(s1987 1)
(s1988 1)
(s1989 1)
(s1990 1)
(s1991 1)
(s1992 1)
(s1993 1)
(s1994 1)
(s1995 1)
(s1996 1)
(s1997 1)
(s1998 1)
(s1999 1)
(s2000 1)
(s2001 1)
(s2002 1)
(s2003 1)
(s2004 1)
(s2005 1)
(s2006 1)
(s2007 1)
(s2008 1)
(s2009 1)
(s2010 1)
(s2011 1)
(s2012 1)
(s2013 1)
(s2014 1)
(s2015 1)
(s2016 1)
(s2017 1)
(s2018 1)
(s2019 1)
(s2020 1)
(s2021 1)
(s2022 1)
(s2023 1)
(s2024 1)
(s2025 1)
(s2026 1)
(s2027 1)
(s2028 1)
(s2029 1)
(s2030 1)
(s2031 1)
(s2032 1)
(s2033 1)
(s2034 1)
(s2035 1)
(s2036 1)
(s2037 1)
(s2038 1)
(s2039 1)
(s2040 1)
(s2041 1)
(s2042 1)
(s2043 1)
(s2044 1)
(s2045 1)
(s2046 1)
(s2047 1)
(s2048 1)
(s2049 1)
(s2050 1)
(s2051 1)
(s2052 1)
(s2053 1)
(s2054 1)
(s2055 1)
(s2056 1)
(s2057 1)
(s2058 1)
(s2059 1)
(s2060 1)
(s2061 1)
(s2062 1)
(s2063 1)
(s2064 1)
(s2065 1)
(s2066 1)
(s2067 1)
(s2068 1)
(s2069 1)
(s2070 1)
(s2071 1)
(s2072 1)
(s2073 1)
(s2074 1)
(s2075 1)
(s2076 1)
(s2077 1)
(s2078 1)
(s2079 1)
(s2080 1)
(s2081 1)
(s2082 1)
(s2083 1)
(s2084 1)
(s2085 1)
(s2086 1)
(s2087 1)
(s2088 1)
(s2089 1)
(s2090 1)
(s2091 1)
(s2092 1)
(s2093 1)
(s2094 1)
(s2095 1)
(s2096 1)
(s2097 1)
(s2098 1)
(s2099 1)
(s2100 1)
(s2101 1)
(s2102 1)
(s2103 1)
(s2104 1)
(s2105 1)
(s2106 1)
(s2107 1)
(s2108 1)
(s2109 1)
(s2110 1)
(s2111 1)
(s2112 1)
(s2113 1)
(s2114 1)
(s2115 1)
(s2116 1)
(s2117 1)
(s2118 1)
(s2119 1)
(s2120 1)
(s2121 1)
(s2122 1)
(s2123 1)
(s2124 1)
(s2125 1)
(s2126 1)
(s2127 1)
(s2128 1)
(s2129 1)
(s2130 1)
(s2131 1)
(s2132 1)
(s2133 1)
(s2134 1)
(s2135 1)
(s2136 1)
(s2137 1)
(s2138 1)
(s2139 1)
(s2140 1)
(s2141 1)
(s2142 1)
(s2143 1)
(s2144 1)
(s2145 1)
(s2146 1)
(s2147 1)
(s2148 1)
(s2149 1)
(s2150 1)
(s2151 1)
(s2152 1)
(s2153 1)
(s2154 1)
(s2155 1)
(s2156 1)
(s2157 1)
(s2158 1)
(s2159 1)
(s2160 1)
(s2161 1)
(s2162 1)
(s2163 1)
(s2164 1)
(s2165 1)
(s2166 1)
(s2167 1)
(s2168 1)
(s2169 1)
(s2170 1)
(s2171 1)
(s2172 1)
(s2173 1)
(s2174 1)
(s2175 1)
(s2176 1)
(s2177 1)
(s2178 1)
(s2179 1)
(s2180 1)
(s2181 1)
(s2182 1)
(s2183 1)
(s2184 1)
(s2185 1)
(s2186 1)
(s2187 1)
(s2188 1)
(s2189 1)
(s2190 1)
(s2191 1)
(s2192 1)
(s2193 1)
(s2194 1)
(s2195 1)
(s2196 1)
(s2197 1)
(s2198 1)
(s2199 1)
(s2200 1)
(s2201 1)
(s2202 1)
(s2203 1)
(s2204 1)
(s2205 1)
(s2206 1)
(s2207 1)
(s2208 1)
(s2209 1)
(s2210 1)
(s2211 1)
(s2212 1)
(s2213 1)
(s2214 1)
(s2215 1)
(s2216 1)
(s2217 1)
(s2218 1)
(s2219 1)
(s2220 1)
(s2221 1)
(s2222 1)
(s2223 1)
(s2224 1)
(s2225 1)
(s2226 1)
(s2227 1)
(s2228 1)
(s2229 1)
(s2230 1)
(s2231 1)
(s2232 1)
(s2233 1)
(s2234 1)
(s2235 1)
(s2236 1)
(s2237 1)
(s2238 1)
(s2239 1)
(s2240 1)
(s2241 1)
(s2242 1)
(s2243 1)
(s2244 1)
(s2245 1)
(s2246 1)
(s2247 1)
(s2248 1)
(s2249 1)
(s2250 1)
(s2251 1)
(s2252 1)
(s2253 1)
(s2254 1)
(s2255 1)
(s2256 1)
(s2257 1)
(s2258 1)
(s2259 1)
(s2260 1)
(s2261 1)
(s2262 1)
(s2263 1)
(s2264 1)
(s2265 1)
(s2266 1)
(s2267 1)
(s2268 1)
(s2269 1)
(s2270 1)
(s2271 1)
(s2272 1)
(s2273 1)
(s2274 1)
(s2275 1)
(s2276 1)
(s2277 1)
(s2278 1)
(s2279 1)
(s2280 1)
(s2281 1)
(s2282 1)
(s2283 1)
(s2284 1)
(s2285 1)
(s2286 1)
(s2287 1)
(s2288 1)
(s2289 1)
(s2290 1)
(s2291 1)
(s2292 1)
(s2293 1)
(s2294 1)
(s2295 1)
(s2296 1)
(s2297 1)
(s2298 1)
(s2299 1)
(s2300 1)
(s2301 1)
(s2302 1)
(s2303 1)
(s2304 1)
(s2305 1)
(s2306 1)
(s2307 1)
(s2308 1)
(s2309 1)
(s2310 1)
(s2311 1)
(s2312 1)
(s2313 1)
(s2314 1)
(s2315 1)
(s2316 1)
(s2317 1)
(s2318 1)
(s2319 1)
(s2320 1)
(s2321 1)
(s2322 1)
(s2323 1)
(s2324 1)
(s2325 1)
(s2326 1)
(s2327 1)
(s2328 1)
(s2329 1)
(s2330 1)
(s2331 1)
(s2332 1)
(s2333 1)
(s2334 1)
(s2335 1)
(s2336 1)
(s2337 1)
(s2338 1)
(s2339 1)
(s2340 1)
(s2341 1)
(s2342 1)
(s2343 1)
(s2344 1)
(s2345 1)
(s2346 1)
(s2347 1)
(s2348 1)
(s2349 1)
(s2350 1)
(s2351 1)
(s2352 1)
(s2353 1)
(s2354 1)
(s2355 1)
(s2356 1)
(s2357 1)
(s2358 1)
(s2359 1)
(s2360 1)
(s2361 1)
(s2362 1)
(s2363 1)
(s2364 1)
(s2365 1)
(s2366 1)
(s2367 1)
(s2368 1)
(s2369 1)
(s2370 1)
(s2371 1)
(s2372 1)
(s2373 1)
(s2374 1)
(s2375 1)
(s2376 1)
(s2377 1)
(s2378 1)
(s2379 1)
(s2380 1)
(s2381 1)
(s2382 1)
(s2383 1)
(s2384 1)
(s2385 1)
(s2386 1)
(s2387 1)
(s2388 1)
(s2389 1)
(s2390 1)
(s2391 1)
(s2392 1)
(s2393 1)
(s2394 1)
(s2395 1)
(s2396 1)
(s2397 1)
(s2398 1)
(s2399 1)
(s2400 1)
(s2401 1)
(s2402 1)
(s2403 1)
(s2404 1)
(s2405 1)
(s2406 1)
(s2407 1)
(s2408 1)
(s2409 1)
(s2410 1)
(s2411 1)
(s2412 1)
(s2413 1)
(s2414 1)
(s2415 1)
(s2416 1)
(s2417 1)
(s2418 1)
(s2419 1)
(s2420 1)
(s2421 1)
(s2422 1)
(s2423 1)
(s2424 1)
(s2425 1)
(s2426 1)
(s2427 1)
(s2428 1)
(s2429 1)
(s2430 1)
(s2431 1)
(s2432 1)
(s2433 1)
(s2434 1)
(s2435 1)
(s2436 1)
(s2437 1)
(s2438 1)
(s2439 1)
(s2440 1)
(s2441 1)
(s2442 1)
(s2443 1)
(s2444 1)
(s2445 1)
(s2446 1)
(s2447 1)
(s2448 1)
(s2449 1)
(s2450 1)
(s2451 1)
(s2452 1)
(s2453 1)
(s2454 1)
(s2455 1)
(s2456 1)
(s2457 1)
(s2458 1)
(s2459 1)
(s2460 1)
(s2461 1)
(s2462 1)
(s2463 1)
(s2464 1)
(s2465 1)
(s2466 1)
(s2467 1)
(s2468 1)
(s2469 1)
(s2470 1)
(s2471 1)
(s2472 1)
(s2473 1)
(s2474 1)
(s2475 1)
(s2476 1)
(s2477 1)
(s2478 1)
(s2479 1)
(s2480 1)
(s2481 1)
(s2482 1)
(s2483 1)
(s2484 1)
(s2485 1)
(s2486 1)
(s2487 1)
(s2488 1)
(s2489 1)
(s2490 1)
(s2491 1)
(s2492 1)
(s2493 1)
(s2494 1)
(s2495 1)
(s2496 1)
(s2497 1)
(s2498 1)
(s2499 1)
(s2500 1)
(s2501 1)
(s2502 1)
(s2503 1)
(s2504 1)
(s2505 1)
(s2506 1)
(s2507 1)
(s2508 1)
(s2509 1)
(s2510 1)
(s2511 1)
(s2512 1)
(s2513 1)
(s2514 1)
(s2515 1)
(s2516 1)
(s2517 1)
(s2518 1)
(s2519 1)
(s2520 1)
(s2521 1)
(s2522 1)
(s2523 1)
(s2524 1)
(s2525 1)
(s2526 1)
(s2527 1)
(s2528 1)
(s2529 1)
(s2530 1)
(s2531 1)
(s2532 1)
(s2533 1)
(s2534 1)
(s2535 1)
(s2536 1)
(s2537 1)
(s2538 1)
(s2539 1)
(s2540 1)
(s2541 1)
(s2542 1)
(s2543 1)
(s2544 1)
(s2545 1)
(s2546 1)
(s2547 1)
(s2548 1)
(s2549 1)
(s2550 1)
(s2551 1)
(s2552 1)
(s2553 1)
(s2554 1)
(s2555 1)
(s2556 1)
(s2557 1)
(s2558 1)
(s2559 1)
(s2560 1)
(s2561 1)
(s2562 1)
(s2563 1)
(s2564 1)
(s2565 1)
(s2566 1)
(s2567 1)
(s2568 1)
(s2569 1)
(s2570 1)
(s2571 1)
(s2572 1)
(s2573 1)
(s2574 1)
(s2575 1)
(s2576 1)
(s2577 1)
(s2578 1)
(s2579 1)
(s2580 1)
(s2581 1)
(s2582 1)
(s2583 1)
(s2584 1)
(s2585 1)
(s2586 1)
(s2587 1)
(s2588 1)
(s2589 1)
(s2590 1)
(s2591 1)
(s2592 1)
(s2593 1)
(s2594 1)
(s2595 1)
(s2596 1)
(s2597 1)
(s2598 1)
(s2599 1)
(s2600 1)
(s2601 1)
(s2602 1)
(s2603 1)
(s2604 1)
(s2605 1)
(s2606 1)
(s2607 1)
(s2608 1)
(s2609 1)
(s2610 1)
(s2611 1)
(s2612 1)
(s2613 1)
(s2614 1)
(s2615 1)
(s2616 1)
(s2617 1)
(s2618 1)
(s2619 1)
(s2620 1)
(s2621 1)
(s2622 1)
(s2623 1)
(s2624 1)
(s2625 1)
(s2626 1)
(s2627 1)
(s2628 1)
(s2629 1)
(s2630 1)
(s2631 1)
(s2632 1)
(s2633 1)
(s2634 1)
(s2635 1)
(s2636 1)
(s2637 1)
(s2638 1)
(s2639 1)
(s2640 1)
(s2641 1)
(s2642 1)
(s2643 1)
(s2644 1)
(s2645 1)
(s2646 1)
(s2647 1)
(s2648 1)
(s2649 1)
(s2650 1)
(s2651 1)
(s2652 1)
(s2653 1)
(s2654 1)
(s2655 1)
(s2656 1)
(s2657 1)
(s2658 1)
(s2659 1)
(s2660 1)
(s2661 1)
(s2662 1)
(s2663 1)
(s2664 1)
(s2665 1)
(s2666 1)
(s2667 1)
(s2668 1)
(s2669 1)
(s2670 1)
(s2671 1)
(s2672 1)
(s2673 1)
(s2674 1)
(s2675 1)
(s2676 1)
(s2677 1)
(s2678 1)
(s2679 1)
(s2680 1)
(s2681 1)
(s2682 1)
(s2683 1)
(s2684 1)
(s2685 1)
(s2686 1)
(s2687 1)
(s2688 1)
(s2689 1)
(s2690 1)
(s2691 1)
(s2692 1)
(s2693 1)
(s2694 1)
(s2695 1)
(s2696 1)
(s2697 1)
(s2698 1)
(s2699 1)
(s2700 1)
(s2701 1)
(s2702 1)
(s2703 1)
(s2704 1)
(s2705 1)
(s2706 1)
(s2707 1)
(s2708 1)
(s2709 1)
(s2710 1)
(s2711 1)
(s2712 1)
(s2713 1)
(s2714 1)
(s2715 1)
(s2716 1)
(s2717 1)
(s2718 1)
(s2719 1)
(s2720 1)
(s2721 1)
(s2722 1)
(s2723 1)
(s2724 1)
(s2725 1)
(s2726 1)
(s2727 1)
(s2728 1)
(s2729 1)
(s2730 1)
(s2731 1)
(s2732 1)
(s2733 1)
(s2734 1)
(s2735 1)
(s2736 1)
(s2737 1)
(s2738 1)
(s2739 1)
(s2740 1)
(s2741 1)
(s2742 1)
(s2743 1)
(s2744 1)
(s2745 1)
(s2746 1)
(s2747 1)
(s2748 1)
(s2749 1)
(s2750 1)
(s2751 1)
(s2752 1)
(s2753 1)
(s2754 1)
(s2755 1)
(s2756 1)
(s2757 1)
(s2758 1)
(s2759 1)
(s2760 1)
(s2761 1)
(s2762 1)
(s2763 1)
(s2764 1)
(s2765 1)
(s2766 1)
(s2767 1)
(s2768 1)
(s2769 1)
(s2770 1)
(s2771 1)
(s2772 1)
(s2773 1)
(s2774 1)
(s2775 1)
(s2776 1)
(s2777 1)
(s2778 1)
(s2779 1)
(s2780 1)
(s2781 1)
(s2782 1)
(s2783 1)
(s2784 1)
(s2785 1)
(s2786 1)
(s2787 1)
(s2788 1)
(s2789 1)
(s2790 1)
(s2791 1)
(s2792 1)
(s2793 1)
(s2794 1)
(s2795 1)
(s2796 1)
(s2797 1)
(s2798 1)
(s2799 1)
(s2800 1)
(s2801 1)
(s2802 1)
(s2803 1)
(s2804 1)
(s2805 1)
(s2806 1)
(s2807 1)
(s2808 1)
(s2809 1)
(s2810 1)
(s2811 1)
(s2812 1)
(s2813 1)
(s2814 1)
(s2815 1)
(s2816 1)
(s2817 1)
(s2818 1)
(s2819 1)
(s2820 1)
(s2821 1)
(s2822 1)
(s2823 1)
(s2824 1)
(s2825 1)
(s2826 1)
(s2827 1)
(s2828 1)
(s2829 1)
(s2830 1)
(s2831 1)
(s2832 1)
(s2833 1)
(s2834 1)
(s2835 1)
(s2836 1)
(s2837 1)
(s2838 1)
(s2839 1)
(s2840 1)
(s2841 1)
(s2842 1)
(s2843 1)
(s2844 1)
(s2845 1)
(s2846 1)
(s2847 1)
(s2848 1)
(s2849 1)
(s2850 1)
(s2851 1)
(s2852 1)
(s2853 1)
(s2854 1)
(s2855 1)
(s2856 1)
(s2857 1)
(s2858 1)
(s2859 1)
(s2860 1)
(s2861 1)
(s2862 1)
(s2863 1)
(s2864 1)
(s2865 1)
(s2866 1)
(s2867 1)
(s2868 1)
(s2869 1)
(s2870 1)
(s2871 1)
(s2872 1)
(s2873 1)
(s2874 1)
(s2875 1)
(s2876 1)
(s2877 1)
(s2878 1)
(s2879 1)
(s2880 1)
(s2881 1)
(s2882 1)
(s2883 1)
(s2884 1)
(s2885 1)
(s2886 1)
(s2887 1)
(s2888 1)
(s2889 1)
(s2890 1)
(s2891 1)
(s2892 1)
(s2893 1)
(s2894 1)
(s2895 1)
(s2896 1)
(s2897 1)
(s2898 1)
(s2899 1)
(s2900 1)
(s2901 1)
(s2902 1)
(s2903 1)
(s2904 1)
(s2905 1)
(s2906 1)
(s2907 1)
(s2908 1)
(s2909 1)
(s2910 1)
(s2911 1)
(s2912 1)
(s2913 1)
(s2914 1)
(s2915 1)
(s2916 1)
(s2917 1)
(s2918 1)
(s2919 1)
(s2920 1)
(s2921 1)
(s2922 1)
(s2923 1)
(s2924 1)
(s2925 1)
(s2926 1)
(s2927 1)
(s2928 1)
(s2929 1)
(s2930 1)
(s2931 1)
(s2932 1)
(s2933 1)
(s2934 1)
(s2935 1)
(s2936 1)
(s2937 1)
(s2938 1)
(s2939 1)
(s2940 1)
(s2941 1)
(s2942 1)
(s2943 1)
(s2944 1)
(s2945 1)
(s2946 1)
(s2947 1)
(s2948 1)
(s2949 1)
(s2950 1)
(s2951 1)
(s2952 1)
(s2953 1)
(s2954 1)
(s2955 1)
(s2956 1)
(s2957 1)
(s2958 1)
(s2959 1)
(s2960 1)
(s2961 1)
(s2962 1)
(s2963 1)
(s2964 1)
(s2965 1)
(s2966 1)
(s2967 1)
(s2968 1)
(s2969 1)
(s2970 1)
(s2971 1)
(s2972 1)
(s2973 1)
(s2974 1)
(s2975 1)
(s2976 1)
(s2977 1)
(s2978 1)
(s2979 1)
(s2980 1)
(s2981 1)
(s2982 1)
(s2983 1)
(s2984 1)
(s2985 1)
(s2986 1)
(s2987 1)
(s2988 1)
(s2989 1)
(s2990 1)
(s2991 1)
(s2992 1)
(s2993 1)
(s2994 1)
(s2995 1)
(s2996 1)
(s2997 1)
(s2998 1)
(s2999 1)
(s3000 1)
(s3001 1)
(s3002 1)
(s3003 1)
(s3004 1)
(s3005 1)
(s3006 1)
(s3007 1)
(s3008 1)
(s3009 1)
(s3010 1)
(s3011 1)
(s3012 1)
(s3013 1)
(s3014 1)
(s3015 1)
(s3016 1)
(s3017 1)
(s3018 1)
(s3019 1)
(s3020 1)
(s3021 1)
(s3022 1)
(s3023 1)
(s3024 1)
(s3025 1)
(s3026 1)
(s3027 1)
(s3028 1)
(s3029 1)
(s3030 1)
(s3031 1)
(s3032 1)
(s3033 1)
(s3034 1)
(s3035 1)
(s3036 1)
(s3037 1)
(s3038 1)
(s3039 1)
(s3040 1)
(s3041 1)
(s3042 1)
(s3043 1)
(s3044 1)
(s3045 1)
(s3046 1)
(s3047 1)
(s3048 1)
(s3049 1)
(s3050 1)
(s3051 1)
(s3052 1)
(s3053 1)
(s3054 1)
(s3055 1)
(s3056 1)
(s3057 1)
(s3058 1)
(s3059 1)
(s3060 1)
(s3061 1)
(s3062 1)
(s3063 1)
(s3064 1)
(s3065 1)
(s3066 1)
(s3067 1)
(s3068 1)
(s3069 1)
(s3070 1)
(s3071 1)
(s3072 1)
(s3073 1)
(s3074 1)
(s3075 1)
(s3076 1)
(s3077 1)
(s3078 1)
(s3079 1)
(s3080 1)
(s3081 1)
(s3082 1)
(s3083 1)
(s3084 1)
(s3085 1)
(s3086 1)
(s3087 1)
(s3088 1)
(s3089 1)
(s3090 1)
(s3091 1)
(s3092 1)
(s3093 1)
(s3094 1)
(s3095 1)
(s3096 1)
(s3097 1)
(s3098 1)
(s3099 1)
(s3100 1)
(s3101 1)
(s3102 1)
(s3103 1)
(s3104 1)
(s3105 1)
(s3106 1)
(s3107 1)
(s3108 1)
(s3109 1)
(s3110 1)
(s3111 1)
(s3112 1)
(s3113 1)
(s3114 1)
(s3115 1)
(s3116 1)
(s3117 1)
(s3118 1)
(s3119 1)
(s3120 1)
(s3121 1)
(s3122 1)
(s3123 1)
(s3124 1)
(s3125 1)
(s3126 1)
(s3127 1)
(s3128 1)
(s3129 1)
(s3130 1)
(s3131 1)
(s3132 1)
(s3133 1)
(s3134 1)
(s3135 1)
(s3136 1)
(s3137 1)
(s3138 1)
(s3139 1)
(s3140 1)
(s3141 1)
(s3142 1)
(s3143 1)
(s3144 1)
(s3145 1)
(s3146 1)
(s3147 1)
(s3148 1)
(s3149 1)
(s3150 1)
(s3151 1)
(s3152 1)
(s3153 1)
(s3154 1)
(s3155 1)
(s3156 1)
(s3157 1)
(s3158 1)
(s3159 1)
(s3160 1)
(s3161 1)
(s3162 1)
(s3163 1)
(s3164 1)
(s3165 1)
(s3166 1)
(s3167 1)
(s3168 1)
(s3169 1)
(s3170 1)
(s3171 1)
(s3172 1)
(s3173 1)
(s3174 1)
(s3175 1)
(s3176 1)
(s3177 1)
(s3178 1)
(s3179 1)
(s3180 1)
(s3181 1)
(s3182 1)
(s3183 1)
(s3184 1)
(s3185 1)
(s3186 1)
(s3187 1)
(s3188 1)
(s3189 1)
(s3190 1)
(s3191 1)
(s3192 1)
(s3193 1)
(s3194 1)
(s3195 1)
(s3196 1)
(s3197 1)
(s3198 1)
(s3199 1)
(s3200 1)
(s3201 1)
(s3202 1)
(s3203 1)
(s3204 1)
(s3205 1)
(s3206 1)
(s3207 1)
(s3208 1)
(s3209 1)
(s3210 1)
(s3211 1)
(s3212 1)
(s3213 1)
(s3214 1)
(s3215 1)
(s3216 1)
(s3217 1)
(s3218 1)
(s3219 1)
(s3220 1)
(s3221 1)
(s3222 1)
(s3223 1)
(s3224 1)
(s3225 1)
(s3226 1)
(s3227 1)
(s3228 1)
(s3229 1)
(s3230 1)
(s3231 1)
(s3232 1)
(s3233 1)
(s3234 1)
(s3235 1)
(s3236 1)
(s3237 1)
(s3238 1)
(s3239 1)
(s3240 1)
(s3241 1)
(s3242 1)
(s3243 1)
(s3244 1)
(s3245 1)
(s3246 1)
(s3247 1)
(s3248 1)
(s3249 1)
(s3250 1)
(s3251 1)
(s3252 1)
(s3253 1)
(s3254 1)
(s3255 1)
(s3256 1)
(s3257 1)
(s3258 1)
(s3259 1)
(s3260 1)
(s3261 1)
(s3262 1)
(s3263 1)
(s3264 1)
(s3265 1)
(s3266 1)
(s3267 1)
(s3268 1)
(s3269 1)
(s3270 1)
(s3271 1)
(s3272 1)
(s3273 1)
(s3274 1)
(s3275 1)
(s3276 1)
(s3277 1)
(s3278 1)
(s3279 1)
(s3280 1)
(s3281 1)
(s3282 1)
(s3283 1)
(s3284 1)
(s3285 1)
(s3286 1)
(s3287 1)
(s3288 1)
(s3289 1)
(s3290 1)
(s3291 1)
(s3292 1)
(s3293 1)
(s3294 1)
(s3295 1)
(s3296 1)
(s3297 1)
(s3298 1)
(s3299 1)
(s3300 1)
(s3301 1)
(s3302 1)
(s3303 1)
(s3304 1)
(s3305 1)
(s3306 1)
(s3307 1)
(s3308 1)
(s3309 1)
(s3310 1)
(s3311 1)
(s3312 1)
(s3313 1)
(s3314 1)
(s3315 1)
(s3316 1)
(s3317 1)
(s3318 1)
(s3319 1)
(s3320 1)
(s3321 1)
(s3322 1)
(s3323 1)
(s3324 1)
(s3325 1)
(s3326 1)
(s3327 1)
(s3328 1)
(s3329 1)
(s3330 1)
(s3331 1)
(s3332 1)
(s3333 1)
(s3334 1)
(s3335 1)
(s3336 1)
(s3337 1)
(s3338 1)
(s3339 1)
(s3340 1)
(s3341 1)
(s3342 1)
(s3343 1)
(s3344 1)
(s3345 1)
(s3346 1)
(s3347 1)
(s3348 1)
(s3349 1)
(s3350 1)
(s3351 1)
(s3352 1)
(s3353 1)
(s3354 1)
(s3355 1)
(s3356 1)
(s3357 1)
(s3358 1)
(s3359 1)
(s3360 1)
(s3361 1)
(s3362 1)
(s3363 1)
(s3364 1)
(s3365 1)
(s3366 1)
(s3367 1)
(s3368 1)
(s3369 1)
(s3370 1)
(s3371 1)
(s3372 1)
(s3373 1)
(s3374 1)
(s3375 1)
(s3376 1)
(s3377 1)
(s3378 1)
(s3379 1)
(s3380 1)
(s3381 1)
(s3382 1)
(s3383 1)
(s3384 1)
(s3385 1)
(s3386 1)
(s3387 1)
(s3388 1)
(s3389 1)
(s3390 1)
(s3391 1)
(s3392 1)
(s3393 1)
(s3394 1)
(s3395 1)
(s3396 1)
(s3397 1)
(s3398 1)
(s3399 1)
(s3400 1)
(s3401 1)
(s3402 1)
(s3403 1)
(s3404 1)
(s3405 1)
(s3406 1)
(s3407 1)
(s3408 1)
(s3409 1)
(s3410 1)
(s3411 1)
(s3412 1)
(s3413 1)
(s3414 1)
(s3415 1)
(s3416 1)
(s3417 1)
(s3418 1)
(s3419 1)
(s3420 1)
(s3421 1)
(s3422 1)
(s3423 1)
(s3424 1)
(s3425 1)
(s3426 1)
(s3427 1)
(s3428 1)
(s3429 1)
(s3430 1)
(s3431 1)
(s3432 1)
(s3433 1)
(s3434 1)
(s3435 1)
(s3436 1)
(s3437 1)
(s3438 1)
(s3439 1)
(s3440 1)
(s3441 1)
(s3442 1)
(s3443 1)
(s3444 1)
(s3445 1)
(s3446 1)
(s3447 1)
(s3448 1)
(s3449 1)
(s3450 1)
(s3451 1)
(s3452 1)
(s3453 1)
(s3454 1)
(s3455 1)
(s3456 1)
(s3457 1)
(s3458 1)
(s3459 1)
(s3460 1)
(s3461 1)
(s3462 1)
(s3463 1)
(s3464 1)
(s3465 1)
(s3466 1)
(s3467 1)
(s3468 1)
(s3469 1)
(s3470 1)
(s3471 1)
(s3472 1)
(s3473 1)
(s3474 1)
(s3475 1)
(s3476 1)
(s3477 1)
(s3478 1)
(s3479 1)
(s3480 1)
(s3481 1)
(s3482 1)
(s3483 1)
(s3484 1)
(s3485 1)
(s3486 1)
(s3487 1)
(s3488 1)
(s3489 1)
(s3490 1)
(s3491 1)
(s3492 1)
(s3493 1)
(s3494 1)
(s3495 1)
(s3496 1)
(s3497 1)
(s3498 1)
(s3499 1)
(s3500 1)
(s3501 1)
(s3502 1)
(s3503 1)
(s3504 1)
(s3505 1)
(s3506 1)
(s3507 1)
(s3508 1)
(s3509 1)
(s3510 1)
(s3511 1)
(s3512 1)
(s3513 1)
(s3514 1)
(s3515 1)
(s3516 1)
(s3517 1)
(s3518 1)
(s3519 1)
(s3520 1)
(s3521 1)
(s3522 1)
(s3523 1)
(s3524 1)
(s3525 1)
(s3526 1)
(s3527 1)
(s3528 1)
(s3529 1)
(s3530 1)
(s3531 1)
(s3532 1)
(s3533 1)
(s3534 1)
(s3535 1)
(s3536 1)
(s3537 1)
(s3538 1)
(s3539 1)
(s3540 1)
(s3541 1)
(s3542 1)
(s3543 1)
(s3544 1)
(s3545 1)
(s3546 1)
(s3547 1)
(s3548 1)
(s3549 1)
(s3550 1)
(s3551 1)
(s3552 1)
(s3553 1)
(s3554 1)
(s3555 1)
(s3556 1)
(s3557 1)
(s3558 1)
(s3559 1)
(s3560 1)
(s3561 1)
(s3562 1)
(s3563 1)
(s3564 1)
(s3565 1)
(s3566 1)
(s3567 1)
(s3568 1)
(s3569 1)
(s3570 1)
(s3571 1)
(s3572 1)
(s3573 1)
(s3574 1)
(s3575 1)
(s3576 1)
(s3577 1)
(s3578 1)
(s3579 1)
(s3580 1)
(s3581 1)
(s3582 1)
(s3583 1)
(s3584 1)
(s3585 1)
(s3586 1)
(s3587 1)
(s3588 1)
(s3589 1)
(s3590 1)
(s3591 1)
(s3592 1)
(s3593 1)
(s3594 1)
(s3595 1)
(s3596 1)
(s3597 1)
(s3598 1)
(s3599 1)
(s3600 1)
(s3601 1)
(s3602 1)
(s3603 1)
(s3604 1)
(s3605 1)
(s3606 1)
(s3607 1)
(s3608 1)
(s3609 1)
(s3610 1)
(s3611 1)
(s3612 1)
(s3613 1)
(s3614 1)
(s3615 1)
(s3616 1)
(s3617 1)
(s3618 1)
(s3619 1)
(s3620 1)
(s3621 1)
(s3622 1)
(s3623 1)
(s3624 1)
(s3625 1)
(s3626 1)
(s3627 1)
(s3628 1)
(s3629 1)
(s3630 1)
(s3631 1)
(s3632 1)
(s3633 1)
(s3634 1)
(s3635 1)
(s3636 1)
(s3637 1)
(s3638 1)
(s3639 1)
(s3640 1)
(s3641 1)
(s3642 1)
(s3643 1)
(s3644 1)
(s3645 1)
(s3646 1)
(s3647 1)
(s3648 1)
(s3649 1)
(s3650 1)
(s3651 1)
(s3652 1)
(s3653 1)
(s3654 1)
(s3655 1)
(s3656 1)
(s3657 1)
(s3658 1)
(s3659 1)
(s3660 1)
(s3661 1)
(s3662 1)
(s3663 1)
(s3664 1)
(s3665 1)
(s3666 1)
(s3667 1)
(s3668 1)
(s3669 1)
(s3670 1)
(s3671 1)
(s3672 1)
(s3673 1)
(s3674 1)
(s3675 1)
(s3676 1)
(s3677 1)
(s3678 1)
(s3679 1)
(s3680 1)
(s3681 1)
(s3682 1)
(s3683 1)
(s3684 1)timeout
(s3685 1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 0/3901 constraints, Known Traps: 0/0 constraints]
After SMT, in 61495ms problems are : Problem set: 0 solved, 3901 unsolved
Search for dead transitions found 0 dead transitions in 61535ms
Finished structural reductions in LTL mode , in 1 iterations and 67456 ms. Remains : 3902/3902 places, 3902/3902 transitions.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Detected a total of 1198/3902 stabilizing places and 1198/3902 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 178 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (8 resets) in 1144 ms. (34 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
[2024-06-01 22:12:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 148/151 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3751/3902 variables, 396/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 22:12:31] [INFO ] Deduced a trap composed of 23 places in 359 ms of which 6 ms to minimize.
[2024-06-01 22:12:31] [INFO ] Deduced a trap composed of 34 places in 357 ms of which 7 ms to minimize.
[2024-06-01 22:12:32] [INFO ] Deduced a trap composed of 36 places in 350 ms of which 6 ms to minimize.
[2024-06-01 22:12:32] [INFO ] Deduced a trap composed of 57 places in 341 ms of which 7 ms to minimize.
[2024-06-01 22:12:33] [INFO ] Deduced a trap composed of 63 places in 299 ms of which 6 ms to minimize.
[2024-06-01 22:12:33] [INFO ] Deduced a trap composed of 42 places in 305 ms of which 7 ms to minimize.
[2024-06-01 22:12:33] [INFO ] Deduced a trap composed of 28 places in 301 ms of which 6 ms to minimize.
[2024-06-01 22:12:34] [INFO ] Deduced a trap composed of 58 places in 292 ms of which 6 ms to minimize.
[2024-06-01 22:12:34] [INFO ] Deduced a trap composed of 48 places in 288 ms of which 6 ms to minimize.
[2024-06-01 22:12:34] [INFO ] Deduced a trap composed of 58 places in 289 ms of which 6 ms to minimize.
[2024-06-01 22:12:35] [INFO ] Deduced a trap composed of 57 places in 288 ms of which 6 ms to minimize.
[2024-06-01 22:12:35] [INFO ] Deduced a trap composed of 58 places in 286 ms of which 6 ms to minimize.
SMT process timed out in 5211ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1098 transitions
Trivial Post-agglo rules discarded 1098 transitions
Performed 1098 trivial Post agglomeration. Transition count delta: 1098
Iterating post reduction 0 with 1098 rules applied. Total rules applied 1098 place count 3902 transition count 2804
Reduce places removed 1098 places and 0 transitions.
Iterating post reduction 1 with 1098 rules applied. Total rules applied 2196 place count 2804 transition count 2804
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2196 place count 2804 transition count 2005
Deduced a syphon composed of 799 places in 6 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3794 place count 2005 transition count 2005
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 1 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 5592 place count 1106 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5593 place count 1106 transition count 1105
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5595 place count 1105 transition count 1104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5797 place count 1004 transition count 1204
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5999 place count 903 transition count 1305
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6193 place count 806 transition count 1402
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6194 place count 806 transition count 1401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6195 place count 805 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6196 place count 804 transition count 1400
Applied a total of 6196 rules in 659 ms. Remains 804 /3902 variables (removed 3098) and now considering 1400/3902 (removed 2502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 660 ms. Remains : 804/3902 places, 1400/3902 transitions.
RANDOM walk for 40000 steps (12 resets) in 1715 ms. (23 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 390 ms. (102 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (9 resets) in 337 ms. (118 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 130885 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 5
Probabilistic random walk after 130885 steps, saw 80970 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
// Phase 1: matrix 1400 rows 804 cols
[2024-06-01 22:12:40] [INFO ] Computed 400 invariants in 5 ms
[2024-06-01 22:12:40] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 38/54 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 97/151 variables, 30/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 131/282 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 23/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/282 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 132/414 variables, 48/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/414 variables, 24/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/414 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 129/543 variables, 48/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/543 variables, 24/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/543 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 116/659 variables, 44/334 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/659 variables, 22/356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/659 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 110/769 variables, 40/396 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/769 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/769 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 85/854 variables, 34/450 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/854 variables, 17/467 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/854 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 69/923 variables, 26/493 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/923 variables, 13/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/923 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 66/989 variables, 24/530 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/989 variables, 12/542 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/989 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 66/1055 variables, 24/566 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1055 variables, 12/578 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1055 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 66/1121 variables, 24/602 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1121 variables, 12/614 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1121 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (OVERLAPS) 66/1187 variables, 24/638 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1187 variables, 12/650 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1187 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (OVERLAPS) 66/1253 variables, 24/674 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1253 variables, 12/686 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1253 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (OVERLAPS) 66/1319 variables, 24/710 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1319 variables, 12/722 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1319 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (OVERLAPS) 66/1385 variables, 24/746 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1385 variables, 12/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1385 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (OVERLAPS) 66/1451 variables, 24/782 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1451 variables, 12/794 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1451 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (OVERLAPS) 66/1517 variables, 24/818 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1517 variables, 12/830 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1517 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 60 (OVERLAPS) 66/1583 variables, 24/854 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1583 variables, 12/866 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1583 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 63 (OVERLAPS) 66/1649 variables, 24/890 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1649 variables, 12/902 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1649 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 66 (OVERLAPS) 66/1715 variables, 24/926 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1715 variables, 12/938 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1715 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 69 (OVERLAPS) 66/1781 variables, 24/962 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1781 variables, 12/974 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1781 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 72 (OVERLAPS) 66/1847 variables, 24/998 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1847 variables, 12/1010 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1847 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 75 (OVERLAPS) 66/1913 variables, 24/1034 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1913 variables, 12/1046 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1913 variables, 0/1046 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 78 (OVERLAPS) 66/1979 variables, 24/1070 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1979 variables, 12/1082 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1979 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 81 (OVERLAPS) 66/2045 variables, 24/1106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/2045 variables, 12/1118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2045 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 84 (OVERLAPS) 53/2098 variables, 22/1140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/2098 variables, 11/1151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2098 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 87 (OVERLAPS) 25/2123 variables, 10/1161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/2123 variables, 5/1166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2123 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 90 (OVERLAPS) 22/2145 variables, 8/1174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/2145 variables, 4/1178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2145 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 93 (OVERLAPS) 22/2167 variables, 8/1186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/2167 variables, 4/1190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2167 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 96 (OVERLAPS) 20/2187 variables, 8/1198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/2187 variables, 4/1202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2187 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 99 (OVERLAPS) 14/2201 variables, 6/1208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/2201 variables, 3/1211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2201 variables, 0/1211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 102 (OVERLAPS) 3/2204 variables, 2/1213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/2204 variables, 1/1214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2204 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 105 (OVERLAPS) 0/2204 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2204/2204 variables, and 1214 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3186 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 804/804 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 38/54 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 97/151 variables, 30/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/151 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 131/282 variables, 46/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/282 variables, 23/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/282 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 132/414 variables, 48/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/414 variables, 24/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/414 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 129/543 variables, 48/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/543 variables, 24/295 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/543 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 116/659 variables, 44/339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/659 variables, 22/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/659 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 110/769 variables, 40/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/769 variables, 20/421 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/769 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 85/854 variables, 34/455 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/854 variables, 17/472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/854 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 69/923 variables, 26/498 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/923 variables, 13/511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/923 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (OVERLAPS) 66/989 variables, 24/535 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/989 variables, 12/547 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/989 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (OVERLAPS) 66/1055 variables, 24/571 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1055 variables, 12/583 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1055 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (OVERLAPS) 66/1121 variables, 24/607 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1121 variables, 12/619 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1121 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (OVERLAPS) 66/1187 variables, 24/643 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1187 variables, 12/655 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1187 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (OVERLAPS) 66/1253 variables, 24/679 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1253 variables, 12/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1253 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (OVERLAPS) 66/1319 variables, 24/715 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1319 variables, 12/727 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1319 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (OVERLAPS) 66/1385 variables, 24/751 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1385 variables, 12/763 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1385 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (OVERLAPS) 66/1451 variables, 24/787 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1451 variables, 12/799 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1451 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 58 (OVERLAPS) 66/1517 variables, 24/823 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1517 variables, 12/835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1517 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 61 (OVERLAPS) 66/1583 variables, 24/859 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1583 variables, 12/871 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1583 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 64 (OVERLAPS) 66/1649 variables, 24/895 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1649 variables, 12/907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1649 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 67 (OVERLAPS) 66/1715 variables, 24/931 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1715 variables, 12/943 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1715 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 70 (OVERLAPS) 66/1781 variables, 24/967 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1781 variables, 12/979 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1781 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 73 (OVERLAPS) 66/1847 variables, 24/1003 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1847 variables, 12/1015 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1847 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 76 (OVERLAPS) 66/1913 variables, 24/1039 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1913 variables, 12/1051 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1913 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 79 (OVERLAPS) 66/1979 variables, 24/1075 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1979 variables, 12/1087 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1979 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 82 (OVERLAPS) 66/2045 variables, 24/1111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2045 variables, 12/1123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2045 variables, 0/1123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 85 (OVERLAPS) 53/2098 variables, 22/1145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2098 variables, 11/1156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2098 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 88 (OVERLAPS) 25/2123 variables, 10/1166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2123 variables, 5/1171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/2123 variables, 0/1171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 91 (OVERLAPS) 22/2145 variables, 8/1179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2145 variables, 4/1183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/2145 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 94 (OVERLAPS) 22/2167 variables, 8/1191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2167 variables, 4/1195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2167 variables, 0/1195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 97 (OVERLAPS) 20/2187 variables, 8/1203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2187 variables, 4/1207 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/2187 variables, 0/1207 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 100 (OVERLAPS) 14/2201 variables, 6/1213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2201 variables, 3/1216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/2201 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 103 (OVERLAPS) 3/2204 variables, 2/1218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2204 variables, 1/1219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/2204 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 106 (OVERLAPS) 0/2204 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2204/2204 variables, and 1219 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3855 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 804/804 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 7057ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1757 ms.
Support contains 3 out of 804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1400/1400 transitions.
Applied a total of 0 rules in 25 ms. Remains 804 /804 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 804/804 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1400/1400 transitions.
Applied a total of 0 rules in 24 ms. Remains 804 /804 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2024-06-01 22:12:48] [INFO ] Invariant cache hit.
[2024-06-01 22:12:49] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-06-01 22:12:49] [INFO ] Invariant cache hit.
[2024-06-01 22:12:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 22:12:50] [INFO ] Implicit Places using invariants and state equation in 1116 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
[2024-06-01 22:12:50] [INFO ] Redundant transitions in 21 ms returned []
Running 1396 sub problems to find dead transitions.
[2024-06-01 22:12:50] [INFO ] Invariant cache hit.
[2024-06-01 22:12:50] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/803 variables, 396/396 constraints. Problems are: Problem set: 0 solved, 1396 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 803/2204 variables, and 396 constraints, problems are : Problem set: 0 solved, 1396 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 396/400 constraints, State Equation: 0/804 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 1396/1396 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/803 variables, 396/396 constraints. Problems are: Problem set: 0 solved, 1396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/803 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1396 unsolved
At refinement iteration 2 (OVERLAPS) 1/804 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 1396 unsolved
[2024-06-01 22:13:42] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 804/2204 variables, and 401 constraints, problems are : Problem set: 0 solved, 1396 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 0/804 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 0/1396 constraints, Known Traps: 1/1 constraints]
After SMT, in 60503ms problems are : Problem set: 0 solved, 1396 unsolved
Search for dead transitions found 0 dead transitions in 60515ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62118 ms. Remains : 804/804 places, 1400/1400 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 399 edges and 804 vertex of which 4 / 804 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2787 edges and 802 vertex of which 800 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 396 edges and 798 vertex of which 4 / 798 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 796 transition count 1391
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 395 edges and 794 vertex of which 6 / 794 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 791 transition count 1382
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 393 edges and 788 vertex of which 8 / 788 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 784 transition count 1371
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 389 edges and 780 vertex of which 8 / 780 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 776 transition count 1357
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 385 edges and 772 vertex of which 8 / 772 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 768 transition count 1343
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 381 edges and 764 vertex of which 8 / 764 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 760 transition count 1329
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 377 edges and 756 vertex of which 8 / 756 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 752 transition count 1315
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 373 edges and 748 vertex of which 8 / 748 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 744 transition count 1301
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 369 edges and 740 vertex of which 8 / 740 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 736 transition count 1287
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 365 edges and 732 vertex of which 8 / 732 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 728 transition count 1273
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 361 edges and 724 vertex of which 8 / 724 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 720 transition count 1259
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 357 edges and 716 vertex of which 8 / 716 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 712 transition count 1245
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 353 edges and 708 vertex of which 8 / 708 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 704 transition count 1231
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 349 edges and 700 vertex of which 8 / 700 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 696 transition count 1217
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 345 edges and 692 vertex of which 8 / 692 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 688 transition count 1203
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 341 edges and 684 vertex of which 8 / 684 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 680 transition count 1189
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 337 edges and 676 vertex of which 8 / 676 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 672 transition count 1175
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 333 edges and 668 vertex of which 8 / 668 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 664 transition count 1161
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 329 edges and 660 vertex of which 8 / 660 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 656 transition count 1147
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 325 edges and 652 vertex of which 8 / 652 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 648 transition count 1133
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 321 edges and 644 vertex of which 8 / 644 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 640 transition count 1119
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 317 edges and 636 vertex of which 8 / 636 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 632 transition count 1105
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 313 edges and 628 vertex of which 8 / 628 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 624 transition count 1091
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 309 edges and 620 vertex of which 8 / 620 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 616 transition count 1077
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 305 edges and 612 vertex of which 8 / 612 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 608 transition count 1063
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 301 edges and 604 vertex of which 8 / 604 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 600 transition count 1049
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 297 edges and 596 vertex of which 8 / 596 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 592 transition count 1035
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 293 edges and 588 vertex of which 8 / 588 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 584 transition count 1021
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 289 edges and 580 vertex of which 8 / 580 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 576 transition count 1007
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 285 edges and 572 vertex of which 6 / 572 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 569 transition count 993
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 282 edges and 566 vertex of which 6 / 566 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 30 with 14 rules applied. Total rules applied 562 place count 563 transition count 983
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 279 edges and 560 vertex of which 6 / 560 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 31 with 16 rules applied. Total rules applied 578 place count 557 transition count 971
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 277 edges and 554 vertex of which 8 / 554 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 15 rules applied. Total rules applied 593 place count 550 transition count 960
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 274 edges and 546 vertex of which 10 / 546 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 33 with 20 rules applied. Total rules applied 613 place count 541 transition count 945
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 268 edges and 536 vertex of which 8 / 536 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 34 with 25 rules applied. Total rules applied 638 place count 532 transition count 926
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 263 edges and 527 vertex of which 8 / 527 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 21 rules applied. Total rules applied 659 place count 523 transition count 911
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 259 edges and 519 vertex of which 8 / 519 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 678 place count 515 transition count 897
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 255 edges and 511 vertex of which 8 / 511 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 697 place count 507 transition count 883
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 251 edges and 503 vertex of which 8 / 503 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 716 place count 499 transition count 869
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 247 edges and 495 vertex of which 8 / 495 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 735 place count 491 transition count 855
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 243 edges and 487 vertex of which 8 / 487 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 754 place count 483 transition count 841
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 239 edges and 479 vertex of which 8 / 479 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 773 place count 475 transition count 827
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 235 edges and 471 vertex of which 8 / 471 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 19 rules applied. Total rules applied 792 place count 467 transition count 813
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 231 edges and 463 vertex of which 8 / 463 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 19 rules applied. Total rules applied 811 place count 459 transition count 799
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 227 edges and 455 vertex of which 8 / 455 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 44 with 19 rules applied. Total rules applied 830 place count 451 transition count 785
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 223 edges and 447 vertex of which 8 / 447 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 45 with 19 rules applied. Total rules applied 849 place count 443 transition count 771
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 219 edges and 439 vertex of which 8 / 439 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 46 with 19 rules applied. Total rules applied 868 place count 435 transition count 757
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 215 edges and 431 vertex of which 8 / 431 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 47 with 19 rules applied. Total rules applied 887 place count 427 transition count 743
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 211 edges and 423 vertex of which 8 / 423 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 48 with 19 rules applied. Total rules applied 906 place count 419 transition count 729
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 207 edges and 415 vertex of which 8 / 415 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 49 with 19 rules applied. Total rules applied 925 place count 411 transition count 715
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 203 edges and 407 vertex of which 8 / 407 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 50 with 19 rules applied. Total rules applied 944 place count 403 transition count 701
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 199 edges and 399 vertex of which 8 / 399 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 51 with 19 rules applied. Total rules applied 963 place count 395 transition count 687
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 195 edges and 391 vertex of which 8 / 391 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 52 with 19 rules applied. Total rules applied 982 place count 387 transition count 673
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 191 edges and 383 vertex of which 8 / 383 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 53 with 19 rules applied. Total rules applied 1001 place count 379 transition count 659
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 187 edges and 375 vertex of which 8 / 375 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 54 with 19 rules applied. Total rules applied 1020 place count 371 transition count 645
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 183 edges and 367 vertex of which 8 / 367 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 55 with 19 rules applied. Total rules applied 1039 place count 363 transition count 631
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 179 edges and 359 vertex of which 8 / 359 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 56 with 19 rules applied. Total rules applied 1058 place count 355 transition count 617
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 175 edges and 351 vertex of which 8 / 351 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 57 with 19 rules applied. Total rules applied 1077 place count 347 transition count 603
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 171 edges and 343 vertex of which 8 / 343 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 58 with 19 rules applied. Total rules applied 1096 place count 339 transition count 589
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 335 vertex of which 8 / 335 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 59 with 19 rules applied. Total rules applied 1115 place count 331 transition count 575
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 327 vertex of which 8 / 327 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 60 with 19 rules applied. Total rules applied 1134 place count 323 transition count 561
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 319 vertex of which 8 / 319 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 61 with 19 rules applied. Total rules applied 1153 place count 315 transition count 547
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 311 vertex of which 8 / 311 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 62 with 19 rules applied. Total rules applied 1172 place count 307 transition count 533
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 303 vertex of which 8 / 303 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 63 with 19 rules applied. Total rules applied 1191 place count 299 transition count 519
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 147 edges and 295 vertex of which 8 / 295 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 64 with 19 rules applied. Total rules applied 1210 place count 291 transition count 505
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 143 edges and 287 vertex of which 8 / 287 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 65 with 19 rules applied. Total rules applied 1229 place count 283 transition count 491
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 139 edges and 279 vertex of which 8 / 279 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 66 with 19 rules applied. Total rules applied 1248 place count 275 transition count 477
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 135 edges and 271 vertex of which 8 / 271 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 67 with 19 rules applied. Total rules applied 1267 place count 267 transition count 463
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 131 edges and 263 vertex of which 8 / 263 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 68 with 19 rules applied. Total rules applied 1286 place count 259 transition count 449
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 127 edges and 255 vertex of which 8 / 255 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 69 with 19 rules applied. Total rules applied 1305 place count 251 transition count 435
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 123 edges and 247 vertex of which 8 / 247 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 70 with 19 rules applied. Total rules applied 1324 place count 243 transition count 421
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 119 edges and 239 vertex of which 8 / 239 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 71 with 19 rules applied. Total rules applied 1343 place count 235 transition count 407
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 115 edges and 231 vertex of which 8 / 231 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 72 with 19 rules applied. Total rules applied 1362 place count 227 transition count 393
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 111 edges and 223 vertex of which 8 / 223 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 73 with 19 rules applied. Total rules applied 1381 place count 219 transition count 379
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 107 edges and 215 vertex of which 8 / 215 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 74 with 19 rules applied. Total rules applied 1400 place count 211 transition count 365
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 103 edges and 207 vertex of which 8 / 207 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 75 with 19 rules applied. Total rules applied 1419 place count 203 transition count 351
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 99 edges and 199 vertex of which 8 / 199 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 76 with 19 rules applied. Total rules applied 1438 place count 195 transition count 337
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 95 edges and 191 vertex of which 8 / 191 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 77 with 19 rules applied. Total rules applied 1457 place count 187 transition count 323
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 91 edges and 183 vertex of which 8 / 183 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 78 with 19 rules applied. Total rules applied 1476 place count 179 transition count 309
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 87 edges and 175 vertex of which 8 / 175 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 79 with 19 rules applied. Total rules applied 1495 place count 171 transition count 295
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 83 edges and 167 vertex of which 6 / 167 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 80 with 19 rules applied. Total rules applied 1514 place count 164 transition count 281
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 79 edges and 161 vertex of which 4 / 161 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 81 with 14 rules applied. Total rules applied 1528 place count 159 transition count 271
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 76 edges and 157 vertex of which 2 / 157 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 82 with 9 rules applied. Total rules applied 1537 place count 156 transition count 265
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 83 with 5 rules applied. Total rules applied 1542 place count 155 transition count 261
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 84 with 2 Pre rules applied. Total rules applied 1542 place count 155 transition count 259
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 84 with 5 rules applied. Total rules applied 1547 place count 152 transition count 259
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 84 with 3 rules applied. Total rules applied 1550 place count 150 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 84 with 4 rules applied. Total rules applied 1554 place count 150 transition count 254
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 85 with 1 rules applied. Total rules applied 1555 place count 150 transition count 254
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 85 with 1 rules applied. Total rules applied 1556 place count 150 transition count 253
Applied a total of 1556 rules in 184 ms. Remains 150 /804 variables (removed 654) and now considering 253/1400 (removed 1147) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 253 rows 150 cols
[2024-06-01 22:13:51] [INFO ] Computed 74 invariants in 1 ms
[2024-06-01 22:13:51] [INFO ] [Real]Absence check using 74 positive place invariants in 8 ms returned sat
[2024-06-01 22:13:51] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-01 22:13:51] [INFO ] [Nat]Absence check using 74 positive place invariants in 7 ms returned sat
[2024-06-01 22:13:51] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-06-01 22:13:51] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-06-01 22:13:51] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 545 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p0)]
Knowledge based reduction with 14 factoid took 264 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
// Phase 1: matrix 3902 rows 3902 cols
[2024-06-01 22:13:52] [INFO ] Computed 401 invariants in 14 ms
[2024-06-01 22:13:54] [INFO ] [Real]Absence check using 401 positive place invariants in 796 ms returned sat
[2024-06-01 22:14:07] [INFO ] [Real]Absence check using state equation in 12686 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Product exploration explored 100000 steps with 53 reset in 637 ms.
Product exploration explored 100000 steps with 53 reset in 764 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Support contains 3 out of 3902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Performed 1098 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1098 rules applied. Total rules applied 1098 place count 3902 transition count 3902
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 400 Pre rules applied. Total rules applied 1098 place count 3902 transition count 4301
Deduced a syphon composed of 1498 places in 11 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 1498 place count 3902 transition count 4301
Performed 1199 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2697 places in 9 ms
Iterating global reduction 1 with 1199 rules applied. Total rules applied 2697 place count 3902 transition count 4302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2698 place count 3902 transition count 4301
Renaming transitions due to excessive name length > 1024 char.
Discarding 799 places :
Symmetric choice reduction at 2 with 799 rule applications. Total rules 3497 place count 3103 transition count 3502
Deduced a syphon composed of 1898 places in 6 ms
Iterating global reduction 2 with 799 rules applied. Total rules applied 4296 place count 3103 transition count 3502
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1899 places in 7 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 4297 place count 3103 transition count 3502
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4299 place count 3101 transition count 3500
Deduced a syphon composed of 1897 places in 6 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 4301 place count 3101 transition count 3500
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 1998 places in 7 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4402 place count 3101 transition count 4232
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4503 place count 3000 transition count 4030
Deduced a syphon composed of 1897 places in 6 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4604 place count 3000 transition count 4030
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -727
Deduced a syphon composed of 1998 places in 6 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4705 place count 3000 transition count 4757
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4806 place count 2899 transition count 4555
Deduced a syphon composed of 1897 places in 6 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4907 place count 2899 transition count 4555
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -743
Deduced a syphon composed of 1998 places in 4 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5008 place count 2899 transition count 5298
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5109 place count 2798 transition count 5096
Deduced a syphon composed of 1897 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5210 place count 2798 transition count 5096
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -683
Deduced a syphon composed of 1992 places in 1 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 5305 place count 2798 transition count 5779
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 5400 place count 2703 transition count 5589
Deduced a syphon composed of 1897 places in 1 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 5495 place count 2703 transition count 5589
Deduced a syphon composed of 1897 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 5498 place count 2703 transition count 5586
Deduced a syphon composed of 1897 places in 1 ms
Applied a total of 5498 rules in 3493 ms. Remains 2703 /3902 variables (removed 1199) and now considering 5586/3902 (removed -1684) transitions.
[2024-06-01 22:14:12] [INFO ] Redundant transitions in 230 ms returned []
Running 5585 sub problems to find dead transitions.
// Phase 1: matrix 5586 rows 2703 cols
[2024-06-01 22:14:12] [INFO ] Computed 401 invariants in 66 ms
[2024-06-01 22:14:12] [INFO ] State equation strengthened by 1794 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2702/8289 variables, and 0 constraints, problems are : Problem set: 0 solved, 5585 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/2703 constraints, ReadFeed: 0/1794 constraints, PredecessorRefiner: 5585/5585 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5585 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2702/8289 variables, and 0 constraints, problems are : Problem set: 0 solved, 5585 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/2703 constraints, ReadFeed: 0/1794 constraints, PredecessorRefiner: 0/5585 constraints, Known Traps: 0/0 constraints]
After SMT, in 88055ms problems are : Problem set: 0 solved, 5585 unsolved
Search for dead transitions found 0 dead transitions in 88102ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2703/3902 places, 5586/3902 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91845 ms. Remains : 2703/3902 places, 5586/3902 transitions.
Support contains 3 out of 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 366 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2024-06-01 22:15:41] [INFO ] Computed 401 invariants in 16 ms
[2024-06-01 22:15:42] [INFO ] Implicit Places using invariants in 953 ms returned []
[2024-06-01 22:15:42] [INFO ] Invariant cache hit.
[2024-06-01 22:15:46] [INFO ] Implicit Places using invariants and state equation in 4407 ms returned []
Implicit Place search using SMT with State Equation took 5361 ms to find 0 implicit places.
Running 3901 sub problems to find dead transitions.
[2024-06-01 22:15:46] [INFO ] Invariant cache hit.
Could not compute solution for formula : ShieldRVt-PT-100B-LTLFireability-00
Could not compute solution for formula : ShieldRVt-PT-100B-LTLFireability-01
FORMULA ShieldRVt-PT-100B-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-LTLFireability-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-LTLFireability-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldRVt-PT-100B-LTLFireability-12
FORMULA ShieldRVt-PT-100B-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717280905890
--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldRVt-PT-100B-LTLFireability-00
ltl formula formula --ltl=/tmp/1400/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.400 real 0.150 user 0.100 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1400/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1400/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1400/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1400/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5012 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~168428 transitions
pnml2lts-mc( 1/ 4): ~4777 levels ~20000 states ~282740 transitions
pnml2lts-mc( 1/ 4): ~8870 levels ~40000 states ~374624 transitions
pnml2lts-mc( 1/ 4): ~16689 levels ~80000 states ~573800 transitions
pnml2lts-mc( 1/ 4): ~32394 levels ~160000 states ~998160 transitions
ltl formula name ShieldRVt-PT-100B-LTLFireability-01
ltl formula formula --ltl=/tmp/1400/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1400/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1400/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1400/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.480 real 0.150 user 0.140 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1400/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5006 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~131620 transitions
pnml2lts-mc( 1/ 4): ~4977 levels ~20000 states ~237428 transitions
pnml2lts-mc( 1/ 4): ~9850 levels ~40000 states ~328432 transitions
pnml2lts-mc( 1/ 4): ~19656 levels ~80000 states ~527372 transitions
pnml2lts-mc( 1/ 4): ~39144 levels ~160000 states ~951784 transitions
ltl formula name ShieldRVt-PT-100B-LTLFireability-02
ltl formula formula --ltl=/tmp/1400/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.480 real 0.160 user 0.120 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1400/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1400/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1400/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1400/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 5004 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5020 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~102!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 397
pnml2lts-mc( 0/ 4): unique transitions count: 3385
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 409
pnml2lts-mc( 0/ 4): - cum. max stack depth: 409
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 409 states 3419 transitions, fanout: 8.359
pnml2lts-mc( 0/ 4): Total exploration time 0.410 sec (0.410 sec minimum, 0.410 sec on average)
pnml2lts-mc( 0/ 4): States per second: 998, Transitions per second: 8339
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 51.6 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLFireability-03
ltl formula formula --ltl=/tmp/1400/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.120 user 0.140 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1400/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1400/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1400/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1400/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5006 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~170!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 660
pnml2lts-mc( 0/ 4): unique transitions count: 6843
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 672
pnml2lts-mc( 0/ 4): - cum. max stack depth: 672
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 672 states 6874 transitions, fanout: 10.229
pnml2lts-mc( 0/ 4): Total exploration time 0.680 sec (0.680 sec minimum, 0.680 sec on average)
pnml2lts-mc( 0/ 4): States per second: 988, Transitions per second: 10109
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 47.7 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLFireability-04
ltl formula formula --ltl=/tmp/1400/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.360 real 0.110 user 0.140 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1400/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1400/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1400/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1400/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5009 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~1441!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 5759
pnml2lts-mc( 0/ 4): unique transitions count: 188813
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 23
pnml2lts-mc( 0/ 4): - claim success count: 5767
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5767
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5767 states 188831 transitions, fanout: 32.743
pnml2lts-mc( 0/ 4): Total exploration time 5.850 sec (5.840 sec minimum, 5.848 sec on average)
pnml2lts-mc( 0/ 4): States per second: 986, Transitions per second: 32279
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 4.5MB, 25.1 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/4.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 4.5MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLFireability-05
ltl formula formula --ltl=/tmp/1400/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.110 user 0.140 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1400/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1400/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1400/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1400/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 5004 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5014 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~56!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 213
pnml2lts-mc( 0/ 4): unique transitions count: 2058
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 224
pnml2lts-mc( 0/ 4): - cum. max stack depth: 224
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 224 states 2089 transitions, fanout: 9.326
pnml2lts-mc( 0/ 4): Total exploration time 0.230 sec (0.230 sec minimum, 0.230 sec on average)
pnml2lts-mc( 0/ 4): States per second: 974, Transitions per second: 9083
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 53.1 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLFireability-06
ltl formula formula --ltl=/tmp/1400/ltl_6_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.360 real 0.110 user 0.150 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1400/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1400/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1400/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1400/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5007 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~203!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 801
pnml2lts-mc( 0/ 4): unique transitions count: 13810
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 810
pnml2lts-mc( 0/ 4): - cum. max stack depth: 810
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 810 states 13830 transitions, fanout: 17.074
pnml2lts-mc( 0/ 4): Total exploration time 0.820 sec (0.820 sec minimum, 0.820 sec on average)
pnml2lts-mc( 0/ 4): States per second: 988, Transitions per second: 16866
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.6MB, 43.0 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.6MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLFireability-07
ltl formula formula --ltl=/tmp/1400/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.360 real 0.110 user 0.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1400/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1400/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1400/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1400/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5011 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~168!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 686
pnml2lts-mc( 0/ 4): unique transitions count: 9556
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 695
pnml2lts-mc( 0/ 4): - cum. max stack depth: 695
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 695 states 9578 transitions, fanout: 13.781
pnml2lts-mc( 0/ 4): Total exploration time 0.710 sec (0.700 sec minimum, 0.702 sec on average)
pnml2lts-mc( 0/ 4): States per second: 979, Transitions per second: 13490
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.4MB, 44.1 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.4MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLFireability-08
ltl formula formula --ltl=/tmp/1400/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.360 real 0.100 user 0.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1400/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1400/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1400/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1400/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 5004 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5018 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.002 sec on average)
pnml2lts-mc( 0/ 4): States per second: 400, Transitions per second: 400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 104.0 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLFireability-09
ltl formula formula --ltl=/tmp/1400/ltl_9_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.360 real 0.110 user 0.140 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1400/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1400/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1400/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1400/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5006 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~332!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1314
pnml2lts-mc( 0/ 4): unique transitions count: 25959
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1324
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1324
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1324 states 25982 transitions, fanout: 19.624
pnml2lts-mc( 0/ 4): Total exploration time 1.340 sec (1.340 sec minimum, 1.340 sec on average)
pnml2lts-mc( 0/ 4): States per second: 988, Transitions per second: 19390
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.0MB, 38.9 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLFireability-10
ltl formula formula --ltl=/tmp/1400/ltl_10_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.360 real 0.130 user 0.120 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1400/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1400/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1400/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1400/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5004 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~207!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 788
pnml2lts-mc( 0/ 4): unique transitions count: 12626
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 800
pnml2lts-mc( 0/ 4): - cum. max stack depth: 800
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 800 states 12661 transitions, fanout: 15.826
pnml2lts-mc( 0/ 4): Total exploration time 0.820 sec (0.820 sec minimum, 0.820 sec on average)
pnml2lts-mc( 0/ 4): States per second: 976, Transitions per second: 15440
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.5MB, 43.0 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.5MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLFireability-11
ltl formula formula --ltl=/tmp/1400/ltl_11_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.340 real 0.120 user 0.130 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1400/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1400/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1400/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1400/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5010 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~255584 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~363176 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~6507!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 27976
pnml2lts-mc( 0/ 4): unique transitions count: 497950
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 7814
pnml2lts-mc( 0/ 4): - claim success count: 27985
pnml2lts-mc( 0/ 4): - cum. max stack depth: 27903
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 27985 states 497970 transitions, fanout: 17.794
pnml2lts-mc( 0/ 4): Total exploration time 32.230 sec (32.230 sec minimum, 32.230 sec on average)
pnml2lts-mc( 0/ 4): States per second: 868, Transitions per second: 15451
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 10.9MB, 23.5 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 1.0%/11.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 10.9MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLFireability-12
ltl formula formula --ltl=/tmp/1400/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.140 user 0.120 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1400/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1400/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1400/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1400/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5020 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2500 levels ~10000 states ~139676 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~544448 transitions
pnml2lts-mc( 3/ 4): ~9993 levels ~40000 states ~861544 transitions
pnml2lts-mc( 3/ 4): ~19812 levels ~80000 states ~1058920 transitions
pnml2lts-mc( 3/ 4): ~39463 levels ~160000 states ~1483556 transitions
ltl formula name ShieldRVt-PT-100B-LTLFireability-13
ltl formula formula --ltl=/tmp/1400/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.430 real 0.120 user 0.130 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1400/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1400/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1400/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1400/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 5004 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5024 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~878!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1486
pnml2lts-mc( 0/ 4): unique states count: 6117
pnml2lts-mc( 0/ 4): unique transitions count: 113417
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 173
pnml2lts-mc( 0/ 4): - claim success count: 6125
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4639
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6125 states 113442 transitions, fanout: 18.521
pnml2lts-mc( 0/ 4): Total exploration time 6.040 sec (6.040 sec minimum, 6.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1014, Transitions per second: 18782
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 3.1MB, 28.9 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.1MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLFireability-14
ltl formula formula --ltl=/tmp/1400/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.360 real 0.130 user 0.130 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1400/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1400/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1400/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1400/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5004 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~99!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 383
pnml2lts-mc( 0/ 4): unique transitions count: 4001
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 392
pnml2lts-mc( 0/ 4): - cum. max stack depth: 392
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 392 states 4023 transitions, fanout: 10.263
pnml2lts-mc( 0/ 4): Total exploration time 0.400 sec (0.400 sec minimum, 0.400 sec on average)
pnml2lts-mc( 0/ 4): States per second: 980, Transitions per second: 10058
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 49.5 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLFireability-15
ltl formula formula --ltl=/tmp/1400/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.350 real 0.130 user 0.120 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1400/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1400/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1400/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1400/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 5004 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5029 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~376!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1473
pnml2lts-mc( 0/ 4): unique transitions count: 47128
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1480
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1480
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1480 states 47162 transitions, fanout: 31.866
pnml2lts-mc( 0/ 4): Total exploration time 1.570 sec (1.560 sec minimum, 1.568 sec on average)
pnml2lts-mc( 0/ 4): States per second: 943, Transitions per second: 30039
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.6MB, 35.2 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.6MB (~256.0MB paged-in)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-100B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVt-PT-100B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683762401052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-100B.tgz
mv ShieldRVt-PT-100B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;