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.r114-smll-171624275400140.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 itstools
Input is DLCround-PT-04b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-171624275400140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 924K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K Apr 13 13:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 48K Apr 13 13:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 13 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 13 13:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 547K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DLCround-PT-04b-LTLFireability-00
FORMULA_NAME DLCround-PT-04b-LTLFireability-01
FORMULA_NAME DLCround-PT-04b-LTLFireability-02
FORMULA_NAME DLCround-PT-04b-LTLFireability-03
FORMULA_NAME DLCround-PT-04b-LTLFireability-04
FORMULA_NAME DLCround-PT-04b-LTLFireability-05
FORMULA_NAME DLCround-PT-04b-LTLFireability-06
FORMULA_NAME DLCround-PT-04b-LTLFireability-07
FORMULA_NAME DLCround-PT-04b-LTLFireability-08
FORMULA_NAME DLCround-PT-04b-LTLFireability-09
FORMULA_NAME DLCround-PT-04b-LTLFireability-10
FORMULA_NAME DLCround-PT-04b-LTLFireability-11
FORMULA_NAME DLCround-PT-04b-LTLFireability-12
FORMULA_NAME DLCround-PT-04b-LTLFireability-13
FORMULA_NAME DLCround-PT-04b-LTLFireability-14
FORMULA_NAME DLCround-PT-04b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716347917264

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 03:18:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 03:18:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:18:40] [INFO ] Load time of PNML (sax parser for PT used): 468 ms
[2024-05-22 03:18:40] [INFO ] Transformed 1680 places.
[2024-05-22 03:18:40] [INFO ] Transformed 2364 transitions.
[2024-05-22 03:18:40] [INFO ] Found NUPN structural information;
[2024-05-22 03:18:40] [INFO ] Parsed PT model containing 1680 places and 2364 transitions and 6156 arcs in 751 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DLCround-PT-04b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 1680 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1680/1680 places, 2364/2364 transitions.
Discarding 284 places :
Symmetric choice reduction at 0 with 284 rule applications. Total rules 284 place count 1396 transition count 2080
Iterating global reduction 0 with 284 rules applied. Total rules applied 568 place count 1396 transition count 2080
Discarding 216 places :
Symmetric choice reduction at 0 with 216 rule applications. Total rules 784 place count 1180 transition count 1864
Iterating global reduction 0 with 216 rules applied. Total rules applied 1000 place count 1180 transition count 1864
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 1004 place count 1180 transition count 1860
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 1047 place count 1137 transition count 1787
Iterating global reduction 1 with 43 rules applied. Total rules applied 1090 place count 1137 transition count 1787
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 1118 place count 1109 transition count 1759
Iterating global reduction 1 with 28 rules applied. Total rules applied 1146 place count 1109 transition count 1759
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1148 place count 1109 transition count 1757
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1162 place count 1095 transition count 1743
Iterating global reduction 2 with 14 rules applied. Total rules applied 1176 place count 1095 transition count 1743
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1189 place count 1082 transition count 1730
Iterating global reduction 2 with 13 rules applied. Total rules applied 1202 place count 1082 transition count 1730
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1213 place count 1071 transition count 1719
Iterating global reduction 2 with 11 rules applied. Total rules applied 1224 place count 1071 transition count 1719
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1232 place count 1063 transition count 1711
Iterating global reduction 2 with 8 rules applied. Total rules applied 1240 place count 1063 transition count 1711
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1247 place count 1056 transition count 1704
Iterating global reduction 2 with 7 rules applied. Total rules applied 1254 place count 1056 transition count 1704
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1261 place count 1049 transition count 1697
Iterating global reduction 2 with 7 rules applied. Total rules applied 1268 place count 1049 transition count 1697
Applied a total of 1268 rules in 1152 ms. Remains 1049 /1680 variables (removed 631) and now considering 1697/2364 (removed 667) transitions.
// Phase 1: matrix 1697 rows 1049 cols
[2024-05-22 03:18:42] [INFO ] Computed 69 invariants in 64 ms
[2024-05-22 03:18:43] [INFO ] Implicit Places using invariants in 1178 ms returned []
[2024-05-22 03:18:43] [INFO ] Invariant cache hit.
[2024-05-22 03:18:45] [INFO ] Implicit Places using invariants and state equation in 1728 ms returned []
Implicit Place search using SMT with State Equation took 2973 ms to find 0 implicit places.
Running 1696 sub problems to find dead transitions.
[2024-05-22 03:18:45] [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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1048/2746 variables, and 0 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30155 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1049 constraints, PredecessorRefiner: 1696/1696 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1696 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 1048/2746 variables, and 0 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1049 constraints, PredecessorRefiner: 0/1696 constraints, Known Traps: 0/0 constraints]
After SMT, in 61439ms problems are : Problem set: 0 solved, 1696 unsolved
Search for dead transitions found 0 dead transitions in 61525ms
Starting structural reductions in LTL mode, iteration 1 : 1049/1680 places, 1697/2364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65701 ms. Remains : 1049/1680 places, 1697/2364 transitions.
Support contains 42 out of 1049 places after structural reductions.
[2024-05-22 03:19:47] [INFO ] Flatten gal took : 271 ms
[2024-05-22 03:19:47] [INFO ] Flatten gal took : 155 ms
[2024-05-22 03:19:47] [INFO ] Input system was already deterministic with 1697 transitions.
RANDOM walk for 40000 steps (8 resets) in 2579 ms. (15 steps per ms) remains 3/31 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 3/3 properties
[2024-05-22 03:19:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 417/425 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 624/1049 variables, 62/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1049 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1697/2746 variables, 1049/1118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2746 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/2746 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2746/2746 variables, and 1118 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1336 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 1049/1049 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 417/425 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 624/1049 variables, 62/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1049 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1697/2746 variables, 1049/1118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2746 variables, 3/1121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2746 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/2746 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2746/2746 variables, and 1121 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1500 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 1049/1049 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2867ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 24426 steps, including 67 resets, run visited all 3 properties in 121 ms. (steps per millisecond=201 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 132 ms.
FORMULA DLCround-PT-04b-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 138 stabilizing places and 138 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' '!(F(p0))'
Support contains 2 out of 1049 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1049/1049 places, 1697/1697 transitions.
Graph (trivial) has 979 edges and 1049 vertex of which 301 / 1049 are part of one of the 24 SCC in 9 ms
Free SCC test removed 277 places
Ensure Unique test removed 300 transitions
Reduce isomorphic transitions removed 300 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 196 place count 771 transition count 1201
Reduce places removed 195 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 226 rules applied. Total rules applied 422 place count 576 transition count 1170
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 23 rules applied. Total rules applied 445 place count 557 transition count 1166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 447 place count 555 transition count 1166
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 72 Pre rules applied. Total rules applied 447 place count 555 transition count 1094
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 591 place count 483 transition count 1094
Discarding 44 places :
Symmetric choice reduction at 4 with 44 rule applications. Total rules 635 place count 439 transition count 894
Iterating global reduction 4 with 44 rules applied. Total rules applied 679 place count 439 transition count 894
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 683 place count 439 transition count 890
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 683 place count 439 transition count 888
Deduced a syphon composed of 2 places in 14 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 687 place count 437 transition count 888
Performed 158 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 5 with 316 rules applied. Total rules applied 1003 place count 279 transition count 725
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1008 place count 279 transition count 720
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1022 place count 265 transition count 620
Iterating global reduction 6 with 14 rules applied. Total rules applied 1036 place count 265 transition count 620
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1050 place count 265 transition count 606
Performed 16 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 1082 place count 249 transition count 699
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1086 place count 245 transition count 653
Iterating global reduction 7 with 4 rules applied. Total rules applied 1090 place count 245 transition count 653
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 1111 place count 245 transition count 632
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 8 with 23 rules applied. Total rules applied 1134 place count 245 transition count 609
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1143 place count 236 transition count 591
Iterating global reduction 8 with 9 rules applied. Total rules applied 1152 place count 236 transition count 591
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1161 place count 227 transition count 517
Iterating global reduction 8 with 9 rules applied. Total rules applied 1170 place count 227 transition count 517
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 1179 place count 227 transition count 508
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1180 place count 226 transition count 507
Applied a total of 1180 rules in 565 ms. Remains 226 /1049 variables (removed 823) and now considering 507/1697 (removed 1190) transitions.
[2024-05-22 03:19:52] [INFO ] Flow matrix only has 488 transitions (discarded 19 similar events)
// Phase 1: matrix 488 rows 226 cols
[2024-05-22 03:19:52] [INFO ] Computed 69 invariants in 3 ms
[2024-05-22 03:19:53] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-22 03:19:53] [INFO ] Flow matrix only has 488 transitions (discarded 19 similar events)
[2024-05-22 03:19:53] [INFO ] Invariant cache hit.
[2024-05-22 03:19:53] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-22 03:19:53] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
[2024-05-22 03:19:53] [INFO ] Redundant transitions in 39 ms returned []
Running 454 sub problems to find dead transitions.
[2024-05-22 03:19:53] [INFO ] Flow matrix only has 488 transitions (discarded 19 similar events)
[2024-05-22 03:19:53] [INFO ] Invariant cache hit.
[2024-05-22 03:19:53] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 4 (OVERLAPS) 487/713 variables, 226/295 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/713 variables, 32/327 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 713/714 variables, and 327 constraints, problems are : Problem set: 0 solved, 454 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 226/226 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 454/454 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 4 (OVERLAPS) 487/713 variables, 226/295 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/713 variables, 32/327 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 454/781 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 713/714 variables, and 781 constraints, problems are : Problem set: 0 solved, 454 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 226/226 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 454/454 constraints, Known Traps: 0/0 constraints]
After SMT, in 60433ms problems are : Problem set: 0 solved, 454 unsolved
Search for dead transitions found 0 dead transitions in 60441ms
Starting structural reductions in SI_LTL mode, iteration 1 : 226/1049 places, 507/1697 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61848 ms. Remains : 226/1049 places, 507/1697 transitions.
Stuttering acceptance computed with spot in 365 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA DLCround-PT-04b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-01 finished in 62331 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((p0||(!p0 U (p1||G(!p0))))))'
Support contains 4 out of 1049 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1049/1049 places, 1697/1697 transitions.
Graph (trivial) has 974 edges and 1049 vertex of which 294 / 1049 are part of one of the 23 SCC in 3 ms
Free SCC test removed 271 places
Ensure Unique test removed 293 transitions
Reduce isomorphic transitions removed 293 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 197 place count 777 transition count 1207
Reduce places removed 196 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 227 rules applied. Total rules applied 424 place count 581 transition count 1176
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 23 rules applied. Total rules applied 447 place count 562 transition count 1172
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 450 place count 560 transition count 1171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 451 place count 559 transition count 1171
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 73 Pre rules applied. Total rules applied 451 place count 559 transition count 1098
Deduced a syphon composed of 73 places in 4 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 597 place count 486 transition count 1098
Discarding 44 places :
Symmetric choice reduction at 5 with 44 rule applications. Total rules 641 place count 442 transition count 898
Iterating global reduction 5 with 44 rules applied. Total rules applied 685 place count 442 transition count 898
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 689 place count 442 transition count 894
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 689 place count 442 transition count 892
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 693 place count 440 transition count 892
Performed 160 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 6 with 320 rules applied. Total rules applied 1013 place count 280 transition count 727
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1018 place count 280 transition count 722
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1032 place count 266 transition count 619
Iterating global reduction 7 with 14 rules applied. Total rules applied 1046 place count 266 transition count 619
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1059 place count 266 transition count 606
Performed 16 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 1091 place count 250 transition count 700
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1095 place count 246 transition count 654
Iterating global reduction 8 with 4 rules applied. Total rules applied 1099 place count 246 transition count 654
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 1120 place count 246 transition count 633
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 9 with 25 rules applied. Total rules applied 1145 place count 246 transition count 608
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1154 place count 237 transition count 590
Iterating global reduction 9 with 9 rules applied. Total rules applied 1163 place count 237 transition count 590
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1172 place count 228 transition count 516
Iterating global reduction 9 with 9 rules applied. Total rules applied 1181 place count 228 transition count 516
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1190 place count 228 transition count 507
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1191 place count 227 transition count 506
Applied a total of 1191 rules in 311 ms. Remains 227 /1049 variables (removed 822) and now considering 506/1697 (removed 1191) transitions.
[2024-05-22 03:20:54] [INFO ] Flow matrix only has 488 transitions (discarded 18 similar events)
// Phase 1: matrix 488 rows 227 cols
[2024-05-22 03:20:54] [INFO ] Computed 69 invariants in 4 ms
[2024-05-22 03:20:55] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-22 03:20:55] [INFO ] Flow matrix only has 488 transitions (discarded 18 similar events)
[2024-05-22 03:20:55] [INFO ] Invariant cache hit.
[2024-05-22 03:20:55] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 03:20:55] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2024-05-22 03:20:55] [INFO ] Redundant transitions in 11 ms returned []
Running 451 sub problems to find dead transitions.
[2024-05-22 03:20:55] [INFO ] Flow matrix only has 488 transitions (discarded 18 similar events)
[2024-05-22 03:20:55] [INFO ] Invariant cache hit.
[2024-05-22 03:20:55] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 2 (OVERLAPS) 1/227 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 4 (OVERLAPS) 487/714 variables, 227/296 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/714 variables, 33/329 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/714 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 714/715 variables, and 329 constraints, problems are : Problem set: 0 solved, 451 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 227/227 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 451/451 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 2 (OVERLAPS) 1/227 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 4 (OVERLAPS) 487/714 variables, 227/296 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/714 variables, 33/329 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/714 variables, 451/780 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/714 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 1)
(s53 1)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 714/715 variables, and 780 constraints, problems are : Problem set: 0 solved, 451 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 227/227 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 451/451 constraints, Known Traps: 0/0 constraints]
After SMT, in 60307ms problems are : Problem set: 0 solved, 451 unsolved
Search for dead transitions found 0 dead transitions in 60315ms
Starting structural reductions in SI_LTL mode, iteration 1 : 227/1049 places, 506/1697 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61302 ms. Remains : 227/1049 places, 506/1697 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, false, (AND p0 (NOT p1))]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1719 steps with 0 reset in 90 ms.
FORMULA DLCround-PT-04b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-02 finished in 61555 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 2 out of 1049 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1049/1049 places, 1697/1697 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1032 transition count 1673
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1032 transition count 1673
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 47 place count 1019 transition count 1658
Iterating global reduction 0 with 13 rules applied. Total rules applied 60 place count 1019 transition count 1658
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 1019 transition count 1657
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 1012 transition count 1650
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 1012 transition count 1650
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 77 place count 1012 transition count 1648
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 81 place count 1008 transition count 1644
Iterating global reduction 2 with 4 rules applied. Total rules applied 85 place count 1008 transition count 1644
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 1006 transition count 1642
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 1006 transition count 1642
Applied a total of 89 rules in 252 ms. Remains 1006 /1049 variables (removed 43) and now considering 1642/1697 (removed 55) transitions.
// Phase 1: matrix 1642 rows 1006 cols
[2024-05-22 03:21:56] [INFO ] Computed 69 invariants in 14 ms
[2024-05-22 03:21:57] [INFO ] Implicit Places using invariants in 761 ms returned []
[2024-05-22 03:21:57] [INFO ] Invariant cache hit.
[2024-05-22 03:21:58] [INFO ] Implicit Places using invariants and state equation in 1492 ms returned []
Implicit Place search using SMT with State Equation took 2263 ms to find 0 implicit places.
Running 1641 sub problems to find dead transitions.
[2024-05-22 03:21:58] [INFO ] Invariant cache hit.
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 1005/2648 variables, and 0 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1006 constraints, PredecessorRefiner: 1641/1641 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1641 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1005/2648 variables, and 0 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1006 constraints, PredecessorRefiner: 0/1641 constraints, Known Traps: 0/0 constraints]
After SMT, in 60567ms problems are : Problem set: 0 solved, 1641 unsolved
Search for dead transitions found 0 dead transitions in 60585ms
Starting structural reductions in LTL mode, iteration 1 : 1006/1049 places, 1642/1697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63108 ms. Remains : 1006/1049 places, 1642/1697 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-03
Product exploration explored 100000 steps with 718 reset in 469 ms.
Product exploration explored 100000 steps with 755 reset in 765 ms.
Computed a total of 133 stabilizing places and 133 stable transitions
Computed a total of 133 stabilizing places and 133 stable transitions
Detected a total of 133/1006 stabilizing places and 133/1642 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 p1)), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 1243 steps (0 resets) in 11 ms. (103 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 152 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-22 03:23:01] [INFO ] Invariant cache hit.
[2024-05-22 03:23:02] [INFO ] [Real]Absence check using 69 positive place invariants in 79 ms returned sat
[2024-05-22 03:23:07] [INFO ] [Real]Absence check using state equation in 4734 ms returned sat
[2024-05-22 03:23:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 03:23:08] [INFO ] [Nat]Absence check using 69 positive place invariants in 77 ms returned sat
[2024-05-22 03:23:12] [INFO ] [Nat]Absence check using state equation in 4018 ms returned sat
[2024-05-22 03:23:13] [INFO ] Computed and/alt/rep : 1596/3101/1596 causal constraints (skipped 45 transitions) in 135 ms.
Could not prove EG (NOT p1)
Support contains 2 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 1642/1642 transitions.
Applied a total of 0 rules in 25 ms. Remains 1006 /1006 variables (removed 0) and now considering 1642/1642 (removed 0) transitions.
[2024-05-22 03:23:22] [INFO ] Invariant cache hit.
[2024-05-22 03:23:23] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-22 03:23:23] [INFO ] Invariant cache hit.
[2024-05-22 03:23:24] [INFO ] Implicit Places using invariants and state equation in 1285 ms returned []
Implicit Place search using SMT with State Equation took 1717 ms to find 0 implicit places.
Running 1641 sub problems to find dead transitions.
[2024-05-22 03:23:24] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1005/2648 variables, and 0 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1006 constraints, PredecessorRefiner: 1641/1641 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1641 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1005 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 1 (OVERLAPS) 1/1006 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-22 03:24:24] [INFO ] Deduced a trap composed of 61 places in 578 ms of which 57 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2648 variables, and 70 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 0/1006 constraints, PredecessorRefiner: 0/1641 constraints, Known Traps: 1/1 constraints]
After SMT, in 60864ms problems are : Problem set: 0 solved, 1641 unsolved
Search for dead transitions found 0 dead transitions in 60887ms
Finished structural reductions in LTL mode , in 1 iterations and 62636 ms. Remains : 1006/1006 places, 1642/1642 transitions.
Computed a total of 133 stabilizing places and 133 stable transitions
Computed a total of 133 stabilizing places and 133 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 209 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 796 steps (0 resets) in 10 ms. (72 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-22 03:24:26] [INFO ] Invariant cache hit.
[2024-05-22 03:24:27] [INFO ] [Real]Absence check using 69 positive place invariants in 80 ms returned sat
[2024-05-22 03:24:32] [INFO ] [Real]Absence check using state equation in 4939 ms returned sat
[2024-05-22 03:24:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 03:24:33] [INFO ] [Nat]Absence check using 69 positive place invariants in 72 ms returned sat
[2024-05-22 03:24:37] [INFO ] [Nat]Absence check using state equation in 3968 ms returned sat
[2024-05-22 03:24:37] [INFO ] Computed and/alt/rep : 1596/3101/1596 causal constraints (skipped 45 transitions) in 130 ms.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 356 reset in 273 ms.
Product exploration explored 100000 steps with 347 reset in 283 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 1642/1642 transitions.
Graph (trivial) has 930 edges and 1006 vertex of which 281 / 1006 are part of one of the 25 SCC in 2 ms
Free SCC test removed 256 places
Ensure Unique test removed 276 transitions
Reduce isomorphic transitions removed 276 transitions.
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 170 rules applied. Total rules applied 171 place count 750 transition count 1366
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 18 rules applied. Total rules applied 189 place count 750 transition count 1357
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 189 place count 750 transition count 1362
Deduced a syphon composed of 189 places in 3 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 199 place count 750 transition count 1362
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 297 place count 652 transition count 1115
Deduced a syphon composed of 126 places in 3 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 395 place count 652 transition count 1115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 399 place count 652 transition count 1111
Performed 232 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 358 places in 1 ms
Iterating global reduction 3 with 232 rules applied. Total rules applied 631 place count 652 transition count 1115
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 636 place count 652 transition count 1110
Discarding 182 places :
Symmetric choice reduction at 4 with 182 rule applications. Total rules 818 place count 470 transition count 849
Deduced a syphon composed of 189 places in 1 ms
Iterating global reduction 4 with 182 rules applied. Total rules applied 1000 place count 470 transition count 849
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1012 place count 470 transition count 837
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1017 place count 465 transition count 832
Deduced a syphon composed of 184 places in 0 ms
Iterating global reduction 5 with 5 rules applied. Total rules applied 1022 place count 465 transition count 832
Performed 29 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 5 with 29 rules applied. Total rules applied 1051 place count 465 transition count 1057
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1064 place count 465 transition count 1044
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 1103 place count 426 transition count 921
Deduced a syphon composed of 178 places in 0 ms
Iterating global reduction 6 with 39 rules applied. Total rules applied 1142 place count 426 transition count 921
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 1167 place count 426 transition count 896
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1175 place count 418 transition count 880
Deduced a syphon composed of 170 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1183 place count 418 transition count 880
Deduced a syphon composed of 170 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 7 with 33 rules applied. Total rules applied 1216 place count 418 transition count 847
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1224 place count 410 transition count 831
Deduced a syphon composed of 170 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1232 place count 410 transition count 831
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1240 place count 402 transition count 759
Deduced a syphon composed of 170 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1248 place count 402 transition count 759
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1260 place count 402 transition count 747
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 1268 place count 394 transition count 735
Deduced a syphon composed of 162 places in 0 ms
Iterating global reduction 8 with 8 rules applied. Total rules applied 1276 place count 394 transition count 735
Deduced a syphon composed of 162 places in 1 ms
Applied a total of 1276 rules in 301 ms. Remains 394 /1006 variables (removed 612) and now considering 735/1642 (removed 907) transitions.
[2024-05-22 03:24:48] [INFO ] Redundant transitions in 12 ms returned []
Running 734 sub problems to find dead transitions.
[2024-05-22 03:24:48] [INFO ] Flow matrix only has 712 transitions (discarded 23 similar events)
// Phase 1: matrix 712 rows 394 cols
[2024-05-22 03:24:48] [INFO ] Computed 69 invariants in 11 ms
[2024-05-22 03:24:48] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 1 (OVERLAPS) 1/394 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 734 unsolved
[2024-05-22 03:25:01] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 4 ms to minimize.
[2024-05-22 03:25:01] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 4 ms to minimize.
[2024-05-22 03:25:01] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 7 ms to minimize.
[2024-05-22 03:25:01] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 6 ms to minimize.
[2024-05-22 03:25:02] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 3 ms to minimize.
[2024-05-22 03:25:02] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 3 ms to minimize.
[2024-05-22 03:25:02] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
[2024-05-22 03:25:02] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
[2024-05-22 03:25:03] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
[2024-05-22 03:25:03] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
[2024-05-22 03:25:03] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
[2024-05-22 03:25:03] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
Problem TDEAD147 is UNSAT
[2024-05-22 03:25:03] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
Problem TDEAD150 is UNSAT
[2024-05-22 03:25:03] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
Problem TDEAD153 is UNSAT
[2024-05-22 03:25:03] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 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
[2024-05-22 03:25:03] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 2 ms to minimize.
Problem TDEAD193 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD203 is UNSAT
[2024-05-22 03:25:03] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
Problem TDEAD204 is UNSAT
Problem TDEAD209 is UNSAT
[2024-05-22 03:25:03] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
Problem TDEAD210 is UNSAT
Problem TDEAD214 is UNSAT
[2024-05-22 03:25:04] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 12 ms to minimize.
Problem TDEAD215 is UNSAT
Problem TDEAD220 is UNSAT
[2024-05-22 03:25:04] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 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 TDEAD193 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/89 constraints. Problems are: Problem set: 146 solved, 588 unsolved
[2024-05-22 03:25:05] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Problem TDEAD226 is UNSAT
[2024-05-22 03:25:06] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Problem TDEAD237 is UNSAT
[2024-05-22 03:25:06] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD246 is UNSAT
[2024-05-22 03:25:06] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Problem TDEAD251 is UNSAT
[2024-05-22 03:25:06] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 2 ms to minimize.
Problem TDEAD260 is UNSAT
[2024-05-22 03:25:06] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 2 ms to minimize.
Problem TDEAD265 is UNSAT
[2024-05-22 03:25:06] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD274 is UNSAT
[2024-05-22 03:25:06] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD279 is UNSAT
[2024-05-22 03:25:06] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD288 is UNSAT
[2024-05-22 03:25:06] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD293 is UNSAT
[2024-05-22 03:25:06] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
Problem TDEAD299 is UNSAT
[2024-05-22 03:25:06] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
Problem TDEAD304 is UNSAT
[2024-05-22 03:25:06] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 4 ms to minimize.
Problem TDEAD308 is UNSAT
[2024-05-22 03:25:07] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD318 is UNSAT
[2024-05-22 03:25:07] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD324 is UNSAT
[2024-05-22 03:25:07] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD329 is UNSAT
[2024-05-22 03:25:07] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
Problem TDEAD335 is UNSAT
[2024-05-22 03:25:07] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD340 is UNSAT
[2024-05-22 03:25:07] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD346 is UNSAT
[2024-05-22 03:25:07] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD226 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/109 constraints. Problems are: Problem set: 166 solved, 568 unsolved
[2024-05-22 03:25:14] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD357 is UNSAT
[2024-05-22 03:25:14] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD362 is UNSAT
[2024-05-22 03:25:14] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD368 is UNSAT
[2024-05-22 03:25:14] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD379 is UNSAT
[2024-05-22 03:25:14] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD384 is UNSAT
[2024-05-22 03:25:14] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD390 is UNSAT
[2024-05-22 03:25:14] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
Problem TDEAD395 is UNSAT
[2024-05-22 03:25:14] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD401 is UNSAT
[2024-05-22 03:25:14] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD407 is UNSAT
[2024-05-22 03:25:14] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
Problem TDEAD413 is UNSAT
[2024-05-22 03:25:14] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD419 is UNSAT
[2024-05-22 03:25:14] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD425 is UNSAT
[2024-05-22 03:25:14] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD434 is UNSAT
[2024-05-22 03:25:15] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD443 is UNSAT
[2024-05-22 03:25:15] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD452 is UNSAT
[2024-05-22 03:25:15] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
Problem TDEAD461 is UNSAT
[2024-05-22 03:25:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD467 is UNSAT
[2024-05-22 03:25:15] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD473 is UNSAT
[2024-05-22 03:25:15] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD479 is UNSAT
[2024-05-22 03:25:15] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD357 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD485 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 20/129 constraints. Problems are: Problem set: 186 solved, 548 unsolved
[2024-05-22 03:25:18] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD491 is UNSAT
[2024-05-22 03:25:18] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD502 is UNSAT
[2024-05-22 03:25:18] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD507 is UNSAT
(s144 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1106 variables, and 132 constraints, problems are : Problem set: 189 solved, 545 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 0/394 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 734/734 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 189 solved, 545 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 189 solved, 545 unsolved
At refinement iteration 1 (OVERLAPS) 157/394 variables, 69/69 constraints. Problems are: Problem set: 189 solved, 545 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 63/132 constraints. Problems are: Problem set: 189 solved, 545 unsolved
[2024-05-22 03:25:27] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
[2024-05-22 03:25:27] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
[2024-05-22 03:25:27] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
[2024-05-22 03:25:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
[2024-05-22 03:25:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
[2024-05-22 03:25:27] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 6/138 constraints. Problems are: Problem set: 201 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/138 constraints. Problems are: Problem set: 201 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 711/1105 variables, 394/532 constraints. Problems are: Problem set: 201 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1105 variables, 95/627 constraints. Problems are: Problem set: 201 solved, 533 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1105 variables, 533/1160 constraints. Problems are: Problem set: 201 solved, 533 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1105/1106 variables, and 1160 constraints, problems are : Problem set: 201 solved, 533 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 394/394 constraints, ReadFeed: 95/96 constraints, PredecessorRefiner: 533/734 constraints, Known Traps: 69/69 constraints]
After SMT, in 60350ms problems are : Problem set: 201 solved, 533 unsolved
Search for dead transitions found 201 dead transitions in 60360ms
Found 201 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 201 transitions
Dead transitions reduction (with SMT) removed 201 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 394/1006 places, 534/1642 transitions.
Graph (complete) has 968 edges and 394 vertex of which 232 are kept as prefixes of interest. Removing 162 places using SCC suffix rule.7 ms
Discarding 162 places :
Also discarding 0 output transitions
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 232 transition count 594
Deduced a syphon composed of 6 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 0 with 30 rules applied. Total rules applied 37 place count 232 transition count 564
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 41 place count 232 transition count 601
Deduced a syphon composed of 10 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 66 place count 232 transition count 576
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 232 transition count 613
Deduced a syphon composed of 14 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 95 place count 232 transition count 588
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 99 place count 232 transition count 625
Deduced a syphon composed of 18 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 124 place count 232 transition count 600
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 128 place count 232 transition count 633
Deduced a syphon composed of 22 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 149 place count 232 transition count 612
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 152 place count 232 transition count 647
Deduced a syphon composed of 25 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 172 place count 232 transition count 627
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 175 place count 232 transition count 658
Deduced a syphon composed of 28 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 192 place count 232 transition count 641
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 194 place count 232 transition count 661
Deduced a syphon composed of 30 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 210 place count 232 transition count 645
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 212 place count 232 transition count 667
Deduced a syphon composed of 32 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 223 place count 232 transition count 656
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 224 place count 232 transition count 668
Deduced a syphon composed of 33 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 234 place count 232 transition count 658
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 235 place count 232 transition count 670
Deduced a syphon composed of 34 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 245 place count 232 transition count 660
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 246 place count 232 transition count 674
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 35 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 247 place count 232 transition count 673
Deduced a syphon composed of 35 places in 0 ms
Applied a total of 247 rules in 302 ms. Remains 232 /394 variables (removed 162) and now considering 673/534 (removed -139) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 232/1006 places, 673/1642 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60988 ms. Remains : 232/1006 places, 673/1642 transitions.
Built C files in :
/tmp/ltsmin9883711240485201067
[2024-05-22 03:25:49] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9883711240485201067
Running compilation step : cd /tmp/ltsmin9883711240485201067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9883711240485201067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9883711240485201067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 1642/1642 transitions.
Applied a total of 0 rules in 26 ms. Remains 1006 /1006 variables (removed 0) and now considering 1642/1642 (removed 0) transitions.
// Phase 1: matrix 1642 rows 1006 cols
[2024-05-22 03:25:52] [INFO ] Computed 69 invariants in 12 ms
[2024-05-22 03:25:53] [INFO ] Implicit Places using invariants in 547 ms returned []
[2024-05-22 03:25:53] [INFO ] Invariant cache hit.
[2024-05-22 03:25:54] [INFO ] Implicit Places using invariants and state equation in 1309 ms returned []
Implicit Place search using SMT with State Equation took 1859 ms to find 0 implicit places.
Running 1641 sub problems to find dead transitions.
[2024-05-22 03:25:54] [INFO ] Invariant cache hit.
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 1005/2648 variables, and 0 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1006 constraints, PredecessorRefiner: 1641/1641 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1641 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1005 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
SMT process timed out in 60539ms, After SMT, problems are : Problem set: 0 solved, 1641 unsolved
Search for dead transitions found 0 dead transitions in 60561ms
Finished structural reductions in LTL mode , in 1 iterations and 62451 ms. Remains : 1006/1006 places, 1642/1642 transitions.
Built C files in :
/tmp/ltsmin13116645718151291363
[2024-05-22 03:26:55] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13116645718151291363
Running compilation step : cd /tmp/ltsmin13116645718151291363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13116645718151291363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13116645718151291363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 03:26:58] [INFO ] Flatten gal took : 64 ms
[2024-05-22 03:26:58] [INFO ] Flatten gal took : 65 ms
[2024-05-22 03:26:58] [INFO ] Time to serialize gal into /tmp/LTL14577836952746489679.gal : 24 ms
[2024-05-22 03:26:58] [INFO ] Time to serialize properties into /tmp/LTL17890244689371851516.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14577836952746489679.gal' '-t' 'CGAL' '-hoa' '/tmp/aut178215505273986459.hoa' '-atoms' '/tmp/LTL17890244689371851516.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17890244689371851516.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut178215505273986459.hoa
Detected timeout of ITS tools.
[2024-05-22 03:27:13] [INFO ] Flatten gal took : 62 ms
[2024-05-22 03:27:13] [INFO ] Flatten gal took : 51 ms
[2024-05-22 03:27:13] [INFO ] Time to serialize gal into /tmp/LTL14660294322927306329.gal : 19 ms
[2024-05-22 03:27:13] [INFO ] Time to serialize properties into /tmp/LTL5052553537258474004.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14660294322927306329.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5052553537258474004.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X(F("(p1310==0)")))&&(F("((p1310==1)||(p640==1))")))))
Formula 0 simplified : X(XG!"(p1310==0)" | G!"((p1310==1)||(p640==1))")
Detected timeout of ITS tools.
[2024-05-22 03:27:28] [INFO ] Flatten gal took : 88 ms
[2024-05-22 03:27:28] [INFO ] Applying decomposition
[2024-05-22 03:27:28] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5617385159640426361.txt' '-o' '/tmp/graph5617385159640426361.bin' '-w' '/tmp/graph5617385159640426361.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5617385159640426361.bin' '-l' '-1' '-v' '-w' '/tmp/graph5617385159640426361.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:27:29] [INFO ] Decomposing Gal with order
[2024-05-22 03:27:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:27:29] [INFO ] Removed a total of 1322 redundant transitions.
[2024-05-22 03:27:29] [INFO ] Flatten gal took : 284 ms
[2024-05-22 03:27:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 57 ms.
[2024-05-22 03:27:29] [INFO ] Time to serialize gal into /tmp/LTL3491161637053712683.gal : 32 ms
[2024-05-22 03:27:29] [INFO ] Time to serialize properties into /tmp/LTL3607076790824785813.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3491161637053712683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3607076790824785813.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((X(F("(i16.u315.p1310==0)")))&&(F("((i16.u315.p1310==1)||(i6.u143.p640==1))")))))
Formula 0 simplified : X(XG!"(i16.u315.p1310==0)" | G!"((i16.u315.p1310==1)||(i6.u143.p640==1))")
Detected timeout of ITS tools.
Treatment of property DLCround-PT-04b-LTLFireability-03 finished in 348904 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 1049 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1049/1049 places, 1697/1697 transitions.
Graph (trivial) has 979 edges and 1049 vertex of which 301 / 1049 are part of one of the 24 SCC in 1 ms
Free SCC test removed 277 places
Ensure Unique test removed 300 transitions
Reduce isomorphic transitions removed 300 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 194 rules applied. Total rules applied 195 place count 771 transition count 1202
Reduce places removed 194 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 223 rules applied. Total rules applied 418 place count 577 transition count 1173
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 439 place count 559 transition count 1170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 440 place count 558 transition count 1170
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 73 Pre rules applied. Total rules applied 440 place count 558 transition count 1097
Deduced a syphon composed of 73 places in 2 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 586 place count 485 transition count 1097
Discarding 45 places :
Symmetric choice reduction at 4 with 45 rule applications. Total rules 631 place count 440 transition count 889
Iterating global reduction 4 with 45 rules applied. Total rules applied 676 place count 440 transition count 889
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 680 place count 440 transition count 885
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 680 place count 440 transition count 883
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 684 place count 438 transition count 883
Performed 158 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 5 with 316 rules applied. Total rules applied 1000 place count 280 transition count 720
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1005 place count 280 transition count 715
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1019 place count 266 transition count 615
Iterating global reduction 6 with 14 rules applied. Total rules applied 1033 place count 266 transition count 615
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1047 place count 266 transition count 601
Performed 17 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 1081 place count 249 transition count 697
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1085 place count 245 transition count 651
Iterating global reduction 7 with 4 rules applied. Total rules applied 1089 place count 245 transition count 651
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 1110 place count 245 transition count 630
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 8 with 24 rules applied. Total rules applied 1134 place count 245 transition count 606
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 1144 place count 235 transition count 586
Iterating global reduction 8 with 10 rules applied. Total rules applied 1154 place count 235 transition count 586
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 1164 place count 225 transition count 504
Iterating global reduction 8 with 10 rules applied. Total rules applied 1174 place count 225 transition count 504
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1184 place count 225 transition count 494
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1185 place count 224 transition count 493
Applied a total of 1185 rules in 151 ms. Remains 224 /1049 variables (removed 825) and now considering 493/1697 (removed 1204) transitions.
[2024-05-22 03:27:45] [INFO ] Flow matrix only has 475 transitions (discarded 18 similar events)
// Phase 1: matrix 475 rows 224 cols
[2024-05-22 03:27:45] [INFO ] Computed 69 invariants in 2 ms
[2024-05-22 03:27:45] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-22 03:27:45] [INFO ] Flow matrix only has 475 transitions (discarded 18 similar events)
[2024-05-22 03:27:45] [INFO ] Invariant cache hit.
[2024-05-22 03:27:45] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-22 03:27:45] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2024-05-22 03:27:45] [INFO ] Redundant transitions in 5 ms returned []
Running 441 sub problems to find dead transitions.
[2024-05-22 03:27:45] [INFO ] Flow matrix only has 475 transitions (discarded 18 similar events)
[2024-05-22 03:27:45] [INFO ] Invariant cache hit.
[2024-05-22 03:27:45] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (OVERLAPS) 1/224 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 4 (OVERLAPS) 474/698 variables, 224/293 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/698 variables, 32/325 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 7 (OVERLAPS) 0/698 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 441 unsolved
No progress, stopping.
After SMT solving in domain Real declared 698/699 variables, and 325 constraints, problems are : Problem set: 0 solved, 441 unsolved in 21574 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 224/224 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 441/441 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (OVERLAPS) 1/224 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 4 (OVERLAPS) 474/698 variables, 224/293 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/698 variables, 32/325 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 441/766 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/698 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 8 (OVERLAPS) 0/698 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 441 unsolved
No progress, stopping.
After SMT solving in domain Int declared 698/699 variables, and 766 constraints, problems are : Problem set: 0 solved, 441 unsolved in 27787 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 224/224 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 441/441 constraints, Known Traps: 0/0 constraints]
After SMT, in 49561ms problems are : Problem set: 0 solved, 441 unsolved
Search for dead transitions found 0 dead transitions in 49566ms
Starting structural reductions in SI_LTL mode, iteration 1 : 224/1049 places, 493/1697 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50352 ms. Remains : 224/1049 places, 493/1697 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-04 finished in 50420 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(X(G(p0)))))'
Support contains 1 out of 1049 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1049/1049 places, 1697/1697 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1032 transition count 1673
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1032 transition count 1673
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 47 place count 1019 transition count 1658
Iterating global reduction 0 with 13 rules applied. Total rules applied 60 place count 1019 transition count 1658
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 1019 transition count 1657
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 1012 transition count 1650
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 1012 transition count 1650
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 77 place count 1012 transition count 1648
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 81 place count 1008 transition count 1644
Iterating global reduction 2 with 4 rules applied. Total rules applied 85 place count 1008 transition count 1644
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 1006 transition count 1642
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 1006 transition count 1642
Applied a total of 89 rules in 158 ms. Remains 1006 /1049 variables (removed 43) and now considering 1642/1697 (removed 55) transitions.
// Phase 1: matrix 1642 rows 1006 cols
[2024-05-22 03:28:35] [INFO ] Computed 69 invariants in 7 ms
[2024-05-22 03:28:36] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-05-22 03:28:36] [INFO ] Invariant cache hit.
[2024-05-22 03:28:37] [INFO ] Implicit Places using invariants and state equation in 1158 ms returned []
Implicit Place search using SMT with State Equation took 1615 ms to find 0 implicit places.
Running 1641 sub problems to find dead transitions.
[2024-05-22 03:28:37] [INFO ] Invariant cache hit.
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 1005/2648 variables, and 0 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1006 constraints, PredecessorRefiner: 1641/1641 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1641 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1005/2648 variables, and 0 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1006 constraints, PredecessorRefiner: 0/1641 constraints, Known Traps: 0/0 constraints]
After SMT, in 60521ms problems are : Problem set: 0 solved, 1641 unsolved
Search for dead transitions found 0 dead transitions in 60541ms
Starting structural reductions in LTL mode, iteration 1 : 1006/1049 places, 1642/1697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62317 ms. Remains : 1006/1049 places, 1642/1697 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 337 steps with 0 reset in 2 ms.
FORMULA DLCround-PT-04b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-05 finished in 62497 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(p0) U ((p1&&X(p0))||X(G(p0)))) U p2)) U (!p0||G(p3))))'
Support contains 4 out of 1049 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1049/1049 places, 1697/1697 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1035 transition count 1676
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1035 transition count 1676
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 38 place count 1025 transition count 1665
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 1025 transition count 1665
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 1025 transition count 1664
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 1020 transition count 1659
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 1020 transition count 1659
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 1020 transition count 1658
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 1017 transition count 1655
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 1017 transition count 1655
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 1016 transition count 1654
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 1016 transition count 1654
Applied a total of 68 rules in 163 ms. Remains 1016 /1049 variables (removed 33) and now considering 1654/1697 (removed 43) transitions.
// Phase 1: matrix 1654 rows 1016 cols
[2024-05-22 03:29:38] [INFO ] Computed 69 invariants in 6 ms
[2024-05-22 03:29:38] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-22 03:29:38] [INFO ] Invariant cache hit.
[2024-05-22 03:29:39] [INFO ] Implicit Places using invariants and state equation in 1146 ms returned []
Implicit Place search using SMT with State Equation took 1577 ms to find 0 implicit places.
Running 1653 sub problems to find dead transitions.
[2024-05-22 03:29:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1015 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
SMT process timed out in 30497ms, After SMT, problems are : Problem set: 0 solved, 1653 unsolved
Search for dead transitions found 0 dead transitions in 30514ms
Starting structural reductions in LTL mode, iteration 1 : 1016/1049 places, 1654/1697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32264 ms. Remains : 1016/1049 places, 1654/1697 transitions.
Stuttering acceptance computed with spot in 550 ms :[(AND p0 (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-06
Product exploration explored 100000 steps with 20054 reset in 343 ms.
Product exploration explored 100000 steps with 19947 reset in 370 ms.
Computed a total of 133 stabilizing places and 133 stable transitions
Computed a total of 133 stabilizing places and 133 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) p1), (X (NOT (AND p3 (NOT p2)))), (X (NOT p3)), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (AND (NOT p3) (NOT p2))), (X (AND p0 (NOT p3))), (X p1), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p3 (NOT p1))))), (X (X p0)), (X (X (AND (NOT p3) (NOT p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 29 factoid took 169 ms. Reduced automaton from 9 states, 26 edges and 4 AP (stutter sensitive) to 9 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[(AND p0 (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
RANDOM walk for 40000 steps (8 resets) in 825 ms. (48 steps per ms) remains 4/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
[2024-05-22 03:30:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 218/222 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 794/1016 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1016 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1654/2670 variables, 1016/1085 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2670 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/2670 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2670/2670 variables, and 1085 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1562 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 1016/1016 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 218/222 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 794/1016 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1016 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1654/2670 variables, 1016/1085 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2670 variables, 4/1089 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2670 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/2670 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2670/2670 variables, and 1089 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1346 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 1016/1016 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2920ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 17400 steps, including 41 resets, run visited all 4 properties in 345 ms. (steps per millisecond=50 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 347 ms.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) p1), (X (NOT (AND p3 (NOT p2)))), (X (NOT p3)), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (AND (NOT p3) (NOT p2))), (X (AND p0 (NOT p3))), (X p1), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p3 (NOT p1))))), (X (X p0)), (X (X (AND (NOT p3) (NOT p2)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p3) p0))), (F (NOT (OR (NOT p3) (NOT p0)))), (F (NOT (OR (NOT p3) p0))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p2 p3 p1))), (F (NOT (OR p2 p1))), (F (NOT (OR p3 p0))), (F (NOT (OR (NOT p3) p1))), (F (NOT (OR p3 p1))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR p2 (NOT p3) p1))), (F p2), (F (NOT (OR p2 (NOT p3))))]
Knowledge based reduction with 29 factoid took 984 ms. Reduced automaton from 9 states, 26 edges and 4 AP (stutter sensitive) to 9 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[(AND p0 (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 309 ms :[(AND p0 (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
[2024-05-22 03:30:17] [INFO ] Invariant cache hit.
[2024-05-22 03:30:18] [INFO ] [Real]Absence check using 69 positive place invariants in 75 ms returned sat
[2024-05-22 03:30:20] [INFO ] [Real]Absence check using state equation in 1924 ms returned sat
[2024-05-22 03:30:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 03:30:22] [INFO ] [Nat]Absence check using 69 positive place invariants in 68 ms returned sat
[2024-05-22 03:30:24] [INFO ] [Nat]Absence check using state equation in 1795 ms returned sat
[2024-05-22 03:30:24] [INFO ] Computed and/alt/rep : 1608/3115/1608 causal constraints (skipped 45 transitions) in 121 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 03:30:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND p0 (NOT p3))
Could not prove EG (AND p0 (NOT p3))
Support contains 4 out of 1016 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1016/1016 places, 1654/1654 transitions.
Applied a total of 0 rules in 37 ms. Remains 1016 /1016 variables (removed 0) and now considering 1654/1654 (removed 0) transitions.
[2024-05-22 03:30:35] [INFO ] Invariant cache hit.
[2024-05-22 03:30:36] [INFO ] Implicit Places using invariants in 542 ms returned []
[2024-05-22 03:30:36] [INFO ] Invariant cache hit.
[2024-05-22 03:30:37] [INFO ] Implicit Places using invariants and state equation in 1330 ms returned []
Implicit Place search using SMT with State Equation took 1874 ms to find 0 implicit places.
Running 1653 sub problems to find dead transitions.
[2024-05-22 03:30:37] [INFO ] Invariant cache hit.
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 1015/2670 variables, and 0 constraints, problems are : Problem set: 0 solved, 1653 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1016 constraints, PredecessorRefiner: 1653/1653 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1653 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1015 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
At refinement iteration 1 (OVERLAPS) 1/1016 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1016/2670 variables, and 69 constraints, problems are : Problem set: 0 solved, 1653 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 0/1016 constraints, PredecessorRefiner: 0/1653 constraints, Known Traps: 0/0 constraints]
After SMT, in 60946ms problems are : Problem set: 0 solved, 1653 unsolved
Search for dead transitions found 0 dead transitions in 60977ms
Finished structural reductions in LTL mode , in 1 iterations and 62895 ms. Remains : 1016/1016 places, 1654/1654 transitions.
Computed a total of 133 stabilizing places and 133 stable transitions
Computed a total of 133 stabilizing places and 133 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 (NOT p2) p1), (X (NOT p3)), (X (NOT (AND (NOT p2) p3))), (X (AND (NOT p2) (NOT p3))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p3 p0))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (AND (NOT p3) p0)), (X p0), (X p1), (X (NOT (AND (NOT p2) p3 (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 p0)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p2))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) p3 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 29 factoid took 207 ms. Reduced automaton from 9 states, 26 edges and 4 AP (stutter sensitive) to 9 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[(AND p0 (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
RANDOM walk for 40000 steps (8 resets) in 416 ms. (95 steps per ms) remains 4/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
[2024-05-22 03:31:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 218/222 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 794/1016 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1016 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1654/2670 variables, 1016/1085 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2670 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/2670 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2670/2670 variables, and 1085 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1553 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 1016/1016 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 218/222 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 794/1016 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1016 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1654/2670 variables, 1016/1085 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2670 variables, 4/1089 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2670 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/2670 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2670/2670 variables, and 1089 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1381 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 1016/1016 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2947ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 9230 steps, including 22 resets, run visited all 4 properties in 221 ms. (steps per millisecond=41 )
Parikh walk visited 4 properties in 222 ms.
Knowledge obtained : [(AND (NOT p3) p0 (NOT p2) p1), (X (NOT p3)), (X (NOT (AND (NOT p2) p3))), (X (AND (NOT p2) (NOT p3))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p3 p0))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (AND (NOT p3) p0)), (X p0), (X p1), (X (NOT (AND (NOT p2) p3 (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 p0)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p2))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) p3 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p3) p0))), (F (NOT (AND (NOT p3) p0))), (F (NOT (OR p2 (NOT p3)))), (F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT p0)), (F (NOT (OR p3 p0))), (F (NOT (OR p2 p3 p1))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p3) (NOT p0)))), (F (NOT (OR p1 p0))), (F (NOT (OR p3 p1))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR p2 (NOT p3) p1))), (F (NOT (OR (NOT p3) p1))), (F p2)]
Knowledge based reduction with 29 factoid took 1075 ms. Reduced automaton from 9 states, 26 edges and 4 AP (stutter sensitive) to 9 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 361 ms :[(AND p0 (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 374 ms :[(AND p0 (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
[2024-05-22 03:31:44] [INFO ] Invariant cache hit.
[2024-05-22 03:31:46] [INFO ] [Real]Absence check using 69 positive place invariants in 67 ms returned sat
[2024-05-22 03:31:48] [INFO ] [Real]Absence check using state equation in 1937 ms returned sat
[2024-05-22 03:31:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 03:31:49] [INFO ] [Nat]Absence check using 69 positive place invariants in 65 ms returned sat
[2024-05-22 03:31:50] [INFO ] [Nat]Absence check using state equation in 1735 ms returned sat
[2024-05-22 03:31:51] [INFO ] Computed and/alt/rep : 1608/3115/1608 causal constraints (skipped 45 transitions) in 143 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 03:32:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND p0 (NOT p3))
Could not prove EG (AND p0 (NOT p3))
Stuttering acceptance computed with spot in 321 ms :[(AND p0 (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Product exploration explored 100000 steps with 19993 reset in 258 ms.
Product exploration explored 100000 steps with 20026 reset in 512 ms.
Applying partial POR strategy [false, false, false, true, false, true, false, true, true]
Stuttering acceptance computed with spot in 314 ms :[(AND p0 (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Support contains 4 out of 1016 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1016/1016 places, 1654/1654 transitions.
Graph (trivial) has 938 edges and 1016 vertex of which 295 / 1016 are part of one of the 24 SCC in 1 ms
Free SCC test removed 271 places
Ensure Unique test removed 293 transitions
Reduce isomorphic transitions removed 293 transitions.
Performed 168 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 168 rules applied. Total rules applied 169 place count 745 transition count 1361
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 18 rules applied. Total rules applied 187 place count 745 transition count 1352
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 187 place count 745 transition count 1356
Deduced a syphon composed of 185 places in 2 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 195 place count 745 transition count 1356
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 291 place count 649 transition count 1104
Deduced a syphon composed of 126 places in 2 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 387 place count 649 transition count 1104
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 391 place count 649 transition count 1100
Performed 228 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 354 places in 0 ms
Iterating global reduction 3 with 228 rules applied. Total rules applied 619 place count 649 transition count 1105
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 624 place count 649 transition count 1100
Renaming transitions due to excessive name length > 1024 char.
Discarding 178 places :
Symmetric choice reduction at 4 with 178 rule applications. Total rules 802 place count 471 transition count 836
Deduced a syphon composed of 190 places in 1 ms
Iterating global reduction 4 with 178 rules applied. Total rules applied 980 place count 471 transition count 836
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 994 place count 471 transition count 822
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 999 place count 466 transition count 817
Deduced a syphon composed of 185 places in 0 ms
Iterating global reduction 5 with 5 rules applied. Total rules applied 1004 place count 466 transition count 817
Performed 26 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 5 with 26 rules applied. Total rules applied 1030 place count 466 transition count 1002
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1043 place count 466 transition count 989
Discarding 35 places :
Symmetric choice reduction at 6 with 35 rule applications. Total rules 1078 place count 431 transition count 878
Deduced a syphon composed of 180 places in 0 ms
Iterating global reduction 6 with 35 rules applied. Total rules applied 1113 place count 431 transition count 878
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 1137 place count 431 transition count 854
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1145 place count 423 transition count 838
Deduced a syphon composed of 172 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1153 place count 423 transition count 838
Deduced a syphon composed of 172 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 7 with 32 rules applied. Total rules applied 1185 place count 423 transition count 806
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1194 place count 414 transition count 789
Deduced a syphon composed of 171 places in 0 ms
Iterating global reduction 7 with 9 rules applied. Total rules applied 1203 place count 414 transition count 789
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1211 place count 406 transition count 722
Deduced a syphon composed of 171 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1219 place count 406 transition count 722
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1230 place count 406 transition count 711
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1236 place count 400 transition count 702
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 8 with 6 rules applied. Total rules applied 1242 place count 400 transition count 702
Deduced a syphon composed of 165 places in 0 ms
Applied a total of 1242 rules in 216 ms. Remains 400 /1016 variables (removed 616) and now considering 702/1654 (removed 952) transitions.
[2024-05-22 03:32:04] [INFO ] Redundant transitions in 10 ms returned []
Running 701 sub problems to find dead transitions.
[2024-05-22 03:32:04] [INFO ] Flow matrix only has 683 transitions (discarded 19 similar events)
// Phase 1: matrix 683 rows 400 cols
[2024-05-22 03:32:04] [INFO ] Computed 69 invariants in 12 ms
[2024-05-22 03:32:04] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (OVERLAPS) 1/400 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 701 unsolved
[2024-05-22 03:32:18] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 6 ms to minimize.
[2024-05-22 03:32:18] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 2 ms to minimize.
[2024-05-22 03:32:18] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-22 03:32:19] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
[2024-05-22 03:32:19] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-22 03:32:19] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-22 03:32:20] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
[2024-05-22 03:32:20] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
[2024-05-22 03:32:20] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
[2024-05-22 03:32:20] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
[2024-05-22 03:32:20] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 2 ms to minimize.
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
[2024-05-22 03:32:20] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
Problem TDEAD159 is UNSAT
[2024-05-22 03:32:20] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
Problem TDEAD162 is UNSAT
[2024-05-22 03:32:20] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
Problem TDEAD165 is UNSAT
[2024-05-22 03:32:20] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD184 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
[2024-05-22 03:32:21] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
Problem TDEAD206 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD221 is UNSAT
[2024-05-22 03:32:21] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
Problem TDEAD222 is UNSAT
Problem TDEAD226 is UNSAT
[2024-05-22 03:32:21] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 2 ms to minimize.
Problem TDEAD227 is UNSAT
Problem TDEAD232 is UNSAT
[2024-05-22 03:32:21] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
Problem TDEAD233 is UNSAT
Problem TDEAD237 is UNSAT
[2024-05-22 03:32:21] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD184 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 TDEAD206 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/89 constraints. Problems are: Problem set: 146 solved, 555 unsolved
[2024-05-22 03:32:22] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-22 03:32:22] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-22 03:32:24] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 2 ms to minimize.
Problem TDEAD244 is UNSAT
[2024-05-22 03:32:24] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
Problem TDEAD249 is UNSAT
[2024-05-22 03:32:25] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
Problem TDEAD254 is UNSAT
[2024-05-22 03:32:25] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
Problem TDEAD259 is UNSAT
[2024-05-22 03:32:25] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
Problem TDEAD265 is UNSAT
[2024-05-22 03:32:25] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
Problem TDEAD270 is UNSAT
[2024-05-22 03:32:25] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Problem TDEAD276 is UNSAT
[2024-05-22 03:32:25] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
Problem TDEAD281 is UNSAT
[2024-05-22 03:32:25] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 2 ms to minimize.
Problem TDEAD287 is UNSAT
[2024-05-22 03:32:25] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
Problem TDEAD292 is UNSAT
[2024-05-22 03:32:25] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Problem TDEAD297 is UNSAT
[2024-05-22 03:32:26] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
Problem TDEAD313 is UNSAT
[2024-05-22 03:32:26] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Problem TDEAD319 is UNSAT
[2024-05-22 03:32:26] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
Problem TDEAD324 is UNSAT
[2024-05-22 03:32:26] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Problem TDEAD330 is UNSAT
[2024-05-22 03:32:26] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
Problem TDEAD335 is UNSAT
[2024-05-22 03:32:26] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Problem TDEAD341 is UNSAT
[2024-05-22 03:32:26] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
Problem TDEAD244 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD509 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/109 constraints. Problems are: Problem set: 166 solved, 535 unsolved
[2024-05-22 03:32:35] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
Problem TDEAD353 is UNSAT
[2024-05-22 03:32:35] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD358 is UNSAT
[2024-05-22 03:32:35] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD365 is UNSAT
[2024-05-22 03:32:35] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD370 is UNSAT
[2024-05-22 03:32:35] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD377 is UNSAT
[2024-05-22 03:32:35] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD382 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1083 variables, and 115 constraints, problems are : Problem set: 172 solved, 529 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 0/400 constraints, ReadFeed: 0/84 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 172 solved, 529 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 172 solved, 529 unsolved
At refinement iteration 1 (OVERLAPS) 143/400 variables, 69/69 constraints. Problems are: Problem set: 172 solved, 529 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 46/115 constraints. Problems are: Problem set: 172 solved, 529 unsolved
[2024-05-22 03:32:40] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
Problem TDEAD388 is UNSAT
[2024-05-22 03:32:40] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD393 is UNSAT
[2024-05-22 03:32:40] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD400 is UNSAT
[2024-05-22 03:32:41] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD405 is UNSAT
[2024-05-22 03:32:41] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD412 is UNSAT
[2024-05-22 03:32:41] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD417 is UNSAT
[2024-05-22 03:32:41] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD424 is UNSAT
[2024-05-22 03:32:41] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
Problem TDEAD430 is UNSAT
[2024-05-22 03:32:41] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD436 is UNSAT
[2024-05-22 03:32:41] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD442 is UNSAT
[2024-05-22 03:32:41] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD448 is UNSAT
[2024-05-22 03:32:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD454 is UNSAT
[2024-05-22 03:32:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD460 is UNSAT
[2024-05-22 03:32:41] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD466 is UNSAT
[2024-05-22 03:32:41] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD472 is UNSAT
[2024-05-22 03:32:41] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD478 is UNSAT
[2024-05-22 03:32:42] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD484 is UNSAT
[2024-05-22 03:32:42] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD490 is UNSAT
[2024-05-22 03:32:42] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD496 is UNSAT
[2024-05-22 03:32:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD388 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD521 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/135 constraints. Problems are: Problem set: 192 solved, 509 unsolved
[2024-05-22 03:32:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
[2024-05-22 03:32:46] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
[2024-05-22 03:32:46] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 3/138 constraints. Problems are: Problem set: 198 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/138 constraints. Problems are: Problem set: 198 solved, 503 unsolved
At refinement iteration 6 (OVERLAPS) 682/1082 variables, 400/538 constraints. Problems are: Problem set: 198 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1082 variables, 83/621 constraints. Problems are: Problem set: 198 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 503/1124 constraints. Problems are: Problem set: 198 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1082/1083 variables, and 1124 constraints, problems are : Problem set: 198 solved, 503 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 400/400 constraints, ReadFeed: 83/84 constraints, PredecessorRefiner: 503/701 constraints, Known Traps: 69/69 constraints]
After SMT, in 60513ms problems are : Problem set: 198 solved, 503 unsolved
Search for dead transitions found 198 dead transitions in 60520ms
Found 198 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 198 transitions
Dead transitions reduction (with SMT) removed 198 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 400/1016 places, 504/1654 transitions.
Graph (complete) has 921 edges and 400 vertex of which 235 are kept as prefixes of interest. Removing 165 places using SCC suffix rule.0 ms
Discarding 165 places :
Also discarding 0 output transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 235 transition count 541
Deduced a syphon composed of 4 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 26 place count 235 transition count 520
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 29 place count 235 transition count 550
Deduced a syphon composed of 7 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 50 place count 235 transition count 529
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 53 place count 235 transition count 560
Deduced a syphon composed of 10 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 70 place count 235 transition count 543
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 235 transition count 566
Deduced a syphon composed of 12 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 89 place count 235 transition count 549
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 91 place count 235 transition count 572
Deduced a syphon composed of 14 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 108 place count 235 transition count 555
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 235 transition count 578
Deduced a syphon composed of 16 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 127 place count 235 transition count 561
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 129 place count 235 transition count 584
Deduced a syphon composed of 18 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 139 place count 235 transition count 574
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 140 place count 235 transition count 587
Deduced a syphon composed of 19 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 150 place count 235 transition count 577
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 151 place count 235 transition count 591
Deduced a syphon composed of 20 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 162 place count 235 transition count 580
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 163 place count 235 transition count 593
Deduced a syphon composed of 21 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 173 place count 235 transition count 583
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 174 place count 235 transition count 597
Deduced a syphon composed of 22 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 185 place count 235 transition count 586
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 186 place count 235 transition count 599
Deduced a syphon composed of 23 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 196 place count 235 transition count 589
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 197 place count 235 transition count 603
Deduced a syphon composed of 24 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 208 place count 235 transition count 592
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 209 place count 235 transition count 605
Deduced a syphon composed of 25 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 219 place count 235 transition count 595
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 220 place count 235 transition count 610
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 220 rules in 256 ms. Remains 235 /400 variables (removed 165) and now considering 610/504 (removed -106) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 235/1016 places, 610/1654 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61014 ms. Remains : 235/1016 places, 610/1654 transitions.
Built C files in :
/tmp/ltsmin10443758758735549585
[2024-05-22 03:33:05] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10443758758735549585
Running compilation step : cd /tmp/ltsmin10443758758735549585;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10443758758735549585;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10443758758735549585;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 1016 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1016/1016 places, 1654/1654 transitions.
Applied a total of 0 rules in 24 ms. Remains 1016 /1016 variables (removed 0) and now considering 1654/1654 (removed 0) transitions.
// Phase 1: matrix 1654 rows 1016 cols
[2024-05-22 03:33:08] [INFO ] Computed 69 invariants in 12 ms
[2024-05-22 03:33:09] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-05-22 03:33:09] [INFO ] Invariant cache hit.
[2024-05-22 03:33:10] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 1617 ms to find 0 implicit places.
Running 1653 sub problems to find dead transitions.
[2024-05-22 03:33:10] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1015/2670 variables, and 0 constraints, problems are : Problem set: 0 solved, 1653 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1016 constraints, PredecessorRefiner: 1653/1653 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1653 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1015/2670 variables, and 0 constraints, problems are : Problem set: 0 solved, 1653 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1016 constraints, PredecessorRefiner: 0/1653 constraints, Known Traps: 0/0 constraints]
After SMT, in 60539ms problems are : Problem set: 0 solved, 1653 unsolved
Search for dead transitions found 0 dead transitions in 60555ms
Finished structural reductions in LTL mode , in 1 iterations and 62200 ms. Remains : 1016/1016 places, 1654/1654 transitions.
Built C files in :
/tmp/ltsmin14471122630212405293
[2024-05-22 03:34:11] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14471122630212405293
Running compilation step : cd /tmp/ltsmin14471122630212405293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14471122630212405293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14471122630212405293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 03:34:14] [INFO ] Flatten gal took : 43 ms
[2024-05-22 03:34:14] [INFO ] Flatten gal took : 39 ms
[2024-05-22 03:34:14] [INFO ] Time to serialize gal into /tmp/LTL15568498101062701749.gal : 14 ms
[2024-05-22 03:34:14] [INFO ] Time to serialize properties into /tmp/LTL13579738989032208052.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15568498101062701749.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10695247798741301872.hoa' '-atoms' '/tmp/LTL13579738989032208052.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13579738989032208052.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10695247798741301872.hoa
Detected timeout of ITS tools.
[2024-05-22 03:34:29] [INFO ] Flatten gal took : 36 ms
[2024-05-22 03:34:29] [INFO ] Flatten gal took : 40 ms
[2024-05-22 03:34:29] [INFO ] Time to serialize gal into /tmp/LTL10374930398711463360.gal : 8 ms
[2024-05-22 03:34:29] [INFO ] Time to serialize properties into /tmp/LTL8298446928607001653.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10374930398711463360.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8298446928607001653.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(((X("(p842!=1)"))U((X(G("(p842!=1)")))||(("(p962!=1)")&&(X("(p842!=1)")))))U("(p886==1)")))U(("(p842==1)")||(G("(p93==1)")))))
Formula 0 simplified : X((X!"(p842!=1)" R (XF!"(p842!=1)" & (!"(p962!=1)" | X!"(p842!=1)"))) R !"(p886==1)") R (!"(p842==1)" & F!"(p93==1)")
Detected timeout of ITS tools.
[2024-05-22 03:34:44] [INFO ] Flatten gal took : 58 ms
[2024-05-22 03:34:44] [INFO ] Applying decomposition
[2024-05-22 03:34:44] [INFO ] Flatten gal took : 59 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12395899013680353010.txt' '-o' '/tmp/graph12395899013680353010.bin' '-w' '/tmp/graph12395899013680353010.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12395899013680353010.bin' '-l' '-1' '-v' '-w' '/tmp/graph12395899013680353010.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:34:44] [INFO ] Decomposing Gal with order
[2024-05-22 03:34:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:34:44] [INFO ] Removed a total of 1314 redundant transitions.
[2024-05-22 03:34:44] [INFO ] Flatten gal took : 150 ms
[2024-05-22 03:34:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 44 ms.
[2024-05-22 03:34:45] [INFO ] Time to serialize gal into /tmp/LTL15648385768163838025.gal : 21 ms
[2024-05-22 03:34:45] [INFO ] Time to serialize properties into /tmp/LTL5921702825396491673.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15648385768163838025.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5921702825396491673.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X(((X("(i12.u203.p842!=1)"))U((X(G("(i12.u203.p842!=1)")))||(("(i15.u237.p962!=1)")&&(X("(i12.u203.p842!=1)")))))U("(i13.u215.p886...220
Formula 0 simplified : X((X!"(i12.u203.p842!=1)" R (XF!"(i12.u203.p842!=1)" & (!"(i15.u237.p962!=1)" | X!"(i12.u203.p842!=1)"))) R !"(i13.u215.p886==1)") R...207
Detected timeout of ITS tools.
Treatment of property DLCround-PT-04b-LTLFireability-06 finished in 322199 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' '!(((p0 U X(X(p1)))||F(p2)))'
Support contains 4 out of 1049 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1049/1049 places, 1697/1697 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1034 transition count 1675
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1034 transition count 1675
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 41 place count 1023 transition count 1662
Iterating global reduction 0 with 11 rules applied. Total rules applied 52 place count 1023 transition count 1662
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 1017 transition count 1656
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 1017 transition count 1656
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 66 place count 1017 transition count 1654
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 1014 transition count 1651
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 1014 transition count 1651
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 1012 transition count 1649
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 1012 transition count 1649
Applied a total of 76 rules in 242 ms. Remains 1012 /1049 variables (removed 37) and now considering 1649/1697 (removed 48) transitions.
// Phase 1: matrix 1649 rows 1012 cols
[2024-05-22 03:35:00] [INFO ] Computed 69 invariants in 8 ms
[2024-05-22 03:35:00] [INFO ] Implicit Places using invariants in 530 ms returned []
[2024-05-22 03:35:00] [INFO ] Invariant cache hit.
[2024-05-22 03:35:02] [INFO ] Implicit Places using invariants and state equation in 1370 ms returned []
Implicit Place search using SMT with State Equation took 1902 ms to find 0 implicit places.
Running 1648 sub problems to find dead transitions.
[2024-05-22 03:35:02] [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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1011/2661 variables, and 0 constraints, problems are : Problem set: 0 solved, 1648 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1012 constraints, PredecessorRefiner: 1648/1648 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1648 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1011 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1648 unsolved
At refinement iteration 1 (OVERLAPS) 1/1012 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 1648 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/2661 variables, and 69 constraints, problems are : Problem set: 0 solved, 1648 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 0/1012 constraints, PredecessorRefiner: 0/1648 constraints, Known Traps: 0/0 constraints]
After SMT, in 60841ms problems are : Problem set: 0 solved, 1648 unsolved
Search for dead transitions found 0 dead transitions in 60876ms
Starting structural reductions in LTL mode, iteration 1 : 1012/1049 places, 1649/1697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63026 ms. Remains : 1012/1049 places, 1649/1697 transitions.
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-07
Product exploration explored 100000 steps with 88 reset in 659 ms.
Product exploration explored 100000 steps with 76 reset in 439 ms.
Computed a total of 133 stabilizing places and 133 stable transitions
Computed a total of 133 stabilizing places and 133 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 128 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 6350 steps (0 resets) in 32 ms. (192 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 11 factoid took 210 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-22 03:36:05] [INFO ] Invariant cache hit.
[2024-05-22 03:36:06] [INFO ] [Real]Absence check using 69 positive place invariants in 63 ms returned sat
[2024-05-22 03:36:08] [INFO ] [Real]Absence check using state equation in 1880 ms returned sat
[2024-05-22 03:36:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 03:36:09] [INFO ] [Nat]Absence check using 69 positive place invariants in 69 ms returned sat
[2024-05-22 03:36:11] [INFO ] [Nat]Absence check using state equation in 2008 ms returned sat
[2024-05-22 03:36:12] [INFO ] Computed and/alt/rep : 1603/3127/1603 causal constraints (skipped 45 transitions) in 116 ms.
Could not prove EG (NOT p2)
Support contains 2 out of 1012 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1012/1012 places, 1649/1649 transitions.
Applied a total of 0 rules in 29 ms. Remains 1012 /1012 variables (removed 0) and now considering 1649/1649 (removed 0) transitions.
[2024-05-22 03:36:23] [INFO ] Invariant cache hit.
[2024-05-22 03:36:24] [INFO ] Implicit Places using invariants in 486 ms returned []
[2024-05-22 03:36:24] [INFO ] Invariant cache hit.
[2024-05-22 03:36:25] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned []
Implicit Place search using SMT with State Equation took 1602 ms to find 0 implicit places.
Running 1648 sub problems to find dead transitions.
[2024-05-22 03:36:25] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1011/2661 variables, and 0 constraints, problems are : Problem set: 0 solved, 1648 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1012 constraints, PredecessorRefiner: 1648/1648 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1648 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1011 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1648 unsolved
At refinement iteration 1 (OVERLAPS) 1/1012 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 1648 unsolved
[2024-05-22 03:37:25] [INFO ] Deduced a trap composed of 61 places in 473 ms of which 6 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 1012/2661 variables, and 70 constraints, problems are : Problem set: 0 solved, 1648 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 0/1012 constraints, PredecessorRefiner: 0/1648 constraints, Known Traps: 1/1 constraints]
After SMT, in 60826ms problems are : Problem set: 0 solved, 1648 unsolved
Search for dead transitions found 0 dead transitions in 60853ms
Finished structural reductions in LTL mode , in 1 iterations and 62490 ms. Remains : 1012/1012 places, 1649/1649 transitions.
Computed a total of 133 stabilizing places and 133 stable transitions
Computed a total of 133 stabilizing places and 133 stable transitions
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 3741 steps (0 resets) in 18 ms. (196 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-22 03:37:26] [INFO ] Invariant cache hit.
[2024-05-22 03:37:27] [INFO ] [Real]Absence check using 69 positive place invariants in 62 ms returned sat
[2024-05-22 03:37:29] [INFO ] [Real]Absence check using state equation in 1824 ms returned sat
[2024-05-22 03:37:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 03:37:30] [INFO ] [Nat]Absence check using 69 positive place invariants in 64 ms returned sat
[2024-05-22 03:37:32] [INFO ] [Nat]Absence check using state equation in 1758 ms returned sat
[2024-05-22 03:37:32] [INFO ] Computed and/alt/rep : 1603/3127/1603 causal constraints (skipped 45 transitions) in 116 ms.
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 86 reset in 334 ms.
Product exploration explored 100000 steps with 80 reset in 407 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 1012 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1012/1012 places, 1649/1649 transitions.
Graph (trivial) has 937 edges and 1012 vertex of which 295 / 1012 are part of one of the 24 SCC in 1 ms
Free SCC test removed 271 places
Ensure Unique test removed 294 transitions
Reduce isomorphic transitions removed 294 transitions.
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 169 rules applied. Total rules applied 170 place count 741 transition count 1355
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 18 rules applied. Total rules applied 188 place count 741 transition count 1346
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 188 place count 741 transition count 1350
Deduced a syphon composed of 187 places in 2 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 197 place count 741 transition count 1350
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 297 place count 641 transition count 1094
Deduced a syphon composed of 124 places in 2 ms
Iterating global reduction 2 with 100 rules applied. Total rules applied 397 place count 641 transition count 1094
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 401 place count 641 transition count 1090
Performed 226 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 350 places in 0 ms
Iterating global reduction 3 with 226 rules applied. Total rules applied 627 place count 641 transition count 1095
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 632 place count 641 transition count 1090
Renaming transitions due to excessive name length > 1024 char.
Discarding 174 places :
Symmetric choice reduction at 4 with 174 rule applications. Total rules 806 place count 467 transition count 841
Deduced a syphon composed of 188 places in 0 ms
Iterating global reduction 4 with 174 rules applied. Total rules applied 980 place count 467 transition count 841
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 992 place count 467 transition count 829
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 997 place count 462 transition count 824
Deduced a syphon composed of 183 places in 0 ms
Iterating global reduction 5 with 5 rules applied. Total rules applied 1002 place count 462 transition count 824
Performed 26 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 209 places in 0 ms
Iterating global reduction 5 with 26 rules applied. Total rules applied 1028 place count 462 transition count 1011
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1041 place count 462 transition count 998
Discarding 34 places :
Symmetric choice reduction at 6 with 34 rule applications. Total rules 1075 place count 428 transition count 889
Deduced a syphon composed of 179 places in 0 ms
Iterating global reduction 6 with 34 rules applied. Total rules applied 1109 place count 428 transition count 889
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 1133 place count 428 transition count 865
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1141 place count 420 transition count 849
Deduced a syphon composed of 171 places in 1 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1149 place count 420 transition count 849
Deduced a syphon composed of 171 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 7 with 28 rules applied. Total rules applied 1177 place count 420 transition count 821
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1187 place count 410 transition count 801
Deduced a syphon composed of 171 places in 0 ms
Iterating global reduction 7 with 10 rules applied. Total rules applied 1197 place count 410 transition count 801
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1207 place count 400 transition count 715
Deduced a syphon composed of 171 places in 1 ms
Iterating global reduction 7 with 10 rules applied. Total rules applied 1217 place count 400 transition count 715
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1232 place count 400 transition count 700
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 1242 place count 390 transition count 685
Deduced a syphon composed of 161 places in 0 ms
Iterating global reduction 8 with 10 rules applied. Total rules applied 1252 place count 390 transition count 685
Deduced a syphon composed of 161 places in 0 ms
Applied a total of 1252 rules in 210 ms. Remains 390 /1012 variables (removed 622) and now considering 685/1649 (removed 964) transitions.
[2024-05-22 03:37:46] [INFO ] Redundant transitions in 9 ms returned []
Running 684 sub problems to find dead transitions.
[2024-05-22 03:37:46] [INFO ] Flow matrix only has 669 transitions (discarded 16 similar events)
// Phase 1: matrix 669 rows 390 cols
[2024-05-22 03:37:46] [INFO ] Computed 69 invariants in 5 ms
[2024-05-22 03:37:46] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 684 unsolved
At refinement iteration 1 (OVERLAPS) 1/390 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 684 unsolved
[2024-05-22 03:37:57] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 3 ms to minimize.
[2024-05-22 03:37:57] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
[2024-05-22 03:37:57] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
[2024-05-22 03:37:57] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-22 03:37:58] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
[2024-05-22 03:37:58] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
[2024-05-22 03:37:58] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
[2024-05-22 03:37:58] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
[2024-05-22 03:37:58] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
[2024-05-22 03:37:59] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
Problem TDEAD149 is UNSAT
[2024-05-22 03:37:59] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
Problem TDEAD152 is UNSAT
[2024-05-22 03:37:59] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
Problem TDEAD155 is UNSAT
[2024-05-22 03:37:59] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
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
[2024-05-22 03:37:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD194 is UNSAT
Problem TDEAD200 is UNSAT
[2024-05-22 03:37:59] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
Problem TDEAD201 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD211 is UNSAT
[2024-05-22 03:37:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD216 is UNSAT
[2024-05-22 03:37:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD217 is UNSAT
Problem TDEAD222 is UNSAT
[2024-05-22 03:37:59] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD223 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD233 is UNSAT
[2024-05-22 03:37:59] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD234 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD245 is UNSAT
[2024-05-22 03:38:00] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
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 TDEAD194 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 20/89 constraints. Problems are: Problem set: 139 solved, 545 unsolved
[2024-05-22 03:38:02] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD251 is UNSAT
[2024-05-22 03:38:02] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD257 is UNSAT
[2024-05-22 03:38:02] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD262 is UNSAT
[2024-05-22 03:38:02] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD268 is UNSAT
[2024-05-22 03:38:02] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD273 is UNSAT
[2024-05-22 03:38:02] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD279 is UNSAT
[2024-05-22 03:38:02] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD284 is UNSAT
[2024-05-22 03:38:03] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD291 is UNSAT
[2024-05-22 03:38:03] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD296 is UNSAT
[2024-05-22 03:38:03] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD302 is UNSAT
[2024-05-22 03:38:03] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Problem TDEAD307 is UNSAT
[2024-05-22 03:38:03] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD313 is UNSAT
[2024-05-22 03:38:03] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD318 is UNSAT
[2024-05-22 03:38:03] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD324 is UNSAT
[2024-05-22 03:38:03] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD329 is UNSAT
[2024-05-22 03:38:03] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD336 is UNSAT
[2024-05-22 03:38:03] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
Problem TDEAD341 is UNSAT
[2024-05-22 03:38:03] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD347 is UNSAT
[2024-05-22 03:38:03] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD352 is UNSAT
[2024-05-22 03:38:04] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD251 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 20/109 constraints. Problems are: Problem set: 159 solved, 525 unsolved
[2024-05-22 03:38:12] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD363 is UNSAT
[2024-05-22 03:38:12] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD369 is UNSAT
[2024-05-22 03:38:12] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD374 is UNSAT
[2024-05-22 03:38:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD381 is UNSAT
[2024-05-22 03:38:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD386 is UNSAT
[2024-05-22 03:38:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD392 is UNSAT
[2024-05-22 03:38:12] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD397 is UNSAT
[2024-05-22 03:38:13] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD403 is UNSAT
[2024-05-22 03:38:13] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD408 is UNSAT
[2024-05-22 03:38:13] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD414 is UNSAT
[2024-05-22 03:38:13] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD420 is UNSAT
[2024-05-22 03:38:13] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD426 is UNSAT
[2024-05-22 03:38:13] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD432 is UNSAT
[2024-05-22 03:38:13] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD438 is UNSAT
[2024-05-22 03:38:13] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD444 is UNSAT
[2024-05-22 03:38:13] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
Problem TDEAD450 is UNSAT
[2024-05-22 03:38:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD456 is UNSAT
[2024-05-22 03:38:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
Problem TDEAD462 is UNSAT
[2024-05-22 03:38:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD468 is UNSAT
[2024-05-22 03:38:13] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD363 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD474 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 20/129 constraints. Problems are: Problem set: 179 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 390/1059 variables, and 129 constraints, problems are : Problem set: 179 solved, 505 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 0/390 constraints, ReadFeed: 0/87 constraints, PredecessorRefiner: 684/684 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 179 solved, 505 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 179 solved, 505 unsolved
At refinement iteration 1 (OVERLAPS) 153/390 variables, 69/69 constraints. Problems are: Problem set: 179 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 60/129 constraints. Problems are: Problem set: 179 solved, 505 unsolved
[2024-05-22 03:38:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD480 is UNSAT
[2024-05-22 03:38:23] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD486 is UNSAT
[2024-05-22 03:38:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD492 is UNSAT
[2024-05-22 03:38:24] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD497 is UNSAT
[2024-05-22 03:38:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD502 is UNSAT
[2024-05-22 03:38:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD507 is UNSAT
[2024-05-22 03:38:25] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
[2024-05-22 03:38:25] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
[2024-05-22 03:38:25] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 9/138 constraints. Problems are: Problem set: 191 solved, 493 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 0/138 constraints. Problems are: Problem set: 191 solved, 493 unsolved
At refinement iteration 5 (OVERLAPS) 668/1058 variables, 390/528 constraints. Problems are: Problem set: 191 solved, 493 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1058 variables, 86/614 constraints. Problems are: Problem set: 191 solved, 493 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1058 variables, 493/1107 constraints. Problems are: Problem set: 191 solved, 493 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1058/1059 variables, and 1107 constraints, problems are : Problem set: 191 solved, 493 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 390/390 constraints, ReadFeed: 86/87 constraints, PredecessorRefiner: 493/684 constraints, Known Traps: 69/69 constraints]
After SMT, in 60384ms problems are : Problem set: 191 solved, 493 unsolved
Search for dead transitions found 191 dead transitions in 60391ms
Found 191 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 191 transitions
Dead transitions reduction (with SMT) removed 191 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 390/1012 places, 494/1649 transitions.
Graph (complete) has 895 edges and 390 vertex of which 229 are kept as prefixes of interest. Removing 161 places using SCC suffix rule.1 ms
Discarding 161 places :
Also discarding 0 output transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 229 transition count 536
Deduced a syphon composed of 4 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 0 with 27 rules applied. Total rules applied 32 place count 229 transition count 509
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 229 transition count 550
Deduced a syphon composed of 8 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 0 with 27 rules applied. Total rules applied 63 place count 229 transition count 523
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 67 place count 229 transition count 561
Deduced a syphon composed of 12 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 92 place count 229 transition count 536
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 96 place count 229 transition count 573
Deduced a syphon composed of 16 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 121 place count 229 transition count 548
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 125 place count 229 transition count 586
Deduced a syphon composed of 20 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 150 place count 229 transition count 561
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 154 place count 229 transition count 598
Deduced a syphon composed of 24 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 179 place count 229 transition count 573
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 183 place count 229 transition count 611
Deduced a syphon composed of 28 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 208 place count 229 transition count 586
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 212 place count 229 transition count 623
Deduced a syphon composed of 32 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 237 place count 229 transition count 598
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 241 place count 229 transition count 636
Deduced a syphon composed of 36 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 266 place count 229 transition count 611
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 270 place count 229 transition count 648
Deduced a syphon composed of 40 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 295 place count 229 transition count 623
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 299 place count 229 transition count 654
Deduced a syphon composed of 44 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 322 place count 229 transition count 631
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 326 place count 229 transition count 664
Deduced a syphon composed of 48 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 350 place count 229 transition count 640
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 354 place count 229 transition count 673
Deduced a syphon composed of 52 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 378 place count 229 transition count 649
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 382 place count 229 transition count 684
Deduced a syphon composed of 56 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 407 place count 229 transition count 659
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 408 place count 229 transition count 664
Deduced a syphon composed of 57 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 411 place count 229 transition count 661
Deduced a syphon composed of 57 places in 0 ms
Applied a total of 411 rules in 249 ms. Remains 229 /390 variables (removed 161) and now considering 661/494 (removed -167) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 229/1012 places, 661/1649 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60866 ms. Remains : 229/1012 places, 661/1649 transitions.
Built C files in :
/tmp/ltsmin6002367434992580670
[2024-05-22 03:38:46] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6002367434992580670
Running compilation step : cd /tmp/ltsmin6002367434992580670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6002367434992580670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6002367434992580670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 1012 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1012/1012 places, 1649/1649 transitions.
Applied a total of 0 rules in 38 ms. Remains 1012 /1012 variables (removed 0) and now considering 1649/1649 (removed 0) transitions.
// Phase 1: matrix 1649 rows 1012 cols
[2024-05-22 03:38:49] [INFO ] Computed 69 invariants in 4 ms
[2024-05-22 03:38:50] [INFO ] Implicit Places using invariants in 519 ms returned []
[2024-05-22 03:38:50] [INFO ] Invariant cache hit.
[2024-05-22 03:38:51] [INFO ] Implicit Places using invariants and state equation in 1378 ms returned []
Implicit Place search using SMT with State Equation took 1899 ms to find 0 implicit places.
Running 1648 sub problems to find dead transitions.
[2024-05-22 03:38:51] [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 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1011/2661 variables, and 0 constraints, problems are : Problem set: 0 solved, 1648 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1012 constraints, PredecessorRefiner: 1648/1648 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1648 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1011 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1648 unsolved
At refinement iteration 1 (OVERLAPS) 1/1012 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 1648 unsolved
[2024-05-22 03:39:51] [INFO ] Deduced a trap composed of 61 places in 429 ms of which 6 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 1012/2661 variables, and 70 constraints, problems are : Problem set: 0 solved, 1648 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 0/1012 constraints, PredecessorRefiner: 0/1648 constraints, Known Traps: 1/1 constraints]
After SMT, in 60838ms problems are : Problem set: 0 solved, 1648 unsolved
Search for dead transitions found 0 dead transitions in 60865ms
Finished structural reductions in LTL mode , in 1 iterations and 62808 ms. Remains : 1012/1012 places, 1649/1649 transitions.
Built C files in :
/tmp/ltsmin11803395042710859189
[2024-05-22 03:39:52] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11803395042710859189
Running compilation step : cd /tmp/ltsmin11803395042710859189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11803395042710859189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11803395042710859189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 03:39:55] [INFO ] Flatten gal took : 35 ms
[2024-05-22 03:39:55] [INFO ] Flatten gal took : 34 ms
[2024-05-22 03:39:55] [INFO ] Time to serialize gal into /tmp/LTL8159665608291578544.gal : 8 ms
[2024-05-22 03:39:55] [INFO ] Time to serialize properties into /tmp/LTL12942731588540072550.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8159665608291578544.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2994597550647438181.hoa' '-atoms' '/tmp/LTL12942731588540072550.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12942731588540072550.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2994597550647438181.hoa
Detected timeout of ITS tools.
[2024-05-22 03:40:10] [INFO ] Flatten gal took : 60 ms
[2024-05-22 03:40:10] [INFO ] Flatten gal took : 58 ms
[2024-05-22 03:40:10] [INFO ] Time to serialize gal into /tmp/LTL2559908755982653136.gal : 16 ms
[2024-05-22 03:40:10] [INFO ] Time to serialize properties into /tmp/LTL17792097975971380867.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2559908755982653136.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17792097975971380867.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((("(p44==1)")U(X(X("((p691==1)&&(p1316==1))"))))||(F("((p440==1)||(p44==1))"))))
Formula 0 simplified : (!"(p44==1)" R XX!"((p691==1)&&(p1316==1))") & G!"((p440==1)||(p44==1))"
Detected timeout of ITS tools.
[2024-05-22 03:40:26] [INFO ] Flatten gal took : 60 ms
[2024-05-22 03:40:26] [INFO ] Applying decomposition
[2024-05-22 03:40:26] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14360219557230390242.txt' '-o' '/tmp/graph14360219557230390242.bin' '-w' '/tmp/graph14360219557230390242.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14360219557230390242.bin' '-l' '-1' '-v' '-w' '/tmp/graph14360219557230390242.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:40:26] [INFO ] Decomposing Gal with order
[2024-05-22 03:40:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:40:26] [INFO ] Removed a total of 1326 redundant transitions.
[2024-05-22 03:40:26] [INFO ] Flatten gal took : 116 ms
[2024-05-22 03:40:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 32 ms.
[2024-05-22 03:40:26] [INFO ] Time to serialize gal into /tmp/LTL15055637636073919470.gal : 13 ms
[2024-05-22 03:40:26] [INFO ] Time to serialize properties into /tmp/LTL4236896101869830142.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15055637636073919470.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4236896101869830142.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((("(i0.i1.i3.u12.p44==1)")U(X(X("((i9.u165.p691==1)&&(i9.u322.p1316==1))"))))||(F("((i4.u93.p440==1)||(i0.i1.i3.u12.p44==1))"))))
Formula 0 simplified : (!"(i0.i1.i3.u12.p44==1)" R XX!"((i9.u165.p691==1)&&(i9.u322.p1316==1))") & G!"((i4.u93.p440==1)||(i0.i1.i3.u12.p44==1))"
Detected timeout of ITS tools.
Treatment of property DLCround-PT-04b-LTLFireability-07 finished in 341552 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((p0||X((p1 U p0)))))'
Support contains 2 out of 1049 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1049/1049 places, 1697/1697 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1033 transition count 1674
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1033 transition count 1674
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 45 place count 1020 transition count 1659
Iterating global reduction 0 with 13 rules applied. Total rules applied 58 place count 1020 transition count 1659
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 1020 transition count 1658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 66 place count 1013 transition count 1651
Iterating global reduction 1 with 7 rules applied. Total rules applied 73 place count 1013 transition count 1651
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 75 place count 1013 transition count 1649
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 79 place count 1009 transition count 1645
Iterating global reduction 2 with 4 rules applied. Total rules applied 83 place count 1009 transition count 1645
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 1007 transition count 1643
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 1007 transition count 1643
Applied a total of 87 rules in 142 ms. Remains 1007 /1049 variables (removed 42) and now considering 1643/1697 (removed 54) transitions.
// Phase 1: matrix 1643 rows 1007 cols
[2024-05-22 03:40:41] [INFO ] Computed 69 invariants in 4 ms
[2024-05-22 03:40:42] [INFO ] Implicit Places using invariants in 546 ms returned []
[2024-05-22 03:40:42] [INFO ] Invariant cache hit.
[2024-05-22 03:40:44] [INFO ] Implicit Places using invariants and state equation in 1600 ms returned []
Implicit Place search using SMT with State Equation took 2160 ms to find 0 implicit places.
Running 1642 sub problems to find dead transitions.
[2024-05-22 03:40:44] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2650 variables, and 0 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1007 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2650 variables, and 0 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1007 constraints, PredecessorRefiner: 0/1642 constraints, Known Traps: 0/0 constraints]
After SMT, in 60772ms problems are : Problem set: 0 solved, 1642 unsolved
Search for dead transitions found 0 dead transitions in 60798ms
Starting structural reductions in LTL mode, iteration 1 : 1007/1049 places, 1643/1697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63107 ms. Remains : 1007/1049 places, 1643/1697 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-08 finished in 63228 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 1049 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1049/1049 places, 1697/1697 transitions.
Graph (trivial) has 979 edges and 1049 vertex of which 301 / 1049 are part of one of the 24 SCC in 1 ms
Free SCC test removed 277 places
Ensure Unique test removed 300 transitions
Reduce isomorphic transitions removed 300 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 197 place count 771 transition count 1200
Reduce places removed 196 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 227 rules applied. Total rules applied 424 place count 575 transition count 1169
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 23 rules applied. Total rules applied 447 place count 556 transition count 1165
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 449 place count 554 transition count 1165
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 72 Pre rules applied. Total rules applied 449 place count 554 transition count 1093
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 593 place count 482 transition count 1093
Discarding 44 places :
Symmetric choice reduction at 4 with 44 rule applications. Total rules 637 place count 438 transition count 893
Iterating global reduction 4 with 44 rules applied. Total rules applied 681 place count 438 transition count 893
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 685 place count 438 transition count 889
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 685 place count 438 transition count 887
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 689 place count 436 transition count 887
Performed 158 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 5 with 316 rules applied. Total rules applied 1005 place count 278 transition count 724
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1010 place count 278 transition count 719
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1024 place count 264 transition count 619
Iterating global reduction 6 with 14 rules applied. Total rules applied 1038 place count 264 transition count 619
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1052 place count 264 transition count 605
Performed 16 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 1084 place count 248 transition count 699
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1088 place count 244 transition count 653
Iterating global reduction 7 with 4 rules applied. Total rules applied 1092 place count 244 transition count 653
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 1113 place count 244 transition count 632
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 8 with 23 rules applied. Total rules applied 1136 place count 244 transition count 609
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1145 place count 235 transition count 591
Iterating global reduction 8 with 9 rules applied. Total rules applied 1154 place count 235 transition count 591
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1163 place count 226 transition count 518
Iterating global reduction 8 with 9 rules applied. Total rules applied 1172 place count 226 transition count 518
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 1181 place count 226 transition count 509
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1182 place count 225 transition count 508
Applied a total of 1182 rules in 105 ms. Remains 225 /1049 variables (removed 824) and now considering 508/1697 (removed 1189) transitions.
[2024-05-22 03:41:45] [INFO ] Flow matrix only has 489 transitions (discarded 19 similar events)
// Phase 1: matrix 489 rows 225 cols
[2024-05-22 03:41:45] [INFO ] Computed 69 invariants in 1 ms
[2024-05-22 03:41:45] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 03:41:45] [INFO ] Flow matrix only has 489 transitions (discarded 19 similar events)
[2024-05-22 03:41:45] [INFO ] Invariant cache hit.
[2024-05-22 03:41:45] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-22 03:41:45] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2024-05-22 03:41:45] [INFO ] Redundant transitions in 5 ms returned []
Running 455 sub problems to find dead transitions.
[2024-05-22 03:41:45] [INFO ] Flow matrix only has 489 transitions (discarded 19 similar events)
[2024-05-22 03:41:45] [INFO ] Invariant cache hit.
[2024-05-22 03:41:45] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 1/225 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (OVERLAPS) 488/713 variables, 225/294 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/713 variables, 34/328 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 7 (OVERLAPS) 0/713 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 455 unsolved
No progress, stopping.
After SMT solving in domain Real declared 713/714 variables, and 328 constraints, problems are : Problem set: 0 solved, 455 unsolved in 25298 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 225/225 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 1/225 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (OVERLAPS) 488/713 variables, 225/294 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/713 variables, 34/328 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 455/783 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 8 (OVERLAPS) 0/713 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 455 unsolved
No progress, stopping.
After SMT solving in domain Int declared 713/714 variables, and 783 constraints, problems are : Problem set: 0 solved, 455 unsolved in 29293 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 225/225 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 0/0 constraints]
After SMT, in 54797ms problems are : Problem set: 0 solved, 455 unsolved
Search for dead transitions found 0 dead transitions in 54801ms
Starting structural reductions in SI_LTL mode, iteration 1 : 225/1049 places, 508/1697 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55530 ms. Remains : 225/1049 places, 508/1697 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-09
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-04b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-09 finished in 55624 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||G(p1)))))'
Support contains 3 out of 1049 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1049/1049 places, 1697/1697 transitions.
Graph (trivial) has 977 edges and 1049 vertex of which 301 / 1049 are part of one of the 24 SCC in 1 ms
Free SCC test removed 277 places
Ensure Unique test removed 300 transitions
Reduce isomorphic transitions removed 300 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 194 rules applied. Total rules applied 195 place count 771 transition count 1202
Reduce places removed 194 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 225 rules applied. Total rules applied 420 place count 577 transition count 1171
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 23 rules applied. Total rules applied 443 place count 558 transition count 1167
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 445 place count 556 transition count 1167
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 71 Pre rules applied. Total rules applied 445 place count 556 transition count 1096
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 587 place count 485 transition count 1096
Discarding 43 places :
Symmetric choice reduction at 4 with 43 rule applications. Total rules 630 place count 442 transition count 894
Iterating global reduction 4 with 43 rules applied. Total rules applied 673 place count 442 transition count 894
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 676 place count 442 transition count 891
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 676 place count 442 transition count 889
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 680 place count 440 transition count 889
Performed 159 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 159 places in 0 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 5 with 318 rules applied. Total rules applied 998 place count 281 transition count 725
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1003 place count 281 transition count 720
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1016 place count 268 transition count 625
Iterating global reduction 6 with 13 rules applied. Total rules applied 1029 place count 268 transition count 625
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1042 place count 268 transition count 612
Performed 16 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 1074 place count 252 transition count 708
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1078 place count 248 transition count 664
Iterating global reduction 7 with 4 rules applied. Total rules applied 1082 place count 248 transition count 664
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 1104 place count 248 transition count 642
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 8 with 25 rules applied. Total rules applied 1129 place count 248 transition count 617
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 1139 place count 238 transition count 597
Iterating global reduction 8 with 10 rules applied. Total rules applied 1149 place count 238 transition count 597
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 1159 place count 228 transition count 513
Iterating global reduction 8 with 10 rules applied. Total rules applied 1169 place count 228 transition count 513
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1179 place count 228 transition count 503
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1180 place count 227 transition count 502
Applied a total of 1180 rules in 123 ms. Remains 227 /1049 variables (removed 822) and now considering 502/1697 (removed 1195) transitions.
[2024-05-22 03:42:40] [INFO ] Flow matrix only has 484 transitions (discarded 18 similar events)
// Phase 1: matrix 484 rows 227 cols
[2024-05-22 03:42:40] [INFO ] Computed 69 invariants in 1 ms
[2024-05-22 03:42:40] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-22 03:42:40] [INFO ] Flow matrix only has 484 transitions (discarded 18 similar events)
[2024-05-22 03:42:40] [INFO ] Invariant cache hit.
[2024-05-22 03:42:41] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-22 03:42:41] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2024-05-22 03:42:41] [INFO ] Redundant transitions in 5 ms returned []
Running 448 sub problems to find dead transitions.
[2024-05-22 03:42:41] [INFO ] Flow matrix only has 484 transitions (discarded 18 similar events)
[2024-05-22 03:42:41] [INFO ] Invariant cache hit.
[2024-05-22 03:42:41] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (OVERLAPS) 1/227 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (OVERLAPS) 483/710 variables, 227/296 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/710 variables, 34/330 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/710 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 7 (OVERLAPS) 0/710 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 448 unsolved
No progress, stopping.
After SMT solving in domain Real declared 710/711 variables, and 330 constraints, problems are : Problem set: 0 solved, 448 unsolved in 22886 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 227/227 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (OVERLAPS) 1/227 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (OVERLAPS) 483/710 variables, 227/296 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/710 variables, 34/330 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/710 variables, 448/778 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/710 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 8 (OVERLAPS) 0/710 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 448 unsolved
No progress, stopping.
After SMT solving in domain Int declared 710/711 variables, and 778 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 227/227 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 0/0 constraints]
After SMT, in 53092ms problems are : Problem set: 0 solved, 448 unsolved
Search for dead transitions found 0 dead transitions in 53096ms
Starting structural reductions in SI_LTL mode, iteration 1 : 227/1049 places, 502/1697 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53829 ms. Remains : 227/1049 places, 502/1697 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-10
Stuttering criterion allowed to conclude after 188 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-04b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-10 finished in 53926 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(p0)||(F(p1)&&X((p2 U p3)))))'
Support contains 6 out of 1049 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1049/1049 places, 1697/1697 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1034 transition count 1682
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1034 transition count 1682
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 42 place count 1022 transition count 1668
Iterating global reduction 0 with 12 rules applied. Total rules applied 54 place count 1022 transition count 1668
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 1022 transition count 1667
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 62 place count 1015 transition count 1660
Iterating global reduction 1 with 7 rules applied. Total rules applied 69 place count 1015 transition count 1660
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 1015 transition count 1658
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 75 place count 1011 transition count 1654
Iterating global reduction 2 with 4 rules applied. Total rules applied 79 place count 1011 transition count 1654
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 81 place count 1009 transition count 1652
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 1009 transition count 1652
Applied a total of 83 rules in 142 ms. Remains 1009 /1049 variables (removed 40) and now considering 1652/1697 (removed 45) transitions.
// Phase 1: matrix 1652 rows 1009 cols
[2024-05-22 03:43:34] [INFO ] Computed 69 invariants in 4 ms
[2024-05-22 03:43:35] [INFO ] Implicit Places using invariants in 504 ms returned []
[2024-05-22 03:43:35] [INFO ] Invariant cache hit.
[2024-05-22 03:43:36] [INFO ] Implicit Places using invariants and state equation in 1389 ms returned []
Implicit Place search using SMT with State Equation took 1905 ms to find 0 implicit places.
Running 1651 sub problems to find dead transitions.
[2024-05-22 03:43:36] [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)timeout

( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1008/2661 variables, and 0 constraints, problems are : Problem set: 0 solved, 1651 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1009 constraints, PredecessorRefiner: 1651/1651 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1651 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1008/2661 variables, and 0 constraints, problems are : Problem set: 0 solved, 1651 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1009 constraints, PredecessorRefiner: 0/1651 constraints, Known Traps: 0/0 constraints]
After SMT, in 60762ms problems are : Problem set: 0 solved, 1651 unsolved
Search for dead transitions found 0 dead transitions in 60789ms
Starting structural reductions in LTL mode, iteration 1 : 1009/1049 places, 1652/1697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62842 ms. Remains : 1009/1049 places, 1652/1697 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3)), true, (NOT p0)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-12 finished in 63171 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||F(p1)))))'
Support contains 2 out of 1049 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1049/1049 places, 1697/1697 transitions.
Graph (trivial) has 976 edges and 1049 vertex of which 301 / 1049 are part of one of the 24 SCC in 0 ms
Free SCC test removed 277 places
Ensure Unique test removed 300 transitions
Reduce isomorphic transitions removed 300 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 193 place count 771 transition count 1204
Reduce places removed 192 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 223 rules applied. Total rules applied 416 place count 579 transition count 1173
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 23 rules applied. Total rules applied 439 place count 560 transition count 1169
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 442 place count 558 transition count 1168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 443 place count 557 transition count 1168
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 72 Pre rules applied. Total rules applied 443 place count 557 transition count 1096
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 587 place count 485 transition count 1096
Discarding 44 places :
Symmetric choice reduction at 5 with 44 rule applications. Total rules 631 place count 441 transition count 889
Iterating global reduction 5 with 44 rules applied. Total rules applied 675 place count 441 transition count 889
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 679 place count 441 transition count 885
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 679 place count 441 transition count 883
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 683 place count 439 transition count 883
Performed 159 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 159 places in 0 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 6 with 318 rules applied. Total rules applied 1001 place count 280 transition count 719
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1006 place count 280 transition count 714
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1020 place count 266 transition count 614
Iterating global reduction 7 with 14 rules applied. Total rules applied 1034 place count 266 transition count 614
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1048 place count 266 transition count 600
Performed 15 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 8 with 30 rules applied. Total rules applied 1078 place count 251 transition count 690
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1081 place count 248 transition count 654
Iterating global reduction 8 with 3 rules applied. Total rules applied 1084 place count 248 transition count 654
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 1100 place count 248 transition count 638
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 9 with 24 rules applied. Total rules applied 1124 place count 248 transition count 614
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 1134 place count 238 transition count 594
Iterating global reduction 9 with 10 rules applied. Total rules applied 1144 place count 238 transition count 594
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 1154 place count 228 transition count 512
Iterating global reduction 9 with 10 rules applied. Total rules applied 1164 place count 228 transition count 512
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1174 place count 228 transition count 502
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1175 place count 227 transition count 501
Applied a total of 1175 rules in 123 ms. Remains 227 /1049 variables (removed 822) and now considering 501/1697 (removed 1196) transitions.
[2024-05-22 03:44:37] [INFO ] Flow matrix only has 483 transitions (discarded 18 similar events)
// Phase 1: matrix 483 rows 227 cols
[2024-05-22 03:44:37] [INFO ] Computed 69 invariants in 2 ms
[2024-05-22 03:44:38] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-22 03:44:38] [INFO ] Flow matrix only has 483 transitions (discarded 18 similar events)
[2024-05-22 03:44:38] [INFO ] Invariant cache hit.
[2024-05-22 03:44:38] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 03:44:38] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
[2024-05-22 03:44:38] [INFO ] Redundant transitions in 8 ms returned []
Running 452 sub problems to find dead transitions.
[2024-05-22 03:44:38] [INFO ] Flow matrix only has 483 transitions (discarded 18 similar events)
[2024-05-22 03:44:38] [INFO ] Invariant cache hit.
[2024-05-22 03:44:38] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (OVERLAPS) 2/227 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 482/709 variables, 227/296 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/709 variables, 37/333 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/709 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 7 (OVERLAPS) 0/709 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 452 unsolved
No progress, stopping.
After SMT solving in domain Real declared 709/710 variables, and 333 constraints, problems are : Problem set: 0 solved, 452 unsolved in 25326 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 227/227 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (OVERLAPS) 2/227 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 482/709 variables, 227/296 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/709 variables, 37/333 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/709 variables, 452/785 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/709 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 8 (OVERLAPS) 0/709 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 452 unsolved
No progress, stopping.
After SMT solving in domain Int declared 709/710 variables, and 785 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 227/227 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 0/0 constraints]
After SMT, in 55633ms problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 55639ms
Starting structural reductions in SI_LTL mode, iteration 1 : 227/1049 places, 501/1697 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56521 ms. Remains : 227/1049 places, 501/1697 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-04b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-13 finished in 56653 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))||(p1 U (p2||G(p1))))))'
Support contains 3 out of 1049 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1049/1049 places, 1697/1697 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1035 transition count 1676
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1035 transition count 1676
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 38 place count 1025 transition count 1665
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 1025 transition count 1665
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 1025 transition count 1664
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 1020 transition count 1659
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 1020 transition count 1659
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 1020 transition count 1658
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 1017 transition count 1655
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 1017 transition count 1655
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 1016 transition count 1654
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 1016 transition count 1654
Applied a total of 68 rules in 238 ms. Remains 1016 /1049 variables (removed 33) and now considering 1654/1697 (removed 43) transitions.
// Phase 1: matrix 1654 rows 1016 cols
[2024-05-22 03:45:34] [INFO ] Computed 69 invariants in 10 ms
[2024-05-22 03:45:35] [INFO ] Implicit Places using invariants in 700 ms returned []
[2024-05-22 03:45:35] [INFO ] Invariant cache hit.
[2024-05-22 03:45:36] [INFO ] Implicit Places using invariants and state equation in 1533 ms returned []
Implicit Place search using SMT with State Equation took 2235 ms to find 0 implicit places.
Running 1653 sub problems to find dead transitions.
[2024-05-22 03:45:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1015 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
SMT process timed out in 30460ms, After SMT, problems are : Problem set: 0 solved, 1653 unsolved
Search for dead transitions found 0 dead transitions in 30475ms
Starting structural reductions in LTL mode, iteration 1 : 1016/1049 places, 1654/1697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32953 ms. Remains : 1016/1049 places, 1654/1697 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 342 ms.
Product exploration explored 100000 steps with 50000 reset in 417 ms.
Computed a total of 133 stabilizing places and 133 stable transitions
Computed a total of 133 stabilizing places and 133 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 15 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-04b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-04b-LTLFireability-14 finished in 33933 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(!p0) U p1))'
Support contains 4 out of 1049 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1049/1049 places, 1697/1697 transitions.
Graph (trivial) has 968 edges and 1049 vertex of which 282 / 1049 are part of one of the 25 SCC in 0 ms
Free SCC test removed 257 places
Ensure Unique test removed 277 transitions
Reduce isomorphic transitions removed 277 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 202 place count 791 transition count 1218
Reduce places removed 201 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 232 rules applied. Total rules applied 434 place count 590 transition count 1187
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 23 rules applied. Total rules applied 457 place count 571 transition count 1183
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 462 place count 569 transition count 1180
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 465 place count 566 transition count 1180
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 74 Pre rules applied. Total rules applied 465 place count 566 transition count 1106
Deduced a syphon composed of 74 places in 2 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 613 place count 492 transition count 1106
Discarding 41 places :
Symmetric choice reduction at 5 with 41 rule applications. Total rules 654 place count 451 transition count 909
Iterating global reduction 5 with 41 rules applied. Total rules applied 695 place count 451 transition count 909
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 699 place count 451 transition count 905
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 699 place count 451 transition count 903
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 703 place count 449 transition count 903
Performed 161 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 161 places in 0 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 6 with 322 rules applied. Total rules applied 1025 place count 288 transition count 738
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1029 place count 288 transition count 734
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1041 place count 276 transition count 647
Iterating global reduction 7 with 12 rules applied. Total rules applied 1053 place count 276 transition count 647
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1064 place count 276 transition count 636
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1066 place count 275 transition count 635
Performed 17 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 1100 place count 258 transition count 737
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1101 place count 258 transition count 736
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1105 place count 254 transition count 690
Iterating global reduction 9 with 4 rules applied. Total rules applied 1109 place count 254 transition count 690
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 1130 place count 254 transition count 669
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 10 with 22 rules applied. Total rules applied 1152 place count 254 transition count 647
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 1159 place count 247 transition count 633
Iterating global reduction 10 with 7 rules applied. Total rules applied 1166 place count 247 transition count 633
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 1173 place count 240 transition count 575
Iterating global reduction 10 with 7 rules applied. Total rules applied 1180 place count 240 transition count 575
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 1187 place count 240 transition count 568
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1188 place count 240 transition count 568
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1189 place count 239 transition count 567
Applied a total of 1189 rules in 134 ms. Remains 239 /1049 variables (removed 810) and now considering 567/1697 (removed 1130) transitions.
[2024-05-22 03:46:08] [INFO ] Flow matrix only has 545 transitions (discarded 22 similar events)
// Phase 1: matrix 545 rows 239 cols
[2024-05-22 03:46:08] [INFO ] Computed 69 invariants in 1 ms
[2024-05-22 03:46:08] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-22 03:46:08] [INFO ] Flow matrix only has 545 transitions (discarded 22 similar events)
[2024-05-22 03:46:08] [INFO ] Invariant cache hit.
[2024-05-22 03:46:08] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-22 03:46:09] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2024-05-22 03:46:09] [INFO ] Redundant transitions in 7 ms returned []
Running 514 sub problems to find dead transitions.
[2024-05-22 03:46:09] [INFO ] Flow matrix only has 545 transitions (discarded 22 similar events)
[2024-05-22 03:46:09] [INFO ] Invariant cache hit.
[2024-05-22 03:46:09] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 2 (OVERLAPS) 2/239 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 4 (OVERLAPS) 544/783 variables, 239/308 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/783 variables, 32/340 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/783 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 7 (OVERLAPS) 0/783 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 514 unsolved
No progress, stopping.
After SMT solving in domain Real declared 783/784 variables, and 340 constraints, problems are : Problem set: 0 solved, 514 unsolved in 28514 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 239/239 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 514/514 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 514 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 2 (OVERLAPS) 2/239 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 4 (OVERLAPS) 544/783 variables, 239/308 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/783 variables, 32/340 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/783 variables, 514/854 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/783 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 514 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 783/784 variables, and 854 constraints, problems are : Problem set: 0 solved, 514 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 239/239 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 514/514 constraints, Known Traps: 0/0 constraints]
After SMT, in 58801ms problems are : Problem set: 0 solved, 514 unsolved
Search for dead transitions found 0 dead transitions in 58806ms
Starting structural reductions in SI_LTL mode, iteration 1 : 239/1049 places, 567/1697 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59621 ms. Remains : 239/1049 places, 567/1697 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), true, p0]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-15 finished in 59718 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))))'
Found a Shortening insensitive property : DLCround-PT-04b-LTLFireability-03
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 1049 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1049/1049 places, 1697/1697 transitions.
Graph (trivial) has 977 edges and 1049 vertex of which 286 / 1049 are part of one of the 25 SCC in 2 ms
Free SCC test removed 261 places
Ensure Unique test removed 281 transitions
Reduce isomorphic transitions removed 281 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 201 place count 787 transition count 1215
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 231 rules applied. Total rules applied 432 place count 587 transition count 1184
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 23 rules applied. Total rules applied 455 place count 568 transition count 1180
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 458 place count 566 transition count 1179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 459 place count 565 transition count 1179
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 74 Pre rules applied. Total rules applied 459 place count 565 transition count 1105
Deduced a syphon composed of 74 places in 2 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 607 place count 491 transition count 1105
Discarding 42 places :
Symmetric choice reduction at 5 with 42 rule applications. Total rules 649 place count 449 transition count 907
Iterating global reduction 5 with 42 rules applied. Total rules applied 691 place count 449 transition count 907
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 695 place count 449 transition count 903
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 695 place count 449 transition count 901
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 699 place count 447 transition count 901
Performed 161 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 161 places in 0 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 6 with 322 rules applied. Total rules applied 1021 place count 286 transition count 735
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1026 place count 286 transition count 730
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1039 place count 273 transition count 638
Iterating global reduction 7 with 13 rules applied. Total rules applied 1052 place count 273 transition count 638
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1064 place count 273 transition count 626
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1066 place count 272 transition count 625
Performed 22 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 8 with 44 rules applied. Total rules applied 1110 place count 250 transition count 772
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1111 place count 250 transition count 771
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1115 place count 246 transition count 719
Iterating global reduction 9 with 4 rules applied. Total rules applied 1119 place count 246 transition count 719
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 9 with 23 rules applied. Total rules applied 1142 place count 246 transition count 696
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 1151 place count 246 transition count 687
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1152 place count 245 transition count 686
Applied a total of 1152 rules in 94 ms. Remains 245 /1049 variables (removed 804) and now considering 686/1697 (removed 1011) transitions.
[2024-05-22 03:47:08] [INFO ] Flow matrix only has 643 transitions (discarded 43 similar events)
// Phase 1: matrix 643 rows 245 cols
[2024-05-22 03:47:08] [INFO ] Computed 69 invariants in 2 ms
[2024-05-22 03:47:08] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-22 03:47:08] [INFO ] Flow matrix only has 643 transitions (discarded 43 similar events)
[2024-05-22 03:47:08] [INFO ] Invariant cache hit.
[2024-05-22 03:47:08] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-22 03:47:09] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
Running 628 sub problems to find dead transitions.
[2024-05-22 03:47:09] [INFO ] Flow matrix only has 643 transitions (discarded 43 similar events)
[2024-05-22 03:47:09] [INFO ] Invariant cache hit.
[2024-05-22 03:47:09] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 2 (OVERLAPS) 2/245 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 4 (OVERLAPS) 642/887 variables, 245/314 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/887 variables, 54/368 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/887 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 628 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 887/888 variables, and 368 constraints, problems are : Problem set: 0 solved, 628 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 245/245 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 628/628 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 628 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 2 (OVERLAPS) 2/245 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 4 (OVERLAPS) 642/887 variables, 245/314 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/887 variables, 54/368 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/887 variables, 628/996 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/887 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 628 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 887/888 variables, and 996 constraints, problems are : Problem set: 0 solved, 628 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 245/245 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 628/628 constraints, Known Traps: 0/0 constraints]
After SMT, in 60290ms problems are : Problem set: 0 solved, 628 unsolved
Search for dead transitions found 0 dead transitions in 60296ms
Starting structural reductions in LI_LTL mode, iteration 1 : 245/1049 places, 686/1697 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61097 ms. Remains : 245/1049 places, 686/1697 transitions.
Running random walk in product with property : DLCround-PT-04b-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
Treatment of property DLCround-PT-04b-LTLFireability-03 finished in 61373 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(((X(p0) U ((p1&&X(p0))||X(G(p0)))) U p2)) U (!p0||G(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' '!(((p0 U X(X(p1)))||F(p2)))'
[2024-05-22 03:48:09] [INFO ] Flatten gal took : 53 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6787039175187459308
[2024-05-22 03:48:09] [INFO ] Too many transitions (1697) to apply POR reductions. Disabling POR matrices.
[2024-05-22 03:48:09] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6787039175187459308
Running compilation step : cd /tmp/ltsmin6787039175187459308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-22 03:48:09] [INFO ] Applying decomposition
[2024-05-22 03:48:09] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6318633721005330062.txt' '-o' '/tmp/graph6318633721005330062.bin' '-w' '/tmp/graph6318633721005330062.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6318633721005330062.bin' '-l' '-1' '-v' '-w' '/tmp/graph6318633721005330062.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:48:10] [INFO ] Decomposing Gal with order
[2024-05-22 03:48:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:48:10] [INFO ] Removed a total of 1321 redundant transitions.
[2024-05-22 03:48:10] [INFO ] Flatten gal took : 112 ms
[2024-05-22 03:48:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 28 ms.
[2024-05-22 03:48:10] [INFO ] Time to serialize gal into /tmp/LTLFireability13812416885009975709.gal : 20 ms
[2024-05-22 03:48:10] [INFO ] Time to serialize properties into /tmp/LTLFireability12870386064856665008.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13812416885009975709.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12870386064856665008.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((X((X(F("(i3.i1.i3.u328.p1310==0)")))&&(F("((i3.i1.i3.u328.p1310==1)||(i7.i1.i6.u156.p640==1))")))))
Formula 0 simplified : X(XG!"(i3.i1.i3.u328.p1310==0)" | G!"((i3.i1.i3.u328.p1310==1)||(i7.i1.i6.u156.p640==1))")
Compilation finished in 6397 ms.
Running link step : cd /tmp/ltsmin6787039175187459308;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin6787039175187459308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(<>((LTLAPp0==true)))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 4084 ms.
FORMULA DLCround-PT-04b-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin6787039175187459308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(((X((LTLAPp2==true)) U (((LTLAPp3==true)&&X((LTLAPp2==true)))||X([]((LTLAPp2==true))))) U (LTLAPp4==true))) U (!(LTLAPp2==true)||[]((LTLAPp5==true))))' '--buchi-type=spotba'
LTSmin run took 957 ms.
FORMULA DLCround-PT-04b-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin6787039175187459308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp6==true) U X(X((LTLAPp7==true))))||<>((LTLAPp8==true)))' '--buchi-type=spotba'
LTSmin run took 23925 ms.
FORMULA DLCround-PT-04b-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1805469 ms.

BK_STOP 1716349725312

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="DLCround-PT-04b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DLCround-PT-04b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-smll-171624275400140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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