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-171683761100459.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 ShieldPPPs-PT-020B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761100459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 11:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 13 11:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 11:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 13 11:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 349K 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 ShieldPPPs-PT-020B-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-020B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717244836223

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:27:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 12:27:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:27:17] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2024-06-01 12:27:17] [INFO ] Transformed 1363 places.
[2024-06-01 12:27:17] [INFO ] Transformed 1263 transitions.
[2024-06-01 12:27:17] [INFO ] Found NUPN structural information;
[2024-06-01 12:27:17] [INFO ] Parsed PT model containing 1363 places and 1263 transitions and 3486 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPs-PT-020B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-020B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-020B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 1363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1363/1363 places, 1263/1263 transitions.
Discarding 134 places :
Symmetric choice reduction at 0 with 134 rule applications. Total rules 134 place count 1229 transition count 1129
Iterating global reduction 0 with 134 rules applied. Total rules applied 268 place count 1229 transition count 1129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 269 place count 1228 transition count 1128
Iterating global reduction 0 with 1 rules applied. Total rules applied 270 place count 1228 transition count 1128
Applied a total of 270 rules in 613 ms. Remains 1228 /1363 variables (removed 135) and now considering 1128/1263 (removed 135) transitions.
// Phase 1: matrix 1128 rows 1228 cols
[2024-06-01 12:27:18] [INFO ] Computed 221 invariants in 25 ms
[2024-06-01 12:27:19] [INFO ] Implicit Places using invariants in 582 ms returned []
[2024-06-01 12:27:19] [INFO ] Invariant cache hit.
[2024-06-01 12:27:20] [INFO ] Implicit Places using invariants and state equation in 1065 ms returned []
Implicit Place search using SMT with State Equation took 1673 ms to find 0 implicit places.
Running 1127 sub problems to find dead transitions.
[2024-06-01 12:27:20] [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 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(timeout
s500 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
SMT process timed out in 30327ms, After SMT, problems are : Problem set: 0 solved, 1127 unsolved
Search for dead transitions found 0 dead transitions in 30354ms
Starting structural reductions in LTL mode, iteration 1 : 1228/1363 places, 1128/1263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32682 ms. Remains : 1228/1363 places, 1128/1263 transitions.
Support contains 45 out of 1228 places after structural reductions.
[2024-06-01 12:27:50] [INFO ] Flatten gal took : 108 ms
[2024-06-01 12:27:50] [INFO ] Flatten gal took : 57 ms
[2024-06-01 12:27:51] [INFO ] Input system was already deterministic with 1128 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 25815 steps (6 resets) in 1284 ms. (20 steps per ms) remains 0/24 properties
Computed a total of 242 stabilizing places and 242 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(X((G(!p0)||(!p0&&(G(p0)||F(p1)))))))'
Support contains 4 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1223 transition count 1123
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1223 transition count 1123
Applied a total of 10 rules in 56 ms. Remains 1223 /1228 variables (removed 5) and now considering 1123/1128 (removed 5) transitions.
// Phase 1: matrix 1123 rows 1223 cols
[2024-06-01 12:27:51] [INFO ] Computed 221 invariants in 17 ms
[2024-06-01 12:27:52] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-06-01 12:27:52] [INFO ] Invariant cache hit.
[2024-06-01 12:27:53] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1306 ms to find 0 implicit places.
Running 1122 sub problems to find dead transitions.
[2024-06-01 12:27:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
SMT process timed out in 30230ms, After SMT, problems are : Problem set: 0 solved, 1122 unsolved
Search for dead transitions found 0 dead transitions in 30242ms
Starting structural reductions in LTL mode, iteration 1 : 1223/1228 places, 1123/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31610 ms. Remains : 1223/1228 places, 1123/1128 transitions.
Stuttering acceptance computed with spot in 331 ms :[true, (NOT p1), p0, (AND (NOT p1) p0), p0, p0]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA ShieldPPPs-PT-020B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-00 finished in 32019 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(!(p0 U p1))||G(p0)))'
Support contains 4 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1223 transition count 1123
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1223 transition count 1123
Applied a total of 10 rules in 87 ms. Remains 1223 /1228 variables (removed 5) and now considering 1123/1128 (removed 5) transitions.
// Phase 1: matrix 1123 rows 1223 cols
[2024-06-01 12:28:23] [INFO ] Computed 221 invariants in 5 ms
[2024-06-01 12:28:24] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-06-01 12:28:24] [INFO ] Invariant cache hit.
[2024-06-01 12:28:25] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
Running 1122 sub problems to find dead transitions.
[2024-06-01 12:28:25] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
SMT process timed out in 30227ms, After SMT, problems are : Problem set: 0 solved, 1122 unsolved
Search for dead transitions found 0 dead transitions in 30238ms
Starting structural reductions in LTL mode, iteration 1 : 1223/1228 places, 1123/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31614 ms. Remains : 1223/1228 places, 1123/1128 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 910 steps with 0 reset in 13 ms.
FORMULA ShieldPPPs-PT-020B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-01 finished in 31818 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((p0||(X(p1) U (G((X(p1)||G(!p2)))||(!p0&&(X(p1)||G(!p2))))))))'
Support contains 4 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1222 transition count 1122
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1222 transition count 1122
Applied a total of 12 rules in 58 ms. Remains 1222 /1228 variables (removed 6) and now considering 1122/1128 (removed 6) transitions.
// Phase 1: matrix 1122 rows 1222 cols
[2024-06-01 12:28:55] [INFO ] Computed 221 invariants in 11 ms
[2024-06-01 12:28:56] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-06-01 12:28:56] [INFO ] Invariant cache hit.
[2024-06-01 12:28:56] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1229 ms to find 0 implicit places.
Running 1121 sub problems to find dead transitions.
[2024-06-01 12:28:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1121 unsolved
SMT process timed out in 30182ms, After SMT, problems are : Problem set: 0 solved, 1121 unsolved
Search for dead transitions found 0 dead transitions in 30192ms
Starting structural reductions in LTL mode, iteration 1 : 1222/1228 places, 1122/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31482 ms. Remains : 1222/1228 places, 1122/1128 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0) p2), (AND p2 (NOT p1)), p2]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 420 ms.
Product exploration explored 100000 steps with 33333 reset in 286 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 14 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-020B-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-03 finished in 32462 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((G((F(p0)&&F(G(!p1))))||G((p2 U p3)))))'
Support contains 5 out of 1228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 1227 transition count 986
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 1086 transition count 986
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 282 place count 1086 transition count 886
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 482 place count 986 transition count 886
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 487 place count 981 transition count 881
Iterating global reduction 2 with 5 rules applied. Total rules applied 492 place count 981 transition count 881
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 492 place count 981 transition count 879
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 496 place count 979 transition count 879
Performed 351 Post agglomeration using F-continuation condition.Transition count delta: 351
Deduced a syphon composed of 351 places in 1 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 2 with 702 rules applied. Total rules applied 1198 place count 628 transition count 528
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1200 place count 626 transition count 526
Applied a total of 1200 rules in 241 ms. Remains 626 /1228 variables (removed 602) and now considering 526/1128 (removed 602) transitions.
// Phase 1: matrix 526 rows 626 cols
[2024-06-01 12:29:28] [INFO ] Computed 221 invariants in 4 ms
[2024-06-01 12:29:28] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-06-01 12:29:28] [INFO ] Invariant cache hit.
[2024-06-01 12:29:29] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2024-06-01 12:29:29] [INFO ] Redundant transitions in 28 ms returned []
Running 522 sub problems to find dead transitions.
[2024-06-01 12:29:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:29:37] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 6 ms to minimize.
[2024-06-01 12:29:37] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 2 ms to minimize.
[2024-06-01 12:29:37] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:29:37] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:29:37] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:29:38] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:29:38] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:29:38] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:29:38] [INFO ] Deduced a trap composed of 97 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:29:38] [INFO ] Deduced a trap composed of 111 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:29:39] [INFO ] Deduced a trap composed of 129 places in 74 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 11/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 2/626 variables, 10/232 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:29:52] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 8 ms to minimize.
[2024-06-01 12:29:52] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:29:52] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:29:54] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:29:55] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:29:58] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1152 variables, and 238 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 14/225 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:30:03] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 10 ms to minimize.
[2024-06-01 12:30:03] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:30:03] [INFO ] Deduced a trap composed of 84 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:30:03] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:30:03] [INFO ] Deduced a trap composed of 83 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:30:03] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:30:04] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:30:04] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:30:04] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:30:04] [INFO ] Deduced a trap composed of 101 places in 70 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 10/235 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:30:09] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (OVERLAPS) 2/626 variables, 10/246 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 8 (OVERLAPS) 526/1152 variables, 626/875 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1152 variables, 522/1397 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 1397 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 28/28 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in SI_LTL mode, iteration 1 : 626/1228 places, 526/1128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61134 ms. Remains : 626/1228 places, 526/1128 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-04
Product exploration explored 100000 steps with 136 reset in 614 ms.
Product exploration explored 100000 steps with 138 reset in 742 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/626 stabilizing places and 4/526 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p3 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (OR (AND p3 (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND (NOT p3) (NOT p1) p2))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p3) p1 p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (OR (AND p3 (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) p1 p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (OR (AND (NOT p0) p3) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (OR (AND p3 p1) (AND p1 p2))), (X (NOT (OR (AND p3 p1) (AND p1 p2)))), (X (AND (NOT p3) p1 (NOT p2))), (X (NOT (AND (NOT p3) p1 (NOT p2)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (OR (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) p2))))), (X (X (OR (AND p3 p1) (AND p1 p2)))), (X (X (NOT (OR (AND p3 p1) (AND p1 p2))))), (X (X (AND (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2)))))]
Knowledge based reduction with 18 factoid took 883 ms. Reduced automaton from 5 states, 20 edges and 4 AP (stutter insensitive) to 5 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
RANDOM walk for 40000 steps (28 resets) in 670 ms. (59 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 4/4 properties
[2024-06-01 12:30:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 37/42 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/46 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 52/98 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 91/189 variables, 37/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 16/205 variables, 13/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 16/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 8/213 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 135/348 variables, 64/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/348 variables, 9/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/348 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 16/364 variables, 14/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/364 variables, 16/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/364 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 16/380 variables, 8/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/380 variables, 8/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/380 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 160/540 variables, 79/332 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/540 variables, 15/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/540 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 20/560 variables, 16/363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/560 variables, 20/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/560 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 12/572 variables, 6/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/572 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/572 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 174/746 variables, 90/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/746 variables, 15/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/746 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 16/762 variables, 17/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/762 variables, 16/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/762 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 8/770 variables, 4/533 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/770 variables, 8/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/770 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 135/905 variables, 72/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/905 variables, 17/630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/905 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 15/920 variables, 14/644 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/920 variables, 15/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/920 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 2/922 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/922 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 87/1009 variables, 46/706 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1009 variables, 8/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1009 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 9/1018 variables, 11/725 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1018 variables, 9/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1018 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (OVERLAPS) 6/1024 variables, 3/737 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1024 variables, 6/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1024 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (OVERLAPS) 68/1092 variables, 34/777 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1092 variables, 10/787 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1092 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (OVERLAPS) 6/1098 variables, 4/791 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1098 variables, 6/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1098 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (OVERLAPS) 41/1139 variables, 24/821 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1139 variables, 4/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1139 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (OVERLAPS) 4/1143 variables, 6/831 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1143 variables, 4/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1143 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (OVERLAPS) 2/1145 variables, 1/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1145 variables, 2/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1145 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (OVERLAPS) 7/1152 variables, 6/844 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1152 variables, 3/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1152 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (OVERLAPS) 0/1152 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1152/1152 variables, and 847 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1752 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 37/42 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 4/46 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 52/98 variables, 46/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 91/189 variables, 37/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 16/205 variables, 13/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 16/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 8/213 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/213 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 135/348 variables, 64/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/348 variables, 9/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/348 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 16/364 variables, 14/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/364 variables, 16/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/364 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 16/380 variables, 8/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/380 variables, 8/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/380 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 160/540 variables, 79/338 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/540 variables, 15/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/540 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/540 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 20/560 variables, 16/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/560 variables, 20/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/560 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 12/572 variables, 6/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/572 variables, 2/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/572 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 174/746 variables, 90/488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/746 variables, 15/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/746 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 16/762 variables, 17/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/762 variables, 16/536 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/762 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 8/770 variables, 4/540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/770 variables, 8/548 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/770 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 135/905 variables, 72/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/905 variables, 17/637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/905 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 15/920 variables, 14/651 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/920 variables, 15/666 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/920 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 2/922 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/922 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (OVERLAPS) 87/1009 variables, 46/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1009 variables, 8/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1009 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (OVERLAPS) 9/1018 variables, 11/732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1018 variables, 9/741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1018 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (OVERLAPS) 6/1024 variables, 3/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1024 variables, 6/750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1024 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (OVERLAPS) 68/1092 variables, 34/784 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1092 variables, 10/794 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 6 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
At refinement iteration 65 (INCLUDED_ONLY) 0/1092 variables, 4/798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1092 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (OVERLAPS) 6/1098 variables, 4/802 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1098 variables, 6/808 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1098 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (OVERLAPS) 41/1139 variables, 24/832 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1139 variables, 4/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:30:36] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:30:36] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 72 (INCLUDED_ONLY) 0/1139 variables, 2/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1139 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (OVERLAPS) 4/1143 variables, 6/844 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1143 variables, 4/848 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1143 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (OVERLAPS) 2/1145 variables, 1/849 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1145 variables, 2/851 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1145 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (OVERLAPS) 7/1152 variables, 6/857 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1152 variables, 3/860 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:30:36] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 3 ms to minimize.
At refinement iteration 82 (INCLUDED_ONLY) 0/1152 variables, 1/861 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1152 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:30:37] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:30:37] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:30:37] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:30:37] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 84 (OVERLAPS) 0/1152 variables, 4/865 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1152 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 86 (OVERLAPS) 0/1152 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 865 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3194 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 14/14 constraints]
After SMT, in 4955ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 3118 ms.
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 526/526 transitions.
Partial Free-agglomeration rule applied 118 times.
Drop transitions (Partial Free agglomeration) removed 118 transitions
Iterating global reduction 0 with 118 rules applied. Total rules applied 118 place count 626 transition count 526
Applied a total of 118 rules in 68 ms. Remains 626 /626 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 626/626 places, 526/526 transitions.
RANDOM walk for 40000 steps (10 resets) in 832 ms. (48 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 132958 steps, run timeout after 3011 ms. (steps per millisecond=44 ) properties seen :0 out of 4
Probabilistic random walk after 132958 steps, saw 128484 distinct states, run finished after 3017 ms. (steps per millisecond=44 ) properties seen :0
// Phase 1: matrix 526 rows 626 cols
[2024-06-01 12:30:44] [INFO ] Computed 221 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 35/40 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/44 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/46 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 60/106 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 93/199 variables, 43/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 10/209 variables, 10/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 10/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/209 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 8/217 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/217 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 143/360 variables, 68/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/360 variables, 11/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/360 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 12/372 variables, 12/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/372 variables, 12/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 16/388 variables, 8/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/388 variables, 8/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/388 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 166/554 variables, 87/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/554 variables, 19/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/554 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 12/566 variables, 12/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/566 variables, 12/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/566 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 12/578 variables, 6/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/578 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/578 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 180/758 variables, 94/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/758 variables, 17/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/758 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 12/770 variables, 15/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/770 variables, 12/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/770 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 8/778 variables, 4/533 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/778 variables, 8/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/778 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 135/913 variables, 78/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/913 variables, 20/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/913 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 9/922 variables, 11/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/922 variables, 9/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/922 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 2/924 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/924 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 89/1013 variables, 46/706 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1013 variables, 8/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1013 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 9/1022 variables, 11/725 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1022 variables, 9/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1022 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 6/1028 variables, 3/737 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1028 variables, 6/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1028 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 68/1096 variables, 38/781 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1096 variables, 12/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1096 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (OVERLAPS) 2/1098 variables, 2/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1098 variables, 2/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1098 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (OVERLAPS) 41/1139 variables, 24/821 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1139 variables, 4/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1139 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (OVERLAPS) 4/1143 variables, 6/831 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1143 variables, 4/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1143 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (OVERLAPS) 2/1145 variables, 1/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1145 variables, 2/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1145 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (OVERLAPS) 7/1152 variables, 6/844 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1152 variables, 3/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1152 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (OVERLAPS) 0/1152 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1152/1152 variables, and 847 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1361 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 35/40 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/44 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/46 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 60/106 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 93/199 variables, 43/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 10/209 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/209 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/209 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 8/217 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/217 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 143/360 variables, 68/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/360 variables, 11/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/360 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 12/372 variables, 12/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/372 variables, 12/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/372 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/372 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:30:46] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/372 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/372 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 16/388 variables, 8/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/388 variables, 8/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/388 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 166/554 variables, 87/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/554 variables, 19/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/554 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 12/566 variables, 12/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/566 variables, 12/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:30:46] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 5 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/566 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/566 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 12/578 variables, 6/397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/578 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/578 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 180/758 variables, 94/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/758 variables, 17/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/758 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 12/770 variables, 15/525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/770 variables, 12/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/770 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 8/778 variables, 4/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/778 variables, 8/549 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/778 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 135/913 variables, 78/627 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/913 variables, 20/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:30:46] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 51 (INCLUDED_ONLY) 0/913 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/913 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 9/922 variables, 11/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/922 variables, 9/668 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/922 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (OVERLAPS) 2/924 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/924 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 89/1013 variables, 46/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1013 variables, 8/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1013 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 9/1022 variables, 11/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1022 variables, 9/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1022 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (OVERLAPS) 6/1028 variables, 3/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1028 variables, 6/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1028 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (OVERLAPS) 68/1096 variables, 38/790 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1096 variables, 12/802 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:30:47] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 69 (INCLUDED_ONLY) 0/1096 variables, 1/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1096 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (OVERLAPS) 2/1098 variables, 2/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1098 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1098 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (OVERLAPS) 41/1139 variables, 24/831 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1139 variables, 4/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:30:47] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 76 (INCLUDED_ONLY) 0/1139 variables, 1/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:30:47] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 77 (INCLUDED_ONLY) 0/1139 variables, 1/837 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:30:47] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:30:47] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:30:47] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:30:48] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:30:48] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 5 ms to minimize.
[2024-06-01 12:30:48] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 4 ms to minimize.
[2024-06-01 12:30:48] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:30:48] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:30:48] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
At refinement iteration 78 (INCLUDED_ONLY) 0/1139 variables, 9/846 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1139 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (OVERLAPS) 4/1143 variables, 6/852 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1143 variables, 4/856 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1143 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (OVERLAPS) 2/1145 variables, 1/857 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1145 variables, 2/859 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1145 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 86 (OVERLAPS) 7/1152 variables, 6/865 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1152 variables, 3/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1152 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 89 (OVERLAPS) 0/1152 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 868 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3270 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 17/17 constraints]
After SMT, in 4663ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1396 ms.
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 526/526 transitions.
Applied a total of 0 rules in 32 ms. Remains 626 /626 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 626/626 places, 526/526 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 526/526 transitions.
Applied a total of 0 rules in 35 ms. Remains 626 /626 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2024-06-01 12:30:50] [INFO ] Invariant cache hit.
[2024-06-01 12:30:50] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-06-01 12:30:50] [INFO ] Invariant cache hit.
[2024-06-01 12:30:51] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
[2024-06-01 12:30:51] [INFO ] Redundant transitions in 10 ms returned []
Running 522 sub problems to find dead transitions.
[2024-06-01 12:30:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:30:58] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:30:58] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:30:58] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:30:58] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:30:58] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:30:58] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:30:58] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:30:59] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:30:59] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:30:59] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:30:59] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-06-01 12:30:59] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:31:00] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:31:00] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:31:00] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:31:00] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:31:01] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:31:01] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 18/230 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:31:16] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1152 variables, and 232 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 211/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:31:24] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:31:30] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:31:31] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:31:35] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:31:36] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:31:37] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/624 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:31:40] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/624 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/624 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 8 (OVERLAPS) 2/626 variables, 9/248 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:31:50] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:31:50] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:31:50] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
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 626/1152 variables, and 251 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 0/522 constraints, Known Traps: 30/30 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61048 ms. Remains : 626/626 places, 526/526 transitions.
Knowledge obtained : [(AND (NOT p0) p3 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (OR (AND p3 (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND (NOT p3) (NOT p1) p2))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p3) p1 p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (OR (AND p3 (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) p1 p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (OR (AND (NOT p0) p3) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (OR (AND p3 p1) (AND p1 p2))), (X (NOT (OR (AND p3 p1) (AND p1 p2)))), (X (AND (NOT p3) p1 (NOT p2))), (X (NOT (AND (NOT p3) p1 (NOT p2)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (OR (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) p2))))), (X (X (OR (AND p3 p1) (AND p1 p2)))), (X (X (NOT (OR (AND p3 p1) (AND p1 p2))))), (X (X (AND (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (F (NOT (AND (OR (NOT p2) p1) (OR (NOT p3) p1)))), (F p2), (F (NOT p3)), (F (NOT p1)), (F (NOT (OR p2 p3 (NOT p1)))), (F (NOT (OR (AND p2 p1) (AND p3 p1)))), (F (NOT (OR p0 p2 p3))), (F p0)]
Knowledge based reduction with 18 factoid took 1167 ms. Reduced automaton from 5 states, 20 edges and 4 AP (stutter insensitive) to 5 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 265 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 526/526 transitions.
Applied a total of 0 rules in 20 ms. Remains 626 /626 variables (removed 0) and now considering 526/526 (removed 0) transitions.
// Phase 1: matrix 526 rows 626 cols
[2024-06-01 12:31:53] [INFO ] Computed 221 invariants in 1 ms
[2024-06-01 12:31:53] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-06-01 12:31:53] [INFO ] Invariant cache hit.
[2024-06-01 12:31:53] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
[2024-06-01 12:31:53] [INFO ] Redundant transitions in 28 ms returned []
Running 522 sub problems to find dead transitions.
[2024-06-01 12:31:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:32:01] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:32:01] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:32:02] [INFO ] Deduced a trap composed of 42 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:32:02] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:32:02] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:32:02] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:32:02] [INFO ] Deduced a trap composed of 68 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:32:02] [INFO ] Deduced a trap composed of 81 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:32:02] [INFO ] Deduced a trap composed of 97 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:32:03] [INFO ] Deduced a trap composed of 111 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:32:03] [INFO ] Deduced a trap composed of 129 places in 64 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 11/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 2/626 variables, 10/232 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:32:16] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:32:16] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:32:16] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:32:19] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:32:19] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:32:22] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
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 626/1152 variables, and 238 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 14/225 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:32:28] [INFO ] Deduced a trap composed of 82 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:32:28] [INFO ] Deduced a trap composed of 84 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:32:28] [INFO ] Deduced a trap composed of 84 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:32:28] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:32:28] [INFO ] Deduced a trap composed of 83 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:32:28] [INFO ] Deduced a trap composed of 80 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:32:28] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:32:28] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:32:28] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:32:29] [INFO ] Deduced a trap composed of 101 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 10/235 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:32:34] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (OVERLAPS) 2/626 variables, 10/246 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 8 (OVERLAPS) 526/1152 variables, 626/875 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1152 variables, 522/1397 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 1397 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 28/28 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60850 ms. Remains : 626/626 places, 526/526 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/626 stabilizing places and 4/526 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (OR (AND p2 (NOT p1)) (AND p3 (NOT p1))))), (X (NOT p0)), (X p1), (X (NOT (AND p2 (NOT p3) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p3 (NOT p1)))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p2 (NOT p3) p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p2) (NOT p3) p1)), (X (NOT (AND (NOT p2) (NOT p3) p1))), (X (OR (AND p2 p1) (AND p3 p1))), (X (NOT (OR (AND p2 p1) (AND p3 p1)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p3) p1))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (OR (AND p2 p1) (AND p3 p1)))), (X (X (NOT (OR (AND p2 p1) (AND p3 p1)))))]
Knowledge based reduction with 18 factoid took 905 ms. Reduced automaton from 5 states, 20 edges and 4 AP (stutter insensitive) to 5 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
RANDOM walk for 40000 steps (28 resets) in 463 ms. (86 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
[2024-06-01 12:32:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 37/42 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/46 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 52/98 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 91/189 variables, 37/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 16/205 variables, 13/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 16/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 8/213 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 135/348 variables, 64/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/348 variables, 9/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/348 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 16/364 variables, 14/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/364 variables, 16/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/364 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 16/380 variables, 8/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/380 variables, 8/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/380 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 160/540 variables, 79/332 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/540 variables, 15/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/540 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 20/560 variables, 16/363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/560 variables, 20/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/560 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 12/572 variables, 6/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/572 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/572 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 174/746 variables, 90/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/746 variables, 15/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/746 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 16/762 variables, 17/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/762 variables, 16/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/762 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 8/770 variables, 4/533 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/770 variables, 8/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/770 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 135/905 variables, 72/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/905 variables, 17/630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/905 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 15/920 variables, 14/644 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/920 variables, 15/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/920 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 2/922 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/922 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 87/1009 variables, 46/706 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1009 variables, 8/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1009 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 9/1018 variables, 11/725 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1018 variables, 9/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1018 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (OVERLAPS) 6/1024 variables, 3/737 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1024 variables, 6/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1024 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (OVERLAPS) 68/1092 variables, 34/777 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1092 variables, 10/787 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1092 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (OVERLAPS) 6/1098 variables, 4/791 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1098 variables, 6/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1098 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (OVERLAPS) 41/1139 variables, 24/821 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1139 variables, 4/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1139 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (OVERLAPS) 4/1143 variables, 6/831 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1143 variables, 4/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1143 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (OVERLAPS) 2/1145 variables, 1/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1145 variables, 2/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1145 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (OVERLAPS) 7/1152 variables, 6/844 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1152 variables, 3/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1152 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (OVERLAPS) 0/1152 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1152/1152 variables, and 847 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1400 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 37/42 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:32:56] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 4/46 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 52/98 variables, 46/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 91/189 variables, 37/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:32:56] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 16/205 variables, 13/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 16/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 8/213 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/213 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 135/348 variables, 64/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/348 variables, 9/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/348 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 16/364 variables, 14/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/364 variables, 16/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/364 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 16/380 variables, 8/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/380 variables, 8/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/380 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 160/540 variables, 79/338 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/540 variables, 15/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/540 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 20/560 variables, 16/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/560 variables, 20/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/560 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 12/572 variables, 6/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/572 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/572 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 174/746 variables, 90/487 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/746 variables, 15/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/746 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 16/762 variables, 17/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/762 variables, 16/535 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/762 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 8/770 variables, 4/539 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/770 variables, 8/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/770 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 135/905 variables, 72/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/905 variables, 17/636 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:32:57] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/905 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:32:57] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/905 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/905 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 15/920 variables, 14/652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/920 variables, 15/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/920 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 2/922 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/922 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 87/1009 variables, 46/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1009 variables, 8/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1009 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 9/1018 variables, 11/733 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1018 variables, 9/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:32:58] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:32:58] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 60 (INCLUDED_ONLY) 0/1018 variables, 2/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1018 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (OVERLAPS) 6/1024 variables, 3/747 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1024 variables, 6/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:32:58] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
At refinement iteration 64 (INCLUDED_ONLY) 0/1024 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1024 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (OVERLAPS) 68/1092 variables, 34/788 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1092 variables, 10/798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:32:58] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 68 (INCLUDED_ONLY) 0/1092 variables, 1/799 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1092 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (OVERLAPS) 6/1098 variables, 4/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1098 variables, 6/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1098 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (OVERLAPS) 41/1139 variables, 24/833 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1139 variables, 4/837 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1139 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (OVERLAPS) 4/1143 variables, 6/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1143 variables, 4/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:32:59] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
At refinement iteration 78 (INCLUDED_ONLY) 0/1143 variables, 1/848 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:32:59] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 79 (INCLUDED_ONLY) 0/1143 variables, 1/849 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:32:59] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
At refinement iteration 80 (INCLUDED_ONLY) 0/1143 variables, 1/850 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1143 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (OVERLAPS) 2/1145 variables, 1/851 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1145 variables, 2/853 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1145 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (OVERLAPS) 7/1152 variables, 6/859 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1152 variables, 3/862 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:32:59] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:32:59] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:32:59] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 87 (INCLUDED_ONLY) 0/1152 variables, 3/865 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1152 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 89 (OVERLAPS) 0/1152 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 865 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3535 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 14/14 constraints]
After SMT, in 4944ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1825 ms.
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 526/526 transitions.
Partial Free-agglomeration rule applied 118 times.
Drop transitions (Partial Free agglomeration) removed 118 transitions
Iterating global reduction 0 with 118 rules applied. Total rules applied 118 place count 626 transition count 526
Applied a total of 118 rules in 26 ms. Remains 626 /626 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 626/626 places, 526/526 transitions.
RANDOM walk for 40000 steps (9 resets) in 608 ms. (65 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 128879 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 4
Probabilistic random walk after 128879 steps, saw 124502 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
// Phase 1: matrix 526 rows 626 cols
[2024-06-01 12:33:05] [INFO ] Computed 221 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 35/40 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/44 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/46 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 60/106 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 93/199 variables, 43/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 10/209 variables, 10/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 10/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/209 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 8/217 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/217 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 143/360 variables, 68/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/360 variables, 11/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/360 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 12/372 variables, 12/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/372 variables, 12/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 16/388 variables, 8/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/388 variables, 8/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/388 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 166/554 variables, 87/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/554 variables, 19/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/554 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 12/566 variables, 12/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/566 variables, 12/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/566 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 12/578 variables, 6/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/578 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/578 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 180/758 variables, 94/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/758 variables, 17/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/758 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 12/770 variables, 15/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/770 variables, 12/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/770 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 8/778 variables, 4/533 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/778 variables, 8/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/778 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 135/913 variables, 78/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/913 variables, 20/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/913 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 9/922 variables, 11/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/922 variables, 9/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/922 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 2/924 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/924 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 89/1013 variables, 46/706 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1013 variables, 8/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1013 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 9/1022 variables, 11/725 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1022 variables, 9/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1022 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 6/1028 variables, 3/737 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1028 variables, 6/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1028 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 68/1096 variables, 38/781 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1096 variables, 12/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1096 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (OVERLAPS) 2/1098 variables, 2/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1098 variables, 2/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1098 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (OVERLAPS) 41/1139 variables, 24/821 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1139 variables, 4/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1139 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (OVERLAPS) 4/1143 variables, 6/831 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1143 variables, 4/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1143 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (OVERLAPS) 2/1145 variables, 1/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1145 variables, 2/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1145 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (OVERLAPS) 7/1152 variables, 6/844 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1152 variables, 3/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1152 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (OVERLAPS) 0/1152 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1152/1152 variables, and 847 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1270 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 35/40 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/44 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/46 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 60/106 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 93/199 variables, 43/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:33:07] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 10/209 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/209 variables, 10/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/209 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 8/217 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/217 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 143/360 variables, 68/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/360 variables, 11/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/360 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 12/372 variables, 12/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/372 variables, 12/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:33:07] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/372 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:33:07] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/372 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/372 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 16/388 variables, 8/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/388 variables, 8/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/388 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 166/554 variables, 87/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/554 variables, 19/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/554 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 12/566 variables, 12/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/566 variables, 12/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/566 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 12/578 variables, 6/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/578 variables, 2/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/578 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 180/758 variables, 94/492 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/758 variables, 17/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/758 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 12/770 variables, 15/524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/770 variables, 12/536 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/770 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 8/778 variables, 4/540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/778 variables, 8/548 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/778 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 135/913 variables, 78/626 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/913 variables, 20/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:33:07] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/913 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/913 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 9/922 variables, 11/658 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/922 variables, 9/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/922 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 2/924 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/924 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (OVERLAPS) 89/1013 variables, 46/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1013 variables, 8/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1013 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (OVERLAPS) 9/1022 variables, 11/733 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1022 variables, 9/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1022 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (OVERLAPS) 6/1028 variables, 3/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1028 variables, 6/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1028 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (OVERLAPS) 68/1096 variables, 38/789 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1096 variables, 12/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1096 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (OVERLAPS) 2/1098 variables, 2/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1098 variables, 2/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1098 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (OVERLAPS) 41/1139 variables, 24/829 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1139 variables, 4/833 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1139 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (OVERLAPS) 4/1143 variables, 6/839 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1143 variables, 4/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1143 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (OVERLAPS) 2/1145 variables, 1/844 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1145 variables, 2/846 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1145 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (OVERLAPS) 7/1152 variables, 6/852 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1152 variables, 3/855 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:33:08] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
At refinement iteration 83 (INCLUDED_ONLY) 0/1152 variables, 1/856 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1152 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (OVERLAPS) 0/1152 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 856 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2310 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
After SMT, in 3604ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 963 ms.
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 526/526 transitions.
Applied a total of 0 rules in 12 ms. Remains 626 /626 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 626/626 places, 526/526 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 526/526 transitions.
Applied a total of 0 rules in 21 ms. Remains 626 /626 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2024-06-01 12:33:10] [INFO ] Invariant cache hit.
[2024-06-01 12:33:10] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-06-01 12:33:10] [INFO ] Invariant cache hit.
[2024-06-01 12:33:11] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
[2024-06-01 12:33:11] [INFO ] Redundant transitions in 3 ms returned []
Running 522 sub problems to find dead transitions.
[2024-06-01 12:33:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:33:17] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:33:17] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:33:17] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:33:18] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:33:18] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:33:18] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:33:18] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:33:18] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:33:18] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:33:19] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 3 ms to minimize.
[2024-06-01 12:33:19] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-06-01 12:33:19] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:33:19] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:33:20] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:33:20] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:33:20] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:33:20] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:33:20] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 18/230 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:33:26] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:33:36] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:33:41] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1152 variables, and 233 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 211/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 21/233 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:33:44] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:33:49] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:33:49] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:33:54] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:33:56] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/624 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/624 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (OVERLAPS) 2/626 variables, 9/247 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:34:03] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:34:04] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:34:04] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:34:05] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:34:06] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:34:06] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:34:06] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:34:06] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:34:07] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:34:08] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/626 variables, 10/257 constraints. Problems are: Problem set: 0 solved, 522 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 Int declared 626/1152 variables, and 257 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 0/522 constraints, Known Traps: 36/36 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60945 ms. Remains : 626/626 places, 526/526 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (OR (AND p2 (NOT p1)) (AND p3 (NOT p1))))), (X (NOT p0)), (X p1), (X (NOT (AND p2 (NOT p3) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p3 (NOT p1)))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p2 (NOT p3) p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p2) (NOT p3) p1)), (X (NOT (AND (NOT p2) (NOT p3) p1))), (X (OR (AND p2 p1) (AND p3 p1))), (X (NOT (OR (AND p2 p1) (AND p3 p1)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p3) p1))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (OR (AND p2 p1) (AND p3 p1)))), (X (X (NOT (OR (AND p2 p1) (AND p3 p1))))), (F (NOT (OR (AND p2 (NOT p0)) (AND p3 (NOT p0))))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT p1)), (F (NOT (OR (AND p1 p2) (AND p1 p3)))), (F p2), (F (NOT (AND (OR p1 (NOT p2)) (OR p1 (NOT p3))))), (F (NOT p3)), (F p0), (F (NOT (OR p2 p3 p0)))]
Knowledge based reduction with 18 factoid took 1266 ms. Reduced automaton from 5 states, 20 edges and 4 AP (stutter insensitive) to 5 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Product exploration explored 100000 steps with 153 reset in 594 ms.
Product exploration explored 100000 steps with 155 reset in 710 ms.
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 526/526 transitions.
Applied a total of 0 rules in 13 ms. Remains 626 /626 variables (removed 0) and now considering 526/526 (removed 0) transitions.
// Phase 1: matrix 526 rows 626 cols
[2024-06-01 12:34:14] [INFO ] Computed 221 invariants in 2 ms
[2024-06-01 12:34:14] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-06-01 12:34:14] [INFO ] Invariant cache hit.
[2024-06-01 12:34:15] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
[2024-06-01 12:34:15] [INFO ] Redundant transitions in 3 ms returned []
Running 522 sub problems to find dead transitions.
[2024-06-01 12:34:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:34:22] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:34:22] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:34:23] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:34:23] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:34:23] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:34:23] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:34:23] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:34:23] [INFO ] Deduced a trap composed of 81 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:34:24] [INFO ] Deduced a trap composed of 97 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:34:24] [INFO ] Deduced a trap composed of 111 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:34:24] [INFO ] Deduced a trap composed of 129 places in 60 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 11/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 2/626 variables, 10/232 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:34:37] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:34:37] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:34:37] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:34:40] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:34:40] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:34:43] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1152 variables, and 238 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 14/225 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:34:49] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:34:49] [INFO ] Deduced a trap composed of 84 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:34:49] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:34:49] [INFO ] Deduced a trap composed of 83 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:34:49] [INFO ] Deduced a trap composed of 83 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:34:49] [INFO ] Deduced a trap composed of 80 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:34:49] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:34:49] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:34:50] [INFO ] Deduced a trap composed of 84 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:34:50] [INFO ] Deduced a trap composed of 101 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 10/235 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:34:55] [INFO ] Deduced a trap composed of 67 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (OVERLAPS) 2/626 variables, 10/246 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 8 (OVERLAPS) 526/1152 variables, 626/875 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1152 variables, 522/1397 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 1397 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 28/28 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60811 ms. Remains : 626/626 places, 526/526 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-04 finished in 347109 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(X(G(p0)))&&F((X(p2)&&p1))))'
Support contains 4 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1222 transition count 1122
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1222 transition count 1122
Applied a total of 12 rules in 80 ms. Remains 1222 /1228 variables (removed 6) and now considering 1122/1128 (removed 6) transitions.
// Phase 1: matrix 1122 rows 1222 cols
[2024-06-01 12:35:15] [INFO ] Computed 221 invariants in 4 ms
[2024-06-01 12:35:15] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-06-01 12:35:15] [INFO ] Invariant cache hit.
[2024-06-01 12:35:16] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1211 ms to find 0 implicit places.
Running 1121 sub problems to find dead transitions.
[2024-06-01 12:35:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1121 unsolved
SMT process timed out in 30157ms, After SMT, problems are : Problem set: 0 solved, 1121 unsolved
Search for dead transitions found 0 dead transitions in 30166ms
Starting structural reductions in LTL mode, iteration 1 : 1222/1228 places, 1122/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31460 ms. Remains : 1222/1228 places, 1122/1128 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 51 steps with 1 reset in 1 ms.
FORMULA ShieldPPPs-PT-020B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-05 finished in 31691 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(G(p0)))'
Support contains 2 out of 1228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 1227 transition count 986
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 1086 transition count 986
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 282 place count 1086 transition count 887
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 480 place count 987 transition count 887
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 486 place count 981 transition count 881
Iterating global reduction 2 with 6 rules applied. Total rules applied 492 place count 981 transition count 881
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 492 place count 981 transition count 878
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 498 place count 978 transition count 878
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 0 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 2 with 708 rules applied. Total rules applied 1206 place count 624 transition count 524
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1208 place count 622 transition count 522
Applied a total of 1208 rules in 185 ms. Remains 622 /1228 variables (removed 606) and now considering 522/1128 (removed 606) transitions.
// Phase 1: matrix 522 rows 622 cols
[2024-06-01 12:35:47] [INFO ] Computed 221 invariants in 1 ms
[2024-06-01 12:35:47] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-06-01 12:35:47] [INFO ] Invariant cache hit.
[2024-06-01 12:35:47] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
[2024-06-01 12:35:47] [INFO ] Redundant transitions in 3 ms returned []
Running 518 sub problems to find dead transitions.
[2024-06-01 12:35:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 219/219 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 12:35:56] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:35:56] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:35:56] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:35:56] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:35:56] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 5/224 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (OVERLAPS) 2/622 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 12:36:12] [INFO ] Deduced a trap composed of 86 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:36:12] [INFO ] Deduced a trap composed of 105 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:36:12] [INFO ] Deduced a trap composed of 115 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:36:12] [INFO ] Deduced a trap composed of 133 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:36:12] [INFO ] Deduced a trap composed of 146 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:36:12] [INFO ] Deduced a trap composed of 161 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:36:13] [INFO ] Deduced a trap composed of 176 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:36:13] [INFO ] Deduced a trap composed of 191 places in 73 ms of which 1 ms to minimize.
[2024-06-01 12:36:13] [INFO ] Deduced a trap composed of 203 places in 80 ms of which 1 ms to minimize.
[2024-06-01 12:36:13] [INFO ] Deduced a trap composed of 217 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 237 places in 86 ms of which 2 ms to minimize.
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 247 places in 89 ms of which 2 ms to minimize.
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 267 places in 103 ms of which 2 ms to minimize.
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 282 places in 101 ms of which 3 ms to minimize.
[2024-06-01 12:36:15] [INFO ] Deduced a trap composed of 291 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 15/241 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1144 variables, and 241 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 219/219 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 5/224 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (OVERLAPS) 2/622 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 15/241 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 12:36:27] [INFO ] Deduced a trap composed of 55 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:36:27] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:36:27] [INFO ] Deduced a trap composed of 102 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:36:27] [INFO ] Deduced a trap composed of 105 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:36:27] [INFO ] Deduced a trap composed of 104 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 101 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 101 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 102 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 101 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 102 places in 49 ms of which 2 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 100 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 100 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 101 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 100 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 104 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 103 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 98 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:36:29] [INFO ] Deduced a trap composed of 160 places in 66 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/622 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 12:36:33] [INFO ] Deduced a trap composed of 84 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:36:33] [INFO ] Deduced a trap composed of 70 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:36:33] [INFO ] Deduced a trap composed of 84 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:36:33] [INFO ] Deduced a trap composed of 86 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:36:33] [INFO ] Deduced a trap composed of 83 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:36:33] [INFO ] Deduced a trap composed of 103 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:36:33] [INFO ] Deduced a trap composed of 83 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:36:33] [INFO ] Deduced a trap composed of 83 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:36:33] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:36:33] [INFO ] Deduced a trap composed of 84 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:36:33] [INFO ] Deduced a trap composed of 84 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:36:33] [INFO ] Deduced a trap composed of 83 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:36:33] [INFO ] Deduced a trap composed of 84 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:36:34] [INFO ] Deduced a trap composed of 82 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:36:34] [INFO ] Deduced a trap composed of 98 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:36:34] [INFO ] Deduced a trap composed of 112 places in 57 ms of which 3 ms to minimize.
[2024-06-01 12:36:34] [INFO ] Deduced a trap composed of 146 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:36:34] [INFO ] Deduced a trap composed of 146 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:36:34] [INFO ] Deduced a trap composed of 142 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:36:34] [INFO ] Deduced a trap composed of 141 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 12:36:39] [INFO ] Deduced a trap composed of 85 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:36:39] [INFO ] Deduced a trap composed of 160 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:36:40] [INFO ] Deduced a trap composed of 216 places in 73 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/622 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 116 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 132 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 132 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 132 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 129 places in 49 ms of which 2 ms to minimize.
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 130 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 131 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 129 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:36:46] [INFO ] Deduced a trap composed of 130 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:36:46] [INFO ] Deduced a trap composed of 132 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:36:46] [INFO ] Deduced a trap composed of 129 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:36:46] [INFO ] Deduced a trap composed of 132 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:36:46] [INFO ] Deduced a trap composed of 128 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:36:46] [INFO ] Deduced a trap composed of 132 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:36:46] [INFO ] Deduced a trap composed of 128 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:36:46] [INFO ] Deduced a trap composed of 133 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:36:46] [INFO ] Deduced a trap composed of 133 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:36:46] [INFO ] Deduced a trap composed of 132 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:36:46] [INFO ] Deduced a trap composed of 130 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/622 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 1)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 1)
(s196 0)
(s197 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1144 variables, and 304 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 0/518 constraints, Known Traps: 83/83 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in SI_LTL mode, iteration 1 : 622/1228 places, 522/1128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61115 ms. Remains : 622/1228 places, 522/1128 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-06
Stuttering criterion allowed to conclude after 1353 steps with 0 reset in 15 ms.
FORMULA ShieldPPPs-PT-020B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-06 finished in 61185 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 2 out of 1228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 1227 transition count 986
Reduce places removed 141 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 142 rules applied. Total rules applied 283 place count 1086 transition count 985
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 284 place count 1085 transition count 985
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 284 place count 1085 transition count 885
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 484 place count 985 transition count 885
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 490 place count 979 transition count 879
Iterating global reduction 3 with 6 rules applied. Total rules applied 496 place count 979 transition count 879
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 496 place count 979 transition count 876
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 502 place count 976 transition count 876
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 1 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 3 with 708 rules applied. Total rules applied 1210 place count 622 transition count 522
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1212 place count 620 transition count 520
Applied a total of 1212 rules in 118 ms. Remains 620 /1228 variables (removed 608) and now considering 520/1128 (removed 608) transitions.
// Phase 1: matrix 520 rows 620 cols
[2024-06-01 12:36:48] [INFO ] Computed 221 invariants in 4 ms
[2024-06-01 12:36:48] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-06-01 12:36:48] [INFO ] Invariant cache hit.
[2024-06-01 12:36:49] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
[2024-06-01 12:36:49] [INFO ] Redundant transitions in 4 ms returned []
Running 518 sub problems to find dead transitions.
[2024-06-01 12:36:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 12:36:57] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:36:57] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:36:57] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:36:57] [INFO ] Deduced a trap composed of 56 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:36:57] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:36:57] [INFO ] Deduced a trap composed of 85 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:36:57] [INFO ] Deduced a trap composed of 103 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:36:58] [INFO ] Deduced a trap composed of 113 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:36:58] [INFO ] Deduced a trap composed of 129 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:36:58] [INFO ] Deduced a trap composed of 144 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:36:58] [INFO ] Deduced a trap composed of 159 places in 69 ms of which 1 ms to minimize.
[2024-06-01 12:36:58] [INFO ] Deduced a trap composed of 175 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:36:59] [INFO ] Deduced a trap composed of 190 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:36:59] [INFO ] Deduced a trap composed of 206 places in 81 ms of which 2 ms to minimize.
[2024-06-01 12:36:59] [INFO ] Deduced a trap composed of 219 places in 88 ms of which 2 ms to minimize.
[2024-06-01 12:36:59] [INFO ] Deduced a trap composed of 232 places in 89 ms of which 2 ms to minimize.
[2024-06-01 12:37:00] [INFO ] Deduced a trap composed of 252 places in 96 ms of which 2 ms to minimize.
[2024-06-01 12:37:00] [INFO ] Deduced a trap composed of 267 places in 96 ms of which 2 ms to minimize.
[2024-06-01 12:37:00] [INFO ] Deduced a trap composed of 277 places in 94 ms of which 2 ms to minimize.
[2024-06-01 12:37:00] [INFO ] Deduced a trap composed of 289 places in 107 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 12:37:04] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:37:04] [INFO ] Deduced a trap composed of 41 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:37:04] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:37:05] [INFO ] Deduced a trap composed of 101 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:37:05] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:37:05] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:37:05] [INFO ] Deduced a trap composed of 128 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:37:05] [INFO ] Deduced a trap composed of 147 places in 98 ms of which 1 ms to minimize.
[2024-06-01 12:37:05] [INFO ] Deduced a trap composed of 141 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:37:05] [INFO ] Deduced a trap composed of 143 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:37:05] [INFO ] Deduced a trap composed of 142 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:37:06] [INFO ] Deduced a trap composed of 143 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:37:06] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:37:06] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:37:07] [INFO ] Deduced a trap composed of 260 places in 107 ms of which 2 ms to minimize.
[2024-06-01 12:37:07] [INFO ] Deduced a trap composed of 260 places in 92 ms of which 3 ms to minimize.
[2024-06-01 12:37:07] [INFO ] Deduced a trap composed of 260 places in 95 ms of which 3 ms to minimize.
[2024-06-01 12:37:07] [INFO ] Deduced a trap composed of 264 places in 91 ms of which 2 ms to minimize.
[2024-06-01 12:37:07] [INFO ] Deduced a trap composed of 265 places in 88 ms of which 2 ms to minimize.
[2024-06-01 12:37:07] [INFO ] Deduced a trap composed of 263 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 12:37:12] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:37:12] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:37:12] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:37:12] [INFO ] Deduced a trap composed of 81 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:37:12] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:37:12] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:37:12] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:37:13] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:37:13] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:37:13] [INFO ] Deduced a trap composed of 144 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:37:13] [INFO ] Deduced a trap composed of 144 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:37:13] [INFO ] Deduced a trap composed of 148 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:37:13] [INFO ] Deduced a trap composed of 144 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:37:13] [INFO ] Deduced a trap composed of 144 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:37:13] [INFO ] Deduced a trap composed of 146 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:37:13] [INFO ] Deduced a trap composed of 143 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:37:13] [INFO ] Deduced a trap composed of 144 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:37:13] [INFO ] Deduced a trap composed of 146 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:37:13] [INFO ] Deduced a trap composed of 144 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:37:13] [INFO ] Deduced a trap composed of 142 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1140 variables, and 281 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/620 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 60/281 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 12:37:23] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:37:23] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:37:23] [INFO ] Deduced a trap composed of 70 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:37:23] [INFO ] Deduced a trap composed of 73 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:37:23] [INFO ] Deduced a trap composed of 71 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:37:23] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:37:24] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:37:24] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2024-06-01 12:37:24] [INFO ] Deduced a trap composed of 99 places in 74 ms of which 2 ms to minimize.
[2024-06-01 12:37:24] [INFO ] Deduced a trap composed of 99 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:37:25] [INFO ] Deduced a trap composed of 99 places in 81 ms of which 1 ms to minimize.
[2024-06-01 12:37:25] [INFO ] Deduced a trap composed of 98 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:37:25] [INFO ] Deduced a trap composed of 127 places in 81 ms of which 2 ms to minimize.
[2024-06-01 12:37:25] [INFO ] Deduced a trap composed of 157 places in 98 ms of which 2 ms to minimize.
[2024-06-01 12:37:26] [INFO ] Deduced a trap composed of 177 places in 96 ms of which 2 ms to minimize.
[2024-06-01 12:37:26] [INFO ] Deduced a trap composed of 174 places in 90 ms of which 3 ms to minimize.
[2024-06-01 12:37:26] [INFO ] Deduced a trap composed of 170 places in 89 ms of which 2 ms to minimize.
[2024-06-01 12:37:26] [INFO ] Deduced a trap composed of 161 places in 89 ms of which 2 ms to minimize.
[2024-06-01 12:37:26] [INFO ] Deduced a trap composed of 173 places in 91 ms of which 3 ms to minimize.
[2024-06-01 12:37:26] [INFO ] Deduced a trap composed of 171 places in 89 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 12:37:31] [INFO ] Deduced a trap composed of 130 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:37:31] [INFO ] Deduced a trap composed of 130 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:37:31] [INFO ] Deduced a trap composed of 132 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:37:31] [INFO ] Deduced a trap composed of 129 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:37:31] [INFO ] Deduced a trap composed of 127 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:37:31] [INFO ] Deduced a trap composed of 129 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:37:31] [INFO ] Deduced a trap composed of 130 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:37:31] [INFO ] Deduced a trap composed of 128 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:37:31] [INFO ] Deduced a trap composed of 128 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:37:31] [INFO ] Deduced a trap composed of 125 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:37:31] [INFO ] Deduced a trap composed of 124 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:37:31] [INFO ] Deduced a trap composed of 126 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:37:31] [INFO ] Deduced a trap composed of 128 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:37:32] [INFO ] Deduced a trap composed of 126 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:37:32] [INFO ] Deduced a trap composed of 126 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:37:32] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 2 ms to minimize.
[2024-06-01 12:37:32] [INFO ] Deduced a trap composed of 124 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:37:32] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 18/319 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (OVERLAPS) 520/1140 variables, 620/939 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1140 variables, 518/1457 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1140/1140 variables, and 1457 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 620/620 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 98/98 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in SI_LTL mode, iteration 1 : 620/1228 places, 520/1128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61051 ms. Remains : 620/1228 places, 520/1128 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-07
Stuttering criterion allowed to conclude after 1396 steps with 0 reset in 9 ms.
FORMULA ShieldPPPs-PT-020B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-07 finished in 61154 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(X(F(p0)))||F(p1)))'
Support contains 4 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1222 transition count 1122
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1222 transition count 1122
Applied a total of 12 rules in 48 ms. Remains 1222 /1228 variables (removed 6) and now considering 1122/1128 (removed 6) transitions.
// Phase 1: matrix 1122 rows 1222 cols
[2024-06-01 12:37:49] [INFO ] Computed 221 invariants in 9 ms
[2024-06-01 12:37:49] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-06-01 12:37:49] [INFO ] Invariant cache hit.
[2024-06-01 12:37:50] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1248 ms to find 0 implicit places.
Running 1121 sub problems to find dead transitions.
[2024-06-01 12:37:50] [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 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 timeout
1.0)
(s963 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1121 unsolved
SMT process timed out in 30166ms, After SMT, problems are : Problem set: 0 solved, 1121 unsolved
Search for dead transitions found 0 dead transitions in 30176ms
Starting structural reductions in LTL mode, iteration 1 : 1222/1228 places, 1122/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31474 ms. Remains : 1222/1228 places, 1122/1128 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-08
Product exploration explored 100000 steps with 73 reset in 537 ms.
Product exploration explored 100000 steps with 73 reset in 563 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 78 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 13893 steps (1 resets) in 121 ms. (113 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 150 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 12:38:22] [INFO ] Invariant cache hit.
[2024-06-01 12:38:23] [INFO ] [Real]Absence check using 221 positive place invariants in 152 ms returned sat
[2024-06-01 12:38:27] [INFO ] [Real]Absence check using state equation in 3727 ms returned sat
[2024-06-01 12:38:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:38:27] [INFO ] [Nat]Absence check using 221 positive place invariants in 168 ms returned sat
[2024-06-01 12:38:31] [INFO ] [Nat]Absence check using state equation in 4222 ms returned sat
[2024-06-01 12:38:32] [INFO ] Computed and/alt/rep : 1121/1982/1121 causal constraints (skipped 0 transitions) in 69 ms.
[2024-06-01 12:38:42] [INFO ] Added : 310 causal constraints over 62 iterations in 10092 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 1222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1222/1222 places, 1122/1122 transitions.
Applied a total of 0 rules in 28 ms. Remains 1222 /1222 variables (removed 0) and now considering 1122/1122 (removed 0) transitions.
[2024-06-01 12:38:42] [INFO ] Invariant cache hit.
[2024-06-01 12:38:42] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-06-01 12:38:42] [INFO ] Invariant cache hit.
[2024-06-01 12:38:43] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
Running 1121 sub problems to find dead transitions.
[2024-06-01 12:38:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1121 unsolved
SMT process timed out in 30168ms, After SMT, problems are : Problem set: 0 solved, 1121 unsolved
Search for dead transitions found 0 dead transitions in 30178ms
Finished structural reductions in LTL mode , in 1 iterations and 31432 ms. Remains : 1222/1222 places, 1122/1122 transitions.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 16609 steps (2 resets) in 148 ms. (111 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 12:39:14] [INFO ] Invariant cache hit.
[2024-06-01 12:39:14] [INFO ] [Real]Absence check using 221 positive place invariants in 161 ms returned sat
[2024-06-01 12:39:18] [INFO ] [Real]Absence check using state equation in 3814 ms returned sat
[2024-06-01 12:39:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:39:19] [INFO ] [Nat]Absence check using 221 positive place invariants in 163 ms returned sat
[2024-06-01 12:39:23] [INFO ] [Nat]Absence check using state equation in 4318 ms returned sat
[2024-06-01 12:39:23] [INFO ] Computed and/alt/rep : 1121/1982/1121 causal constraints (skipped 0 transitions) in 56 ms.
[2024-06-01 12:39:33] [INFO ] Added : 315 causal constraints over 63 iterations in 9998 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 75 reset in 507 ms.
Product exploration explored 100000 steps with 75 reset in 591 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1222/1222 places, 1122/1122 transitions.
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 1222 transition count 1122
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 42 Pre rules applied. Total rules applied 139 place count 1222 transition count 1123
Deduced a syphon composed of 181 places in 1 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 181 place count 1222 transition count 1123
Performed 418 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 599 places in 1 ms
Iterating global reduction 1 with 418 rules applied. Total rules applied 599 place count 1222 transition count 1123
Renaming transitions due to excessive name length > 1024 char.
Discarding 142 places :
Symmetric choice reduction at 1 with 142 rule applications. Total rules 741 place count 1080 transition count 981
Deduced a syphon composed of 457 places in 0 ms
Iterating global reduction 1 with 142 rules applied. Total rules applied 883 place count 1080 transition count 981
Deduced a syphon composed of 457 places in 0 ms
Applied a total of 883 rules in 327 ms. Remains 1080 /1222 variables (removed 142) and now considering 981/1122 (removed 141) transitions.
[2024-06-01 12:39:35] [INFO ] Redundant transitions in 11 ms returned []
Running 980 sub problems to find dead transitions.
// Phase 1: matrix 981 rows 1080 cols
[2024-06-01 12:39:35] [INFO ] Computed 221 invariants in 21 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1079 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 980 unsolved
At refinement iteration 1 (OVERLAPS) 1/1080 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 980 unsolved
[2024-06-01 12:40:04] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 12:40:04] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 12:40:04] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 12:40:04] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 12:40:04] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 12:40:04] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 12:40:04] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 12:40:04] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 12:40:04] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 12:40:04] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 12:40:04] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 12:40:05] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 12:40:05] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-01 12:40:05] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 12:40:05] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 12:40:05] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-06-01 12:40:05] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 12:40:05] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 12:40:05] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-06-01 12:40:05] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD838 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1080 variables, 20/241 constraints. Problems are: Problem set: 88 solved, 892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1080/2061 variables, and 241 constraints, problems are : Problem set: 88 solved, 892 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/1080 constraints, PredecessorRefiner: 980/980 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 88 solved, 892 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/991 variables, 0/0 constraints. Problems are: Problem set: 88 solved, 892 unsolved
At refinement iteration 1 (OVERLAPS) 89/1080 variables, 221/221 constraints. Problems are: Problem set: 88 solved, 892 unsolved
Problem TDEAD861 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD953 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1080 variables, 20/241 constraints. Problems are: Problem set: 93 solved, 887 unsolved
[2024-06-01 12:40:19] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-06-01 12:40:19] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-06-01 12:40:19] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-06-01 12:40:19] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-06-01 12:40:19] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-06-01 12:40:19] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-06-01 12:40:19] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-06-01 12:40:19] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-06-01 12:40:19] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
Problem TDEAD85 is UNSAT
[2024-06-01 12:40:19] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-06-01 12:40:20] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-06-01 12:40:20] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-06-01 12:40:20] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-06-01 12:40:20] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD100 is UNSAT
[2024-06-01 12:40:20] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
Problem TDEAD103 is UNSAT
[2024-06-01 12:40:20] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-06-01 12:40:20] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD109 is UNSAT
[2024-06-01 12:40:20] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-06-01 12:40:20] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-06-01 12:40:20] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD837 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/1080 variables, 20/261 constraints. Problems are: Problem set: 168 solved, 812 unsolved
[2024-06-01 12:40:22] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
Problem TDEAD121 is UNSAT
[2024-06-01 12:40:22] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
Problem TDEAD124 is UNSAT
[2024-06-01 12:40:22] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
Problem TDEAD127 is UNSAT
[2024-06-01 12:40:22] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
[2024-06-01 12:40:22] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD133 is UNSAT
[2024-06-01 12:40:22] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
[2024-06-01 12:40:22] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD139 is UNSAT
[2024-06-01 12:40:23] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Problem TDEAD142 is UNSAT
[2024-06-01 12:40:23] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
Problem TDEAD145 is UNSAT
[2024-06-01 12:40:23] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
Problem TDEAD148 is UNSAT
[2024-06-01 12:40:23] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD151 is UNSAT
[2024-06-01 12:40:23] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD154 is UNSAT
[2024-06-01 12:40:23] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD157 is UNSAT
[2024-06-01 12:40:23] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD160 is UNSAT
[2024-06-01 12:40:23] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD163 is UNSAT
[2024-06-01 12:40:23] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD166 is UNSAT
[2024-06-01 12:40:23] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD169 is UNSAT
[2024-06-01 12:40:23] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD172 is UNSAT
[2024-06-01 12:40:23] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD175 is UNSAT
[2024-06-01 12:40:24] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD977 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/1080 variables, 20/281 constraints. Problems are: Problem set: 241 solved, 739 unsolved
[2024-06-01 12:40:26] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
[2024-06-01 12:40:26] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD183 is UNSAT
[2024-06-01 12:40:26] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
[2024-06-01 12:40:26] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
[2024-06-01 12:40:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD188 is UNSAT
[2024-06-01 12:40:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
[2024-06-01 12:40:26] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
[2024-06-01 12:40:26] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
[2024-06-01 12:40:26] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
[2024-06-01 12:40:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD199 is UNSAT
[2024-06-01 12:40:26] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
[2024-06-01 12:40:26] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
[2024-06-01 12:40:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD204 is UNSAT
[2024-06-01 12:40:26] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
[2024-06-01 12:40:27] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
[2024-06-01 12:40:27] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
[2024-06-01 12:40:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD212 is UNSAT
[2024-06-01 12:40:27] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
[2024-06-01 12:40:27] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
[2024-06-01 12:40:27] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1080 variables, 20/301 constraints. Problems are: Problem set: 291 solved, 689 unsolved
[2024-06-01 12:40:29] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
Problem TDEAD220 is UNSAT
[2024-06-01 12:40:29] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
[2024-06-01 12:40:29] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
[2024-06-01 12:40:29] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
[2024-06-01 12:40:29] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
[2024-06-01 12:40:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD231 is UNSAT
[2024-06-01 12:40:29] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
[2024-06-01 12:40:29] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
Problem TDEAD234 is UNSAT
[2024-06-01 12:40:30] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
[2024-06-01 12:40:30] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
[2024-06-01 12:40:30] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD240 is UNSAT
[2024-06-01 12:40:30] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
[2024-06-01 12:40:30] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
[2024-06-01 12:40:30] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
[2024-06-01 12:40:30] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD248 is UNSAT
[2024-06-01 12:40:30] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
[2024-06-01 12:40:30] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
[2024-06-01 12:40:30] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
Problem TDEAD253 is UNSAT
[2024-06-01 12:40:30] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
[2024-06-01 12:40:30] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/1080 variables, 20/321 constraints. Problems are: Problem set: 337 solved, 643 unsolved
[2024-06-01 12:40:33] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
[2024-06-01 12:40:33] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
[2024-06-01 12:40:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD264 is UNSAT
[2024-06-01 12:40:33] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
[2024-06-01 12:40:33] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
[2024-06-01 12:40:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD269 is UNSAT
[2024-06-01 12:40:33] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
[2024-06-01 12:40:33] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
[2024-06-01 12:40:33] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
[2024-06-01 12:40:33] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
[2024-06-01 12:40:33] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
Problem TDEAD280 is UNSAT
[2024-06-01 12:40:33] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD281 is UNSAT
[2024-06-01 12:40:33] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 2 ms to minimize.
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
[2024-06-01 12:40:33] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
[2024-06-01 12:40:33] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD288 is UNSAT
[2024-06-01 12:40:33] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
[2024-06-01 12:40:33] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
[2024-06-01 12:40:34] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
Problem TDEAD293 is UNSAT
[2024-06-01 12:40:34] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
[2024-06-01 12:40:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD727 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 20/341 constraints. Problems are: Problem set: 386 solved, 594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1080/2061 variables, and 341 constraints, problems are : Problem set: 386 solved, 594 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/1080 constraints, PredecessorRefiner: 0/980 constraints, Known Traps: 120/120 constraints]
After SMT, in 60427ms problems are : Problem set: 386 solved, 594 unsolved
Search for dead transitions found 386 dead transitions in 60435ms
Found 386 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 386 transitions
Dead transitions reduction (with SMT) removed 386 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1080/1222 places, 595/1122 transitions.
Graph (complete) has 1780 edges and 1080 vertex of which 694 are kept as prefixes of interest. Removing 386 places using SCC suffix rule.2 ms
Discarding 386 places :
Also discarding 0 output transitions
Deduced a syphon composed of 71 places in 0 ms
Applied a total of 1 rules in 15 ms. Remains 694 /1080 variables (removed 386) and now considering 595/595 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 694/1222 places, 595/1122 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60815 ms. Remains : 694/1222 places, 595/1122 transitions.
Support contains 4 out of 1222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1222/1222 places, 1122/1122 transitions.
Applied a total of 0 rules in 22 ms. Remains 1222 /1222 variables (removed 0) and now considering 1122/1122 (removed 0) transitions.
// Phase 1: matrix 1122 rows 1222 cols
[2024-06-01 12:40:36] [INFO ] Computed 221 invariants in 9 ms
[2024-06-01 12:40:36] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-06-01 12:40:36] [INFO ] Invariant cache hit.
[2024-06-01 12:40:37] [INFO ] Implicit Places using invariants and state equation in 852 ms returned []
Implicit Place search using SMT with State Equation took 1237 ms to find 0 implicit places.
Running 1121 sub problems to find dead transitions.
[2024-06-01 12:40:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1121 unsolved
SMT process timed out in 30157ms, After SMT, problems are : Problem set: 0 solved, 1121 unsolved
Search for dead transitions found 0 dead transitions in 30167ms
Finished structural reductions in LTL mode , in 1 iterations and 31431 ms. Remains : 1222/1222 places, 1122/1122 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-08 finished in 198217 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 5 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1222 transition count 1122
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1222 transition count 1122
Applied a total of 12 rules in 61 ms. Remains 1222 /1228 variables (removed 6) and now considering 1122/1128 (removed 6) transitions.
[2024-06-01 12:41:07] [INFO ] Invariant cache hit.
[2024-06-01 12:41:07] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-06-01 12:41:07] [INFO ] Invariant cache hit.
[2024-06-01 12:41:08] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
Running 1121 sub problems to find dead transitions.
[2024-06-01 12:41:08] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1121 unsolved
SMT process timed out in 30167ms, After SMT, problems are : Problem set: 0 solved, 1121 unsolved
Search for dead transitions found 0 dead transitions in 30178ms
Starting structural reductions in LTL mode, iteration 1 : 1222/1228 places, 1122/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31493 ms. Remains : 1222/1228 places, 1122/1128 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-09
Product exploration explored 100000 steps with 1213 reset in 224 ms.
Product exploration explored 100000 steps with 1223 reset in 236 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 283 steps (0 resets) in 6 ms. (40 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:41:40] [INFO ] Invariant cache hit.
[2024-06-01 12:41:40] [INFO ] [Real]Absence check using 221 positive place invariants in 170 ms returned sat
[2024-06-01 12:41:44] [INFO ] [Real]Absence check using state equation in 4279 ms returned sat
[2024-06-01 12:41:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:41:45] [INFO ] [Nat]Absence check using 221 positive place invariants in 178 ms returned sat
[2024-06-01 12:41:49] [INFO ] [Nat]Absence check using state equation in 4217 ms returned sat
[2024-06-01 12:41:50] [INFO ] Computed and/alt/rep : 1121/1982/1121 causal constraints (skipped 0 transitions) in 61 ms.
[2024-06-01 12:42:00] [INFO ] Added : 310 causal constraints over 62 iterations in 10060 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 5 out of 1222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1222/1222 places, 1122/1122 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 1221 transition count 982
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 278 place count 1082 transition count 982
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 278 place count 1082 transition count 881
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 480 place count 981 transition count 881
Performed 352 Post agglomeration using F-continuation condition.Transition count delta: 352
Deduced a syphon composed of 352 places in 0 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 2 with 704 rules applied. Total rules applied 1184 place count 629 transition count 529
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1186 place count 627 transition count 527
Applied a total of 1186 rules in 90 ms. Remains 627 /1222 variables (removed 595) and now considering 527/1122 (removed 595) transitions.
// Phase 1: matrix 527 rows 627 cols
[2024-06-01 12:42:00] [INFO ] Computed 221 invariants in 3 ms
[2024-06-01 12:42:00] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-06-01 12:42:00] [INFO ] Invariant cache hit.
[2024-06-01 12:42:00] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
[2024-06-01 12:42:00] [INFO ] Redundant transitions in 3 ms returned []
Running 522 sub problems to find dead transitions.
[2024-06-01 12:42:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:42:08] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:42:08] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:42:10] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:42:10] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:42:10] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:42:10] [INFO ] Deduced a trap composed of 69 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:42:11] [INFO ] Deduced a trap composed of 82 places in 49 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 7/206 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 3/627 variables, 22/228 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:42:23] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:42:23] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:42:23] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:42:23] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:42:23] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:42:23] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:42:23] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:42:24] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:42:25] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:42:25] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:42:25] [INFO ] Deduced a trap composed of 91 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:42:25] [INFO ] Deduced a trap composed of 102 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:42:25] [INFO ] Deduced a trap composed of 114 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:42:25] [INFO ] Deduced a trap composed of 134 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:42:26] [INFO ] Deduced a trap composed of 147 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:42:26] [INFO ] Deduced a trap composed of 160 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:42:26] [INFO ] Deduced a trap composed of 177 places in 74 ms of which 1 ms to minimize.
[2024-06-01 12:42:26] [INFO ] Deduced a trap composed of 191 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:42:26] [INFO ] Deduced a trap composed of 203 places in 81 ms of which 2 ms to minimize.
[2024-06-01 12:42:27] [INFO ] Deduced a trap composed of 220 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 522 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 627/1154 variables, and 248 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/627 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 9/208 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 3/627 variables, 22/230 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 18/248 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:42:40] [INFO ] Deduced a trap composed of 89 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:42:40] [INFO ] Deduced a trap composed of 89 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:42:40] [INFO ] Deduced a trap composed of 89 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:42:40] [INFO ] Deduced a trap composed of 88 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:42:40] [INFO ] Deduced a trap composed of 87 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:42:40] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:42:40] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:42:40] [INFO ] Deduced a trap composed of 54 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:42:40] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:42:40] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:42:40] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:42:41] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:42:41] [INFO ] Deduced a trap composed of 83 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:42:41] [INFO ] Deduced a trap composed of 100 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:42:41] [INFO ] Deduced a trap composed of 126 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:42:41] [INFO ] Deduced a trap composed of 140 places in 73 ms of which 1 ms to minimize.
[2024-06-01 12:42:42] [INFO ] Deduced a trap composed of 170 places in 90 ms of which 5 ms to minimize.
[2024-06-01 12:42:42] [INFO ] Deduced a trap composed of 187 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 18/266 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:42:47] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:42:47] [INFO ] Deduced a trap composed of 71 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:42:47] [INFO ] Deduced a trap composed of 71 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:42:47] [INFO ] Deduced a trap composed of 70 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:42:47] [INFO ] Deduced a trap composed of 73 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:42:47] [INFO ] Deduced a trap composed of 71 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:42:47] [INFO ] Deduced a trap composed of 71 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:42:47] [INFO ] Deduced a trap composed of 71 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:42:47] [INFO ] Deduced a trap composed of 71 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:42:47] [INFO ] Deduced a trap composed of 71 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:42:47] [INFO ] Deduced a trap composed of 70 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:42:47] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:42:47] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:42:47] [INFO ] Deduced a trap composed of 84 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:42:48] [INFO ] Deduced a trap composed of 99 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:42:48] [INFO ] Deduced a trap composed of 114 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:42:48] [INFO ] Deduced a trap composed of 132 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:42:48] [INFO ] Deduced a trap composed of 143 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:42:48] [INFO ] Deduced a trap composed of 178 places in 72 ms of which 2 ms to minimize.
[2024-06-01 12:42:49] [INFO ] Deduced a trap composed of 177 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 20/286 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:42:53] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:42:59] [INFO ] Deduced a trap composed of 87 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:42:59] [INFO ] Deduced a trap composed of 88 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:42:59] [INFO ] Deduced a trap composed of 86 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:42:59] [INFO ] Deduced a trap composed of 102 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:42:59] [INFO ] Deduced a trap composed of 103 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:42:59] [INFO ] Deduced a trap composed of 103 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:43:00] [INFO ] Deduced a trap composed of 159 places in 67 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/1154 variables, and 294 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/627 constraints, PredecessorRefiner: 0/522 constraints, Known Traps: 73/73 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Starting structural reductions in SI_LTL mode, iteration 1 : 627/1222 places, 527/1122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60969 ms. Remains : 627/1222 places, 527/1122 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 36 steps (0 resets) in 6 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 177 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:43:01] [INFO ] Invariant cache hit.
[2024-06-01 12:43:02] [INFO ] [Real]Absence check using 221 positive place invariants in 69 ms returned sat
[2024-06-01 12:43:02] [INFO ] [Real]Absence check using state equation in 787 ms returned sat
[2024-06-01 12:43:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:43:03] [INFO ] [Nat]Absence check using 221 positive place invariants in 76 ms returned sat
[2024-06-01 12:43:03] [INFO ] [Nat]Absence check using state equation in 713 ms returned sat
[2024-06-01 12:43:03] [INFO ] Computed and/alt/rep : 522/1039/522 causal constraints (skipped 0 transitions) in 29 ms.
[2024-06-01 12:43:09] [INFO ] Added : 431 causal constraints over 87 iterations in 5367 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25597 reset in 384 ms.
Product exploration explored 100000 steps with 25580 reset in 454 ms.
Support contains 5 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 527/527 transitions.
Applied a total of 0 rules in 10 ms. Remains 627 /627 variables (removed 0) and now considering 527/527 (removed 0) transitions.
[2024-06-01 12:43:10] [INFO ] Invariant cache hit.
[2024-06-01 12:43:10] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-06-01 12:43:10] [INFO ] Invariant cache hit.
[2024-06-01 12:43:10] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
[2024-06-01 12:43:10] [INFO ] Redundant transitions in 3 ms returned []
Running 522 sub problems to find dead transitions.
[2024-06-01 12:43:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:43:18] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:43:19] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:43:20] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:43:20] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:43:20] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:43:21] [INFO ] Deduced a trap composed of 69 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:43:21] [INFO ] Deduced a trap composed of 82 places in 46 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 7/206 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 3/627 variables, 22/228 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:43:33] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:43:33] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:43:33] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:43:33] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:43:33] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:43:33] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:43:33] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:43:35] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:43:35] [INFO ] Deduced a trap composed of 58 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:43:35] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:43:35] [INFO ] Deduced a trap composed of 91 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:43:35] [INFO ] Deduced a trap composed of 102 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:43:35] [INFO ] Deduced a trap composed of 114 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:43:35] [INFO ] Deduced a trap composed of 134 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:43:36] [INFO ] Deduced a trap composed of 147 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:43:36] [INFO ] Deduced a trap composed of 160 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:43:36] [INFO ] Deduced a trap composed of 177 places in 74 ms of which 1 ms to minimize.
[2024-06-01 12:43:36] [INFO ] Deduced a trap composed of 191 places in 75 ms of which 1 ms to minimize.
[2024-06-01 12:43:37] [INFO ] Deduced a trap composed of 203 places in 84 ms of which 2 ms to minimize.
[2024-06-01 12:43:37] [INFO ] Deduced a trap composed of 220 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 522 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 627/1154 variables, and 248 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/627 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 9/208 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 3/627 variables, 22/230 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 18/248 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:43:50] [INFO ] Deduced a trap composed of 89 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:43:50] [INFO ] Deduced a trap composed of 89 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:43:50] [INFO ] Deduced a trap composed of 89 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:43:50] [INFO ] Deduced a trap composed of 88 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 87 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 100 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:43:52] [INFO ] Deduced a trap composed of 126 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:43:52] [INFO ] Deduced a trap composed of 140 places in 74 ms of which 2 ms to minimize.
[2024-06-01 12:43:52] [INFO ] Deduced a trap composed of 170 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:43:52] [INFO ] Deduced a trap composed of 187 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 18/266 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:43:57] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:43:57] [INFO ] Deduced a trap composed of 71 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:43:57] [INFO ] Deduced a trap composed of 71 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:43:57] [INFO ] Deduced a trap composed of 70 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:43:57] [INFO ] Deduced a trap composed of 73 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:43:57] [INFO ] Deduced a trap composed of 71 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:43:57] [INFO ] Deduced a trap composed of 71 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:43:58] [INFO ] Deduced a trap composed of 71 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:43:58] [INFO ] Deduced a trap composed of 71 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:43:58] [INFO ] Deduced a trap composed of 71 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:43:58] [INFO ] Deduced a trap composed of 70 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:43:58] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:43:58] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:43:58] [INFO ] Deduced a trap composed of 84 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:43:58] [INFO ] Deduced a trap composed of 99 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:43:58] [INFO ] Deduced a trap composed of 114 places in 49 ms of which 2 ms to minimize.
[2024-06-01 12:43:58] [INFO ] Deduced a trap composed of 132 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:43:59] [INFO ] Deduced a trap composed of 143 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:43:59] [INFO ] Deduced a trap composed of 178 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:43:59] [INFO ] Deduced a trap composed of 177 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 20/286 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:44:03] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:44:09] [INFO ] Deduced a trap composed of 87 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:44:09] [INFO ] Deduced a trap composed of 88 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:44:09] [INFO ] Deduced a trap composed of 86 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:44:09] [INFO ] Deduced a trap composed of 102 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:44:09] [INFO ] Deduced a trap composed of 103 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:44:10] [INFO ] Deduced a trap composed of 103 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:44:10] [INFO ] Deduced a trap composed of 159 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/1154 variables, and 294 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/627 constraints, PredecessorRefiner: 0/522 constraints, Known Traps: 73/73 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60847 ms. Remains : 627/627 places, 527/527 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-09 finished in 183571 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)) U G(p1)))'
Support contains 3 out of 1228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 1227 transition count 985
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 1085 transition count 985
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 284 place count 1085 transition count 886
Deduced a syphon composed of 99 places in 2 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 482 place count 986 transition count 886
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 488 place count 980 transition count 880
Iterating global reduction 2 with 6 rules applied. Total rules applied 494 place count 980 transition count 880
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 494 place count 980 transition count 877
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 500 place count 977 transition count 877
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 349
Deduced a syphon composed of 349 places in 0 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 2 with 698 rules applied. Total rules applied 1198 place count 628 transition count 528
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1200 place count 626 transition count 526
Applied a total of 1200 rules in 122 ms. Remains 626 /1228 variables (removed 602) and now considering 526/1128 (removed 602) transitions.
// Phase 1: matrix 526 rows 626 cols
[2024-06-01 12:44:11] [INFO ] Computed 221 invariants in 3 ms
[2024-06-01 12:44:11] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-06-01 12:44:11] [INFO ] Invariant cache hit.
[2024-06-01 12:44:11] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
[2024-06-01 12:44:11] [INFO ] Redundant transitions in 4 ms returned []
Running 522 sub problems to find dead transitions.
[2024-06-01 12:44:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:44:19] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:44:20] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:44:20] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:44:20] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:44:20] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:44:20] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:44:20] [INFO ] Deduced a trap composed of 103 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:44:21] [INFO ] Deduced a trap composed of 113 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:44:21] [INFO ] Deduced a trap composed of 129 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:44:21] [INFO ] Deduced a trap composed of 146 places in 61 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 2/626 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:44:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:44:37] [INFO ] Deduced a trap composed of 159 places in 72 ms of which 1 ms to minimize.
[2024-06-01 12:44:37] [INFO ] Deduced a trap composed of 170 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:44:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 4/235 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1152 variables, and 235 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 14/221 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:44:45] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (OVERLAPS) 2/626 variables, 14/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/626 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 6 (OVERLAPS) 526/1152 variables, 626/862 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1152 variables, 522/1384 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 1384 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 15/15 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in SI_LTL mode, iteration 1 : 626/1228 places, 526/1128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60998 ms. Remains : 626/1228 places, 526/1128 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-11
Product exploration explored 100000 steps with 33146 reset in 410 ms.
Product exploration explored 100000 steps with 33071 reset in 472 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/626 stabilizing places and 4/526 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 350 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (28 resets) in 314 ms. (126 steps per ms) remains 1/4 properties
BEST_FIRST walk for 24635 steps (4 resets) in 99 ms. (246 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 446 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
[2024-06-01 12:45:14] [INFO ] Invariant cache hit.
[2024-06-01 12:45:14] [INFO ] [Real]Absence check using 221 positive place invariants in 73 ms returned sat
[2024-06-01 12:45:15] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2024-06-01 12:45:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:45:15] [INFO ] [Nat]Absence check using 221 positive place invariants in 75 ms returned sat
[2024-06-01 12:45:16] [INFO ] [Nat]Absence check using state equation in 689 ms returned sat
[2024-06-01 12:45:16] [INFO ] Computed and/alt/rep : 522/1013/522 causal constraints (skipped 0 transitions) in 28 ms.
[2024-06-01 12:45:24] [INFO ] Added : 521 causal constraints over 105 iterations in 7771 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 526/526 transitions.
Applied a total of 0 rules in 11 ms. Remains 626 /626 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2024-06-01 12:45:24] [INFO ] Invariant cache hit.
[2024-06-01 12:45:24] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-06-01 12:45:24] [INFO ] Invariant cache hit.
[2024-06-01 12:45:24] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
[2024-06-01 12:45:24] [INFO ] Redundant transitions in 3 ms returned []
Running 522 sub problems to find dead transitions.
[2024-06-01 12:45:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:45:32] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:45:33] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:45:33] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:45:33] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:45:33] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:45:33] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:45:33] [INFO ] Deduced a trap composed of 103 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:45:34] [INFO ] Deduced a trap composed of 113 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:45:34] [INFO ] Deduced a trap composed of 129 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:45:34] [INFO ] Deduced a trap composed of 146 places in 63 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 2/626 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:45:50] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:45:50] [INFO ] Deduced a trap composed of 159 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:45:50] [INFO ] Deduced a trap composed of 170 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:45:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 4/235 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 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 626/1152 variables, and 235 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 14/221 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:45:59] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (OVERLAPS) 2/626 variables, 14/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/626 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 6 (OVERLAPS) 526/1152 variables, 626/862 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1152 variables, 522/1384 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 1384 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 15/15 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60847 ms. Remains : 626/626 places, 526/526 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/626 stabilizing places and 4/526 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 359 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (28 resets) in 321 ms. (124 steps per ms) remains 1/4 properties
BEST_FIRST walk for 15769 steps (2 resets) in 64 ms. (242 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 475 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
[2024-06-01 12:46:26] [INFO ] Invariant cache hit.
[2024-06-01 12:46:26] [INFO ] [Real]Absence check using 221 positive place invariants in 75 ms returned sat
[2024-06-01 12:46:27] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2024-06-01 12:46:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:46:27] [INFO ] [Nat]Absence check using 221 positive place invariants in 76 ms returned sat
[2024-06-01 12:46:28] [INFO ] [Nat]Absence check using state equation in 697 ms returned sat
[2024-06-01 12:46:28] [INFO ] Computed and/alt/rep : 522/1013/522 causal constraints (skipped 0 transitions) in 27 ms.
[2024-06-01 12:46:36] [INFO ] Added : 521 causal constraints over 105 iterations in 7854 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 33259 reset in 406 ms.
Product exploration explored 100000 steps with 33230 reset in 475 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 526/526 transitions.
Applied a total of 0 rules in 22 ms. Remains 626 /626 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2024-06-01 12:46:37] [INFO ] Invariant cache hit.
[2024-06-01 12:46:37] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-06-01 12:46:37] [INFO ] Invariant cache hit.
[2024-06-01 12:46:38] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
[2024-06-01 12:46:38] [INFO ] Redundant transitions in 3 ms returned []
Running 522 sub problems to find dead transitions.
[2024-06-01 12:46:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:46:46] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:46:46] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:46:46] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:46:46] [INFO ] Deduced a trap composed of 56 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:46:46] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:46:46] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:46:47] [INFO ] Deduced a trap composed of 103 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:46:47] [INFO ] Deduced a trap composed of 113 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:46:47] [INFO ] Deduced a trap composed of 129 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:46:47] [INFO ] Deduced a trap composed of 146 places in 63 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 2/626 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:47:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:47:03] [INFO ] Deduced a trap composed of 159 places in 69 ms of which 1 ms to minimize.
[2024-06-01 12:47:03] [INFO ] Deduced a trap composed of 170 places in 72 ms of which 2 ms to minimize.
[2024-06-01 12:47:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 4/235 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 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 626/1152 variables, and 235 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 14/221 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:47:12] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (OVERLAPS) 2/626 variables, 14/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/626 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 6 (OVERLAPS) 526/1152 variables, 626/862 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1152 variables, 522/1384 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 1384 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 15/15 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60865 ms. Remains : 626/626 places, 526/526 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-11 finished in 207286 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(G(p0)))'
Support contains 1 out of 1228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 1227 transition count 986
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 1086 transition count 986
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 282 place count 1086 transition count 886
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 482 place count 986 transition count 886
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 487 place count 981 transition count 881
Iterating global reduction 2 with 5 rules applied. Total rules applied 492 place count 981 transition count 881
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 492 place count 981 transition count 879
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 496 place count 979 transition count 879
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 0 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 2 with 710 rules applied. Total rules applied 1206 place count 624 transition count 524
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1208 place count 622 transition count 522
Applied a total of 1208 rules in 119 ms. Remains 622 /1228 variables (removed 606) and now considering 522/1128 (removed 606) transitions.
// Phase 1: matrix 522 rows 622 cols
[2024-06-01 12:47:38] [INFO ] Computed 221 invariants in 2 ms
[2024-06-01 12:47:38] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-06-01 12:47:38] [INFO ] Invariant cache hit.
[2024-06-01 12:47:39] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
[2024-06-01 12:47:39] [INFO ] Redundant transitions in 3 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-01 12:47:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:47:47] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:47:47] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:47:47] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:47:47] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:47:47] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:48:01] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:48:01] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:48:01] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1144 variables, and 229 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 522/1144 variables, 622/851 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 519/1370 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:48:29] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:48:29] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:48:32] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:48:32] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:48:37] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:48:38] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 1376 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 14/14 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in SI_LTL mode, iteration 1 : 622/1228 places, 522/1128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60960 ms. Remains : 622/1228 places, 522/1128 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-12
Product exploration explored 100000 steps with 72 reset in 559 ms.
Product exploration explored 100000 steps with 72 reset in 670 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/622 stabilizing places and 2/522 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 6 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 198 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 1 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 522/522 transitions.
Applied a total of 0 rules in 16 ms. Remains 622 /622 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2024-06-01 12:48:41] [INFO ] Invariant cache hit.
[2024-06-01 12:48:41] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-06-01 12:48:41] [INFO ] Invariant cache hit.
[2024-06-01 12:48:41] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2024-06-01 12:48:41] [INFO ] Redundant transitions in 4 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-01 12:48:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:48:50] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:48:50] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:48:50] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:48:50] [INFO ] Deduced a trap composed of 56 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:48:50] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:49:04] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:49:04] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:49:04] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 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 622/1144 variables, and 229 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 522/1144 variables, 622/851 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 519/1370 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:49:32] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:49:32] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:49:36] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:49:36] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:49:41] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:49:41] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 1376 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 14/14 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60859 ms. Remains : 622/622 places, 522/522 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/622 stabilizing places and 2/522 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
RANDOM walk for 17 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 72 reset in 558 ms.
Product exploration explored 100000 steps with 73 reset in 669 ms.
Support contains 1 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 522/522 transitions.
Applied a total of 0 rules in 11 ms. Remains 622 /622 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2024-06-01 12:49:43] [INFO ] Invariant cache hit.
[2024-06-01 12:49:43] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-06-01 12:49:43] [INFO ] Invariant cache hit.
[2024-06-01 12:49:44] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
[2024-06-01 12:49:44] [INFO ] Redundant transitions in 3 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-01 12:49:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:49:52] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:49:52] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:49:53] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:49:53] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:49:53] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:50:07] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:50:07] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:50:07] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1144 variables, and 229 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 522/1144 variables, 622/851 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 519/1370 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:50:35] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:50:35] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:50:38] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:50:39] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:50:44] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:50:44] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 1376 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 14/14 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60871 ms. Remains : 622/622 places, 522/522 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-12 finished in 186253 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((G(F(p0))&&(G(p1)||X(p2)))))'
Support contains 6 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1224 transition count 1124
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1224 transition count 1124
Applied a total of 8 rules in 64 ms. Remains 1224 /1228 variables (removed 4) and now considering 1124/1128 (removed 4) transitions.
// Phase 1: matrix 1124 rows 1224 cols
[2024-06-01 12:50:44] [INFO ] Computed 221 invariants in 9 ms
[2024-06-01 12:50:45] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-06-01 12:50:45] [INFO ] Invariant cache hit.
[2024-06-01 12:50:45] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1302 ms to find 0 implicit places.
Running 1123 sub problems to find dead transitions.
[2024-06-01 12:50:46] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
SMT process timed out in 30173ms, After SMT, problems are : Problem set: 0 solved, 1123 unsolved
Search for dead transitions found 0 dead transitions in 30184ms
Starting structural reductions in LTL mode, iteration 1 : 1224/1228 places, 1124/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31553 ms. Remains : 1224/1228 places, 1124/1128 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-13
Product exploration explored 100000 steps with 114 reset in 504 ms.
Product exploration explored 100000 steps with 119 reset in 575 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X p0)), (X (X p1)), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 102 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 6191 steps (0 resets) in 41 ms. (147 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X p0)), (X (X p1)), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1224 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1224/1224 places, 1124/1124 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 1223 transition count 984
Reduce places removed 139 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 141 rules applied. Total rules applied 280 place count 1084 transition count 982
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 282 place count 1082 transition count 982
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 282 place count 1082 transition count 883
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 480 place count 983 transition count 883
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 0 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 3 with 710 rules applied. Total rules applied 1190 place count 628 transition count 528
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1192 place count 626 transition count 526
Applied a total of 1192 rules in 117 ms. Remains 626 /1224 variables (removed 598) and now considering 526/1124 (removed 598) transitions.
// Phase 1: matrix 526 rows 626 cols
[2024-06-01 12:51:18] [INFO ] Computed 221 invariants in 1 ms
[2024-06-01 12:51:18] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-06-01 12:51:18] [INFO ] Invariant cache hit.
[2024-06-01 12:51:18] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2024-06-01 12:51:18] [INFO ] Redundant transitions in 4 ms returned []
Running 523 sub problems to find dead transitions.
[2024-06-01 12:51:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (OVERLAPS) 1/626 variables, 11/221 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-06-01 12:51:33] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:51:33] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/626 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (OVERLAPS) 526/1152 variables, 626/849 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1152/1152 variables, and 849 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 3 (OVERLAPS) 1/626 variables, 11/223 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (OVERLAPS) 526/1152 variables, 626/849 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1152 variables, 523/1372 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 1372 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 2/2 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in SI_LTL mode, iteration 1 : 626/1224 places, 526/1124 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60991 ms. Remains : 626/1224 places, 526/1124 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2396 steps (0 resets) in 24 ms. (95 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 152 reset in 537 ms.
Product exploration explored 100000 steps with 155 reset in 638 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 526/526 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 623 transition count 523
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 622 transition count 522
Applied a total of 5 rules in 32 ms. Remains 622 /626 variables (removed 4) and now considering 522/526 (removed 4) transitions.
// Phase 1: matrix 522 rows 622 cols
[2024-06-01 12:52:20] [INFO ] Computed 221 invariants in 4 ms
[2024-06-01 12:52:20] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-06-01 12:52:20] [INFO ] Invariant cache hit.
[2024-06-01 12:52:21] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
[2024-06-01 12:52:21] [INFO ] Redundant transitions in 3 ms returned []
Running 520 sub problems to find dead transitions.
[2024-06-01 12:52:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:52:31] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 522/1144 variables, 622/844 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 12:52:46] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:52:47] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1144 variables, 2/846 constraints. Problems are: Problem set: 0 solved, 520 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 1144/1144 variables, and 846 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 522/1144 variables, 622/846 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1144 variables, 520/1366 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 1366 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 3/3 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in SI_LTL mode, iteration 1 : 622/626 places, 522/526 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60925 ms. Remains : 622/626 places, 522/526 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-13 finished in 157012 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(G(p0)))'
Support contains 2 out of 1228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 1227 transition count 986
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 1086 transition count 986
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 282 place count 1086 transition count 886
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 482 place count 986 transition count 886
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 488 place count 980 transition count 880
Iterating global reduction 2 with 6 rules applied. Total rules applied 494 place count 980 transition count 880
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 494 place count 980 transition count 877
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 500 place count 977 transition count 877
Performed 353 Post agglomeration using F-continuation condition.Transition count delta: 353
Deduced a syphon composed of 353 places in 0 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 2 with 706 rules applied. Total rules applied 1206 place count 624 transition count 524
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1208 place count 622 transition count 522
Applied a total of 1208 rules in 105 ms. Remains 622 /1228 variables (removed 606) and now considering 522/1128 (removed 606) transitions.
// Phase 1: matrix 522 rows 622 cols
[2024-06-01 12:53:21] [INFO ] Computed 221 invariants in 3 ms
[2024-06-01 12:53:21] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-06-01 12:53:21] [INFO ] Invariant cache hit.
[2024-06-01 12:53:22] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
[2024-06-01 12:53:22] [INFO ] Redundant transitions in 4 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-01 12:53:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:53:30] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 11/222 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:53:46] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:53:46] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 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 622/1144 variables, and 224 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 11/224 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 522/1144 variables, 622/846 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 519/1365 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 1365 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 3/3 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in SI_LTL mode, iteration 1 : 622/1228 places, 522/1128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60950 ms. Remains : 622/1228 places, 522/1128 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-15
Product exploration explored 100000 steps with 72 reset in 562 ms.
Product exploration explored 100000 steps with 72 reset in 667 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 173 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 522/522 transitions.
Applied a total of 0 rules in 10 ms. Remains 622 /622 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2024-06-01 12:54:24] [INFO ] Invariant cache hit.
[2024-06-01 12:54:24] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-06-01 12:54:24] [INFO ] Invariant cache hit.
[2024-06-01 12:54:25] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2024-06-01 12:54:25] [INFO ] Redundant transitions in 3 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-01 12:54:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:54:32] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 11/222 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:54:48] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:54:48] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1144 variables, and 224 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 11/224 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 522/1144 variables, 622/846 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 519/1365 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 1365 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 3/3 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60866 ms. Remains : 622/622 places, 522/522 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 178 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 72 reset in 558 ms.
Product exploration explored 100000 steps with 73 reset in 691 ms.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 522/522 transitions.
Applied a total of 0 rules in 10 ms. Remains 622 /622 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2024-06-01 12:55:26] [INFO ] Invariant cache hit.
[2024-06-01 12:55:27] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-06-01 12:55:27] [INFO ] Invariant cache hit.
[2024-06-01 12:55:27] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
[2024-06-01 12:55:27] [INFO ] Redundant transitions in 4 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-01 12:55:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:55:35] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 11/222 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:55:51] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:55:51] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1144 variables, and 224 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 11/224 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 522/1144 variables, 622/846 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 519/1365 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 1365 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 3/3 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60867 ms. Remains : 622/622 places, 522/522 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-15 finished in 186232 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((G((F(p0)&&F(G(!p1))))||G((p2 U p3)))))'
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(X(F(p0)))||F(p1)))'
Found a Shortening insensitive property : ShieldPPPs-PT-020B-LTLCardinality-08
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1227 transition count 987
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 1087 transition count 987
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 280 place count 1087 transition count 886
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 482 place count 986 transition count 886
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 488 place count 980 transition count 880
Iterating global reduction 2 with 6 rules applied. Total rules applied 494 place count 980 transition count 880
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 494 place count 980 transition count 877
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 500 place count 977 transition count 877
Performed 353 Post agglomeration using F-continuation condition.Transition count delta: 353
Deduced a syphon composed of 353 places in 1 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 2 with 706 rules applied. Total rules applied 1206 place count 624 transition count 524
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1208 place count 622 transition count 522
Applied a total of 1208 rules in 102 ms. Remains 622 /1228 variables (removed 606) and now considering 522/1128 (removed 606) transitions.
// Phase 1: matrix 522 rows 622 cols
[2024-06-01 12:56:28] [INFO ] Computed 221 invariants in 4 ms
[2024-06-01 12:56:28] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-06-01 12:56:28] [INFO ] Invariant cache hit.
[2024-06-01 12:56:29] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Running 519 sub problems to find dead transitions.
[2024-06-01 12:56:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:56:37] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:56:37] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:56:37] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:56:37] [INFO ] Deduced a trap composed of 56 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:56:37] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:56:37] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:56:38] [INFO ] Deduced a trap composed of 103 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:56:38] [INFO ] Deduced a trap composed of 119 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:56:38] [INFO ] Deduced a trap composed of 130 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:56:38] [INFO ] Deduced a trap composed of 143 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:56:38] [INFO ] Deduced a trap composed of 162 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:56:38] [INFO ] Deduced a trap composed of 179 places in 72 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 12/230 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:56:44] [INFO ] Deduced a trap composed of 102 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:56:44] [INFO ] Deduced a trap composed of 102 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:56:44] [INFO ] Deduced a trap composed of 103 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:56:49] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:56:49] [INFO ] Deduced a trap composed of 53 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:56:49] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:56:49] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:56:50] [INFO ] Deduced a trap composed of 116 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:56:50] [INFO ] Deduced a trap composed of 116 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 6/239 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1144 variables, and 239 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 218/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 21/239 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:57:03] [INFO ] Deduced a trap composed of 144 places in 63 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:57:09] [INFO ] Deduced a trap composed of 115 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:57:09] [INFO ] Deduced a trap composed of 117 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:57:09] [INFO ] Deduced a trap composed of 115 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:57:09] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:57:14] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:57:14] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:57:14] [INFO ] Deduced a trap composed of 70 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:57:14] [INFO ] Deduced a trap composed of 69 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:57:14] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:57:14] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:57:14] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:57:14] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:57:14] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:57:15] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:57:15] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:57:15] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:57:15] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:57:15] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:57:15] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:57:15] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:57:15] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:57:15] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:57:15] [INFO ] Deduced a trap composed of 114 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 19/263 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 12:57:17] [INFO ] Deduced a trap composed of 54 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:57:21] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:57:21] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:57:21] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/621 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 7 (OVERLAPS) 1/622 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1144 variables, and 270 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 0/519 constraints, Known Traps: 49/49 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LI_LTL mode, iteration 1 : 622/1228 places, 522/1128 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 60951 ms. Remains : 622/1228 places, 522/1128 transitions.
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-08
Stuttering criterion allowed to conclude after 7909 steps with 12 reset in 42 ms.
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-08 finished in 61207 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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)))'
Found a Shortening insensitive property : ShieldPPPs-PT-020B-LTLCardinality-09
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Support contains 5 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1228/1228 places, 1128/1128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 1227 transition count 988
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 278 place count 1088 transition count 988
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 278 place count 1088 transition count 887
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 480 place count 987 transition count 887
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 486 place count 981 transition count 881
Iterating global reduction 2 with 6 rules applied. Total rules applied 492 place count 981 transition count 881
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 492 place count 981 transition count 878
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 498 place count 978 transition count 878
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 349
Deduced a syphon composed of 349 places in 0 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 2 with 698 rules applied. Total rules applied 1196 place count 629 transition count 529
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1198 place count 627 transition count 527
Applied a total of 1198 rules in 117 ms. Remains 627 /1228 variables (removed 601) and now considering 527/1128 (removed 601) transitions.
// Phase 1: matrix 527 rows 627 cols
[2024-06-01 12:57:29] [INFO ] Computed 221 invariants in 2 ms
[2024-06-01 12:57:29] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-06-01 12:57:29] [INFO ] Invariant cache hit.
[2024-06-01 12:57:30] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
Running 522 sub problems to find dead transitions.
[2024-06-01 12:57:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:57:38] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:57:38] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:57:39] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:57:39] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:57:40] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:57:40] [INFO ] Deduced a trap composed of 69 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:57:40] [INFO ] Deduced a trap composed of 82 places in 48 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 7/206 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 3/627 variables, 22/228 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:57:52] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:57:52] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:57:52] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:57:52] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:57:52] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:57:52] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:57:52] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:57:54] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:57:54] [INFO ] Deduced a trap composed of 58 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:57:54] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:57:54] [INFO ] Deduced a trap composed of 91 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:57:54] [INFO ] Deduced a trap composed of 102 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:57:55] [INFO ] Deduced a trap composed of 114 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:57:55] [INFO ] Deduced a trap composed of 134 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:57:55] [INFO ] Deduced a trap composed of 147 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:57:55] [INFO ] Deduced a trap composed of 160 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:57:55] [INFO ] Deduced a trap composed of 177 places in 72 ms of which 1 ms to minimize.
[2024-06-01 12:57:55] [INFO ] Deduced a trap composed of 191 places in 78 ms of which 1 ms to minimize.
[2024-06-01 12:57:56] [INFO ] Deduced a trap composed of 203 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:57:56] [INFO ] Deduced a trap composed of 220 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 627/1154 variables, and 248 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/627 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 9/208 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 3/627 variables, 22/230 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 18/248 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:58:09] [INFO ] Deduced a trap composed of 89 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:58:09] [INFO ] Deduced a trap composed of 89 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:58:09] [INFO ] Deduced a trap composed of 89 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:58:09] [INFO ] Deduced a trap composed of 88 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:58:09] [INFO ] Deduced a trap composed of 87 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:58:10] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:58:10] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:58:10] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:58:10] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:58:10] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:58:10] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:58:10] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:58:10] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:58:10] [INFO ] Deduced a trap composed of 100 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:58:11] [INFO ] Deduced a trap composed of 126 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:58:11] [INFO ] Deduced a trap composed of 140 places in 72 ms of which 1 ms to minimize.
[2024-06-01 12:58:11] [INFO ] Deduced a trap composed of 170 places in 81 ms of which 2 ms to minimize.
[2024-06-01 12:58:11] [INFO ] Deduced a trap composed of 187 places in 86 ms of which 2 ms to minimize.
[2024-06-01 12:58:11] [INFO ] Deduced a trap composed of 185 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 19/267 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:58:16] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:58:16] [INFO ] Deduced a trap composed of 71 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:58:16] [INFO ] Deduced a trap composed of 71 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:58:16] [INFO ] Deduced a trap composed of 70 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:58:16] [INFO ] Deduced a trap composed of 73 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:58:16] [INFO ] Deduced a trap composed of 71 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:58:17] [INFO ] Deduced a trap composed of 71 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:58:17] [INFO ] Deduced a trap composed of 71 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:58:17] [INFO ] Deduced a trap composed of 71 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:58:17] [INFO ] Deduced a trap composed of 71 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:58:17] [INFO ] Deduced a trap composed of 70 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:58:17] [INFO ] Deduced a trap composed of 99 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:58:17] [INFO ] Deduced a trap composed of 114 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:58:17] [INFO ] Deduced a trap composed of 132 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:58:18] [INFO ] Deduced a trap composed of 143 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:58:18] [INFO ] Deduced a trap composed of 178 places in 71 ms of which 2 ms to minimize.
[2024-06-01 12:58:18] [INFO ] Deduced a trap composed of 186 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:58:18] [INFO ] Deduced a trap composed of 198 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:58:19] [INFO ] Deduced a trap composed of 215 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 19/286 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:58:23] [INFO ] Deduced a trap composed of 58 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:58:23] [INFO ] Deduced a trap composed of 58 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:58:23] [INFO ] Deduced a trap composed of 56 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:58:23] [INFO ] Deduced a trap composed of 58 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:58:23] [INFO ] Deduced a trap composed of 56 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 57 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 57 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 58 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 56 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 56 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 56 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 85 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 116 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:58:25] [INFO ] Deduced a trap composed of 175 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:58:25] [INFO ] Deduced a trap composed of 202 places in 95 ms of which 2 ms to minimize.
[2024-06-01 12:58:25] [INFO ] Deduced a trap composed of 201 places in 100 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 17/303 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 1)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 1)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 1)
(s133 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/1154 variables, and 303 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/627 constraints, PredecessorRefiner: 0/522 constraints, Known Traps: 82/82 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in LI_LTL mode, iteration 1 : 627/1228 places, 527/1128 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 60934 ms. Remains : 627/1228 places, 527/1128 transitions.
Running random walk in product with property : ShieldPPPs-PT-020B-LTLCardinality-09
Product exploration explored 100000 steps with 25754 reset in 387 ms.
Product exploration explored 100000 steps with 25703 reset in 455 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 176 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:58:31] [INFO ] Invariant cache hit.
[2024-06-01 12:58:32] [INFO ] [Real]Absence check using 221 positive place invariants in 78 ms returned sat
[2024-06-01 12:58:33] [INFO ] [Real]Absence check using state equation in 1059 ms returned sat
[2024-06-01 12:58:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:58:33] [INFO ] [Nat]Absence check using 221 positive place invariants in 76 ms returned sat
[2024-06-01 12:58:34] [INFO ] [Nat]Absence check using state equation in 683 ms returned sat
[2024-06-01 12:58:34] [INFO ] Computed and/alt/rep : 522/1039/522 causal constraints (skipped 0 transitions) in 26 ms.
[2024-06-01 12:58:39] [INFO ] Added : 437 causal constraints over 88 iterations in 5318 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 527/527 transitions.
Applied a total of 0 rules in 16 ms. Remains 627 /627 variables (removed 0) and now considering 527/527 (removed 0) transitions.
[2024-06-01 12:58:39] [INFO ] Invariant cache hit.
[2024-06-01 12:58:39] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-06-01 12:58:39] [INFO ] Invariant cache hit.
[2024-06-01 12:58:40] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2024-06-01 12:58:40] [INFO ] Redundant transitions in 4 ms returned []
Running 522 sub problems to find dead transitions.
[2024-06-01 12:58:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:58:48] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:58:48] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:58:49] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:58:49] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:58:50] [INFO ] Deduced a trap composed of 54 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:58:50] [INFO ] Deduced a trap composed of 69 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:58:50] [INFO ] Deduced a trap composed of 82 places in 46 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 7/206 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 3/627 variables, 22/228 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:59:02] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:59:02] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 5 ms to minimize.
[2024-06-01 12:59:02] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:59:02] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:59:02] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:59:02] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:59:02] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:59:04] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:59:04] [INFO ] Deduced a trap composed of 58 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:59:04] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:59:04] [INFO ] Deduced a trap composed of 91 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:59:04] [INFO ] Deduced a trap composed of 102 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:59:05] [INFO ] Deduced a trap composed of 114 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:59:05] [INFO ] Deduced a trap composed of 134 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:59:05] [INFO ] Deduced a trap composed of 147 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:59:05] [INFO ] Deduced a trap composed of 160 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:59:05] [INFO ] Deduced a trap composed of 177 places in 76 ms of which 1 ms to minimize.
[2024-06-01 12:59:06] [INFO ] Deduced a trap composed of 191 places in 70 ms of which 1 ms to minimize.
[2024-06-01 12:59:06] [INFO ] Deduced a trap composed of 203 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:59:06] [INFO ] Deduced a trap composed of 220 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 627/1154 variables, and 248 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/627 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 9/208 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 3/627 variables, 22/230 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 18/248 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:59:20] [INFO ] Deduced a trap composed of 89 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:59:20] [INFO ] Deduced a trap composed of 89 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:59:20] [INFO ] Deduced a trap composed of 89 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:59:20] [INFO ] Deduced a trap composed of 88 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:59:20] [INFO ] Deduced a trap composed of 87 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:59:20] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:59:20] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:59:20] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:59:20] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:59:20] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:59:20] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:59:20] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:59:21] [INFO ] Deduced a trap composed of 83 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:59:21] [INFO ] Deduced a trap composed of 100 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:59:21] [INFO ] Deduced a trap composed of 126 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:59:21] [INFO ] Deduced a trap composed of 140 places in 73 ms of which 1 ms to minimize.
[2024-06-01 12:59:22] [INFO ] Deduced a trap composed of 170 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:59:22] [INFO ] Deduced a trap composed of 187 places in 85 ms of which 1 ms to minimize.
[2024-06-01 12:59:22] [INFO ] Deduced a trap composed of 185 places in 83 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 19/267 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:59:27] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:59:27] [INFO ] Deduced a trap composed of 71 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:59:27] [INFO ] Deduced a trap composed of 71 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:59:27] [INFO ] Deduced a trap composed of 70 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:59:27] [INFO ] Deduced a trap composed of 73 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:59:27] [INFO ] Deduced a trap composed of 71 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:59:27] [INFO ] Deduced a trap composed of 71 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:59:27] [INFO ] Deduced a trap composed of 71 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:59:27] [INFO ] Deduced a trap composed of 71 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:59:27] [INFO ] Deduced a trap composed of 71 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:59:27] [INFO ] Deduced a trap composed of 70 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:59:27] [INFO ] Deduced a trap composed of 99 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 114 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 132 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 143 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 178 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:59:29] [INFO ] Deduced a trap composed of 186 places in 73 ms of which 1 ms to minimize.
[2024-06-01 12:59:29] [INFO ] Deduced a trap composed of 198 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:59:29] [INFO ] Deduced a trap composed of 215 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 19/286 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:59:34] [INFO ] Deduced a trap composed of 58 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:59:34] [INFO ] Deduced a trap composed of 58 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:59:34] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:59:34] [INFO ] Deduced a trap composed of 58 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:59:34] [INFO ] Deduced a trap composed of 56 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:59:34] [INFO ] Deduced a trap composed of 57 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:59:34] [INFO ] Deduced a trap composed of 57 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:59:34] [INFO ] Deduced a trap composed of 58 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:59:34] [INFO ] Deduced a trap composed of 56 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:59:34] [INFO ] Deduced a trap composed of 56 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:59:34] [INFO ] Deduced a trap composed of 56 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:59:34] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:59:34] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:59:35] [INFO ] Deduced a trap composed of 116 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:59:35] [INFO ] Deduced a trap composed of 175 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:59:36] [INFO ] Deduced a trap composed of 202 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:59:36] [INFO ] Deduced a trap composed of 201 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 17/303 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/1154 variables, and 303 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/627 constraints, PredecessorRefiner: 0/522 constraints, Known Traps: 82/82 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60867 ms. Remains : 627/627 places, 527/527 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7 steps (0 resets) in 6 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:59:41] [INFO ] Invariant cache hit.
[2024-06-01 12:59:41] [INFO ] [Real]Absence check using 221 positive place invariants in 81 ms returned sat
[2024-06-01 12:59:42] [INFO ] [Real]Absence check using state equation in 1123 ms returned sat
[2024-06-01 12:59:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:59:42] [INFO ] [Nat]Absence check using 221 positive place invariants in 75 ms returned sat
[2024-06-01 12:59:43] [INFO ] [Nat]Absence check using state equation in 708 ms returned sat
[2024-06-01 12:59:43] [INFO ] Computed and/alt/rep : 522/1039/522 causal constraints (skipped 0 transitions) in 27 ms.
[2024-06-01 12:59:49] [INFO ] Added : 437 causal constraints over 88 iterations in 5518 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25658 reset in 393 ms.
Product exploration explored 100000 steps with 25257 reset in 472 ms.
Support contains 5 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 527/527 transitions.
Applied a total of 0 rules in 10 ms. Remains 627 /627 variables (removed 0) and now considering 527/527 (removed 0) transitions.
[2024-06-01 12:59:50] [INFO ] Invariant cache hit.
[2024-06-01 12:59:50] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-06-01 12:59:50] [INFO ] Invariant cache hit.
[2024-06-01 12:59:50] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
[2024-06-01 12:59:50] [INFO ] Redundant transitions in 3 ms returned []
Running 522 sub problems to find dead transitions.
[2024-06-01 12:59:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 12:59:58] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:59:58] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:00:00] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:00:00] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:00:00] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:00:00] [INFO ] Deduced a trap composed of 69 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:00:00] [INFO ] Deduced a trap composed of 82 places in 48 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 7/206 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 3/627 variables, 22/228 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 13:00:12] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:00:12] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:00:12] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:00:13] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:00:13] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:00:13] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:00:13] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:00:14] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:00:14] [INFO ] Deduced a trap composed of 58 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:00:15] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:00:15] [INFO ] Deduced a trap composed of 91 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:00:15] [INFO ] Deduced a trap composed of 102 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:00:15] [INFO ] Deduced a trap composed of 114 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:00:15] [INFO ] Deduced a trap composed of 134 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:00:15] [INFO ] Deduced a trap composed of 147 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:00:16] [INFO ] Deduced a trap composed of 160 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:00:16] [INFO ] Deduced a trap composed of 177 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:00:16] [INFO ] Deduced a trap composed of 191 places in 74 ms of which 2 ms to minimize.
[2024-06-01 13:00:16] [INFO ] Deduced a trap composed of 203 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:00:16] [INFO ] Deduced a trap composed of 220 places in 86 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.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 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 1.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 1.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 1.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 1.0)
(s443 0.0)
(s444 0.0)
(s445 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 627/1154 variables, and 248 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/627 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 9/208 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 3/627 variables, 22/230 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 18/248 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 13:00:30] [INFO ] Deduced a trap composed of 89 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:00:30] [INFO ] Deduced a trap composed of 89 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:00:30] [INFO ] Deduced a trap composed of 89 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:00:30] [INFO ] Deduced a trap composed of 88 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:00:30] [INFO ] Deduced a trap composed of 87 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:00:30] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:00:30] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:00:30] [INFO ] Deduced a trap composed of 54 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:00:30] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:00:30] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:00:30] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:00:31] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:00:31] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:00:31] [INFO ] Deduced a trap composed of 100 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:00:31] [INFO ] Deduced a trap composed of 126 places in 66 ms of which 2 ms to minimize.
[2024-06-01 13:00:31] [INFO ] Deduced a trap composed of 140 places in 65 ms of which 2 ms to minimize.
[2024-06-01 13:00:32] [INFO ] Deduced a trap composed of 170 places in 81 ms of which 2 ms to minimize.
[2024-06-01 13:00:32] [INFO ] Deduced a trap composed of 187 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:00:32] [INFO ] Deduced a trap composed of 185 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 19/267 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 13:00:37] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:00:37] [INFO ] Deduced a trap composed of 71 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:00:37] [INFO ] Deduced a trap composed of 71 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:00:37] [INFO ] Deduced a trap composed of 70 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:00:37] [INFO ] Deduced a trap composed of 73 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:00:37] [INFO ] Deduced a trap composed of 71 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:00:37] [INFO ] Deduced a trap composed of 71 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:00:37] [INFO ] Deduced a trap composed of 71 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:00:37] [INFO ] Deduced a trap composed of 71 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:00:37] [INFO ] Deduced a trap composed of 71 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:00:38] [INFO ] Deduced a trap composed of 70 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:00:38] [INFO ] Deduced a trap composed of 99 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:00:38] [INFO ] Deduced a trap composed of 114 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:00:38] [INFO ] Deduced a trap composed of 132 places in 62 ms of which 2 ms to minimize.
[2024-06-01 13:00:38] [INFO ] Deduced a trap composed of 143 places in 62 ms of which 2 ms to minimize.
[2024-06-01 13:00:39] [INFO ] Deduced a trap composed of 178 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:00:39] [INFO ] Deduced a trap composed of 186 places in 74 ms of which 2 ms to minimize.
[2024-06-01 13:00:39] [INFO ] Deduced a trap composed of 198 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:00:39] [INFO ] Deduced a trap composed of 215 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 19/286 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 13:00:44] [INFO ] Deduced a trap composed of 58 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:00:44] [INFO ] Deduced a trap composed of 58 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:00:44] [INFO ] Deduced a trap composed of 56 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:00:44] [INFO ] Deduced a trap composed of 58 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:00:44] [INFO ] Deduced a trap composed of 56 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:00:44] [INFO ] Deduced a trap composed of 57 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:00:44] [INFO ] Deduced a trap composed of 57 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:00:44] [INFO ] Deduced a trap composed of 58 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:00:44] [INFO ] Deduced a trap composed of 56 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:00:44] [INFO ] Deduced a trap composed of 56 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:00:44] [INFO ] Deduced a trap composed of 56 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:00:44] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:00:45] [INFO ] Deduced a trap composed of 85 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:00:45] [INFO ] Deduced a trap composed of 116 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:00:45] [INFO ] Deduced a trap composed of 175 places in 72 ms of which 2 ms to minimize.
[2024-06-01 13:00:46] [INFO ] Deduced a trap composed of 202 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:00:46] [INFO ] Deduced a trap composed of 201 places in 73 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 17/303 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/1154 variables, and 303 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/627 constraints, PredecessorRefiner: 0/522 constraints, Known Traps: 82/82 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60846 ms. Remains : 627/627 places, 527/527 transitions.
Treatment of property ShieldPPPs-PT-020B-LTLCardinality-09 finished in 201739 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)) U G(p1)))'
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(G(p0)))'
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((G(F(p0))&&(G(p1)||X(p2)))))'
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(G(p0)))'
[2024-06-01 13:00:51] [INFO ] Flatten gal took : 45 ms
[2024-06-01 13:00:51] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 13:00:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1228 places, 1128 transitions and 3216 arcs took 9 ms.
Total runtime 2014099 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

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

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

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="ShieldPPPs-PT-020B"
export BK_EXAMINATION="LTLCardinality"
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 ShieldPPPs-PT-020B, examination is LTLCardinality"
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-171683761100459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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