Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490500009.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is StigmergyCommit-PT-02b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490500009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 231K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2023-12
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2023-14
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2023-15
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2025-00
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2025-01
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2025-02
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2025-03
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2025-04
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2025-05
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2025-06
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2025-07
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2025-08
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2025-09
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2025-10
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1749049341856

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-04 15:02:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 15:02:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 15:02:25] [INFO ] Load time of PNML (sax parser for PT used): 273 ms
[2025-06-04 15:02:25] [INFO ] Transformed 928 places.
[2025-06-04 15:02:25] [INFO ] Transformed 1040 transitions.
[2025-06-04 15:02:25] [INFO ] Found NUPN structural information;
[2025-06-04 15:02:25] [INFO ] Parsed PT model containing 928 places and 1040 transitions and 2439 arcs in 512 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 29 ms.
Support contains 77 out of 928 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 928/928 places, 1040/1040 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 864 transition count 976
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 864 transition count 976
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 165 place count 827 transition count 939
Iterating global reduction 0 with 37 rules applied. Total rules applied 202 place count 827 transition count 939
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 221 place count 808 transition count 920
Iterating global reduction 0 with 19 rules applied. Total rules applied 240 place count 808 transition count 920
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 255 place count 793 transition count 905
Iterating global reduction 0 with 15 rules applied. Total rules applied 270 place count 793 transition count 905
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 283 place count 780 transition count 892
Iterating global reduction 0 with 13 rules applied. Total rules applied 296 place count 780 transition count 892
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 308 place count 768 transition count 880
Iterating global reduction 0 with 12 rules applied. Total rules applied 320 place count 768 transition count 880
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 332 place count 756 transition count 868
Iterating global reduction 0 with 12 rules applied. Total rules applied 344 place count 756 transition count 868
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 356 place count 744 transition count 856
Iterating global reduction 0 with 12 rules applied. Total rules applied 368 place count 744 transition count 856
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 377 place count 735 transition count 847
Iterating global reduction 0 with 9 rules applied. Total rules applied 386 place count 735 transition count 847
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 393 place count 728 transition count 840
Iterating global reduction 0 with 7 rules applied. Total rules applied 400 place count 728 transition count 840
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 402 place count 728 transition count 838
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 403 place count 727 transition count 837
Iterating global reduction 1 with 1 rules applied. Total rules applied 404 place count 727 transition count 837
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 405 place count 726 transition count 836
Iterating global reduction 1 with 1 rules applied. Total rules applied 406 place count 726 transition count 836
Applied a total of 406 rules in 1120 ms. Remains 726 /928 variables (removed 202) and now considering 836/1040 (removed 204) transitions.
// Phase 1: matrix 836 rows 726 cols
[2025-06-04 15:02:26] [INFO ] Computed 4 invariants in 52 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:02:27] [INFO ] Implicit Places using invariants in 1380 ms returned []
[2025-06-04 15:02:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:02:29] [INFO ] Implicit Places using invariants and state equation in 1688 ms returned []
Implicit Place search using SMT with State Equation took 3124 ms to find 0 implicit places.
Running 835 sub problems to find dead transitions.
[2025-06-04 15:02:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 725/1562 variables, and 0 constraints, problems are : Problem set: 0 solved, 835 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, State Equation: 0/726 constraints, PredecessorRefiner: 835/835 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 835 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 725/1562 variables, and 0 constraints, problems are : Problem set: 0 solved, 835 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, State Equation: 0/726 constraints, PredecessorRefiner: 0/835 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60627ms problems are : Problem set: 0 solved, 835 unsolved
Search for dead transitions found 0 dead transitions in 60672ms
Starting structural reductions in LTL mode, iteration 1 : 726/928 places, 836/1040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64979 ms. Remains : 726/928 places, 836/1040 transitions.
Support contains 77 out of 726 places after structural reductions.
[2025-06-04 15:03:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-04 15:03:30] [INFO ] Flatten gal took : 190 ms
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 15:03:30] [INFO ] Flatten gal took : 94 ms
[2025-06-04 15:03:31] [INFO ] Input system was already deterministic with 836 transitions.
Support contains 75 out of 726 places (down from 77) after GAL structural reductions.
RANDOM walk for 40000 steps (654 resets) in 3287 ms. (12 steps per ms) remains 21/44 properties
BEST_FIRST walk for 4004 steps (14 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (15 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (14 resets) in 45 ms. (87 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 39 ms. (100 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (14 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (18 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (15 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (15 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (15 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 25 ms. (154 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (14 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (13 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (15 resets) in 54 ms. (72 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (16 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (14 resets) in 14 ms. (266 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
[2025-06-04 15:03:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp36 is UNSAT
At refinement iteration 1 (OVERLAPS) 690/726 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:03:33] [INFO ] Deduced a trap composed of 328 places in 556 ms of which 195 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:03:34] [INFO ] Deduced a trap composed of 331 places in 580 ms of which 198 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/726 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/726 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 836/1562 variables, 726/732 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:03:37] [INFO ] Deduced a trap composed of 331 places in 464 ms of which 36 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1562/1562 variables, and 733 constraints, problems are : Problem set: 1 solved, 19 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 726/726 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 19 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 693/726 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/726 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:03:38] [INFO ] Deduced a trap composed of 335 places in 480 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:03:39] [INFO ] Deduced a trap composed of 334 places in 514 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:03:40] [INFO ] Deduced a trap composed of 326 places in 983 ms of which 395 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:03:41] [INFO ] Deduced a trap composed of 328 places in 719 ms of which 163 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/726 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/1562 variables, and 11 constraints, problems are : Problem set: 1 solved, 19 unsolved in 5046 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/726 constraints, PredecessorRefiner: 0/20 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10079ms problems are : Problem set: 1 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 726 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 726/726 places, 836/836 transitions.
Graph (trivial) has 661 edges and 726 vertex of which 41 / 726 are part of one of the 7 SCC in 9 ms
Free SCC test removed 34 places
Drop transitions (Empty/Sink Transition effects.) removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Graph (complete) has 990 edges and 692 vertex of which 690 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 469 transitions
Trivial Post-agglo rules discarded 469 transitions
Performed 469 trivial Post agglomeration. Transition count delta: 469
Iterating post reduction 0 with 471 rules applied. Total rules applied 473 place count 690 transition count 319
Reduce places removed 469 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 479 rules applied. Total rules applied 952 place count 221 transition count 309
Reduce places removed 4 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 2 with 21 rules applied. Total rules applied 973 place count 217 transition count 292
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 990 place count 200 transition count 292
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 990 place count 200 transition count 257
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 1060 place count 165 transition count 257
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1066 place count 159 transition count 251
Iterating global reduction 4 with 6 rules applied. Total rules applied 1072 place count 159 transition count 251
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1073 place count 158 transition count 242
Iterating global reduction 4 with 1 rules applied. Total rules applied 1074 place count 158 transition count 242
Performed 24 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1122 place count 134 transition count 217
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1126 place count 134 transition count 213
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1141 place count 119 transition count 177
Iterating global reduction 5 with 15 rules applied. Total rules applied 1156 place count 119 transition count 177
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1160 place count 119 transition count 173
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1165 place count 114 transition count 167
Iterating global reduction 6 with 5 rules applied. Total rules applied 1170 place count 114 transition count 167
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1174 place count 110 transition count 163
Iterating global reduction 6 with 4 rules applied. Total rules applied 1178 place count 110 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1180 place count 110 transition count 161
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1184 place count 108 transition count 159
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1190 place count 105 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1191 place count 105 transition count 169
Free-agglomeration rule applied 22 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1213 place count 105 transition count 145
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 1238 place count 83 transition count 142
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 1253 place count 83 transition count 127
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1254 place count 83 transition count 127
Applied a total of 1254 rules in 202 ms. Remains 83 /726 variables (removed 643) and now considering 127/836 (removed 709) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 83/726 places, 127/836 transitions.
RANDOM walk for 40000 steps (3220 resets) in 702 ms. (56 steps per ms) remains 5/19 properties
BEST_FIRST walk for 40004 steps (963 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (838 resets) in 99 ms. (400 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40001 steps (851 resets) in 132 ms. (300 steps per ms) remains 2/4 properties
// Phase 1: matrix 127 rows 83 cols
[2025-06-04 15:03:43] [INFO ] Computed 4 invariants in 8 ms
[2025-06-04 15:03:43] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/83 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 127/210 variables, 83/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 44/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 131 constraints, problems are : Problem set: 0 solved, 2 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 83/83 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/83 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 127/210 variables, 83/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 44/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 133 constraints, problems are : Problem set: 0 solved, 2 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 83/83 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 428ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 16 ms.
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 127/127 transitions.
Graph (trivial) has 54 edges and 83 vertex of which 2 / 83 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 82 transition count 98
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 55 transition count 97
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 56 place count 55 transition count 94
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 52 transition count 94
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 67 place count 47 transition count 89
Iterating global reduction 2 with 5 rules applied. Total rules applied 72 place count 47 transition count 89
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 44 transition count 86
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 44 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 43 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 43 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 43 transition count 84
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 89 place count 39 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 91 place count 39 transition count 78
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 95 place count 35 transition count 73
Iterating global reduction 4 with 4 rules applied. Total rules applied 99 place count 35 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 100 place count 35 transition count 72
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 103 place count 32 transition count 69
Iterating global reduction 5 with 3 rules applied. Total rules applied 106 place count 32 transition count 69
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 109 place count 32 transition count 66
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 110 place count 31 transition count 65
Iterating global reduction 6 with 1 rules applied. Total rules applied 111 place count 31 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 113 place count 31 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 115 place count 30 transition count 65
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 120 place count 30 transition count 60
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 133 place count 25 transition count 52
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 136 place count 22 transition count 49
Iterating global reduction 8 with 3 rules applied. Total rules applied 139 place count 22 transition count 49
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 142 place count 22 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 143 place count 22 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 145 place count 22 transition count 46
Applied a total of 145 rules in 40 ms. Remains 22 /83 variables (removed 61) and now considering 46/127 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 22/83 places, 46/127 transitions.
RANDOM walk for 10543 steps (3 resets) in 31 ms. (329 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2025-06-04 15:03:43] [INFO ] Flatten gal took : 45 ms
[2025-06-04 15:03:43] [INFO ] Flatten gal took : 57 ms
[2025-06-04 15:03:44] [INFO ] Input system was already deterministic with 836 transitions.
Computed a total of 132 stabilizing places and 138 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 726/726 places, 836/836 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 706 transition count 816
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 706 transition count 816
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 692 transition count 802
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 692 transition count 802
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 77 place count 683 transition count 793
Iterating global reduction 0 with 9 rules applied. Total rules applied 86 place count 683 transition count 793
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 95 place count 674 transition count 784
Iterating global reduction 0 with 9 rules applied. Total rules applied 104 place count 674 transition count 784
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 113 place count 665 transition count 775
Iterating global reduction 0 with 9 rules applied. Total rules applied 122 place count 665 transition count 775
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 123 place count 665 transition count 774
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 131 place count 657 transition count 766
Iterating global reduction 1 with 8 rules applied. Total rules applied 139 place count 657 transition count 766
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 146 place count 650 transition count 759
Iterating global reduction 1 with 7 rules applied. Total rules applied 153 place count 650 transition count 759
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 159 place count 644 transition count 753
Iterating global reduction 1 with 6 rules applied. Total rules applied 165 place count 644 transition count 753
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 170 place count 639 transition count 748
Iterating global reduction 1 with 5 rules applied. Total rules applied 175 place count 639 transition count 748
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 180 place count 634 transition count 743
Iterating global reduction 1 with 5 rules applied. Total rules applied 185 place count 634 transition count 743
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 189 place count 630 transition count 739
Iterating global reduction 1 with 4 rules applied. Total rules applied 193 place count 630 transition count 739
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 196 place count 627 transition count 736
Iterating global reduction 1 with 3 rules applied. Total rules applied 199 place count 627 transition count 736
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 202 place count 624 transition count 733
Iterating global reduction 1 with 3 rules applied. Total rules applied 205 place count 624 transition count 733
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 208 place count 621 transition count 730
Iterating global reduction 1 with 3 rules applied. Total rules applied 211 place count 621 transition count 730
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 214 place count 618 transition count 727
Iterating global reduction 1 with 3 rules applied. Total rules applied 217 place count 618 transition count 727
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 220 place count 615 transition count 724
Iterating global reduction 1 with 3 rules applied. Total rules applied 223 place count 615 transition count 724
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 226 place count 612 transition count 721
Iterating global reduction 1 with 3 rules applied. Total rules applied 229 place count 612 transition count 721
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 232 place count 609 transition count 718
Iterating global reduction 1 with 3 rules applied. Total rules applied 235 place count 609 transition count 718
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 238 place count 606 transition count 715
Iterating global reduction 1 with 3 rules applied. Total rules applied 241 place count 606 transition count 715
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 244 place count 603 transition count 712
Iterating global reduction 1 with 3 rules applied. Total rules applied 247 place count 603 transition count 712
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 250 place count 600 transition count 709
Iterating global reduction 1 with 3 rules applied. Total rules applied 253 place count 600 transition count 709
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 256 place count 597 transition count 706
Iterating global reduction 1 with 3 rules applied. Total rules applied 259 place count 597 transition count 706
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 262 place count 597 transition count 703
Applied a total of 262 rules in 432 ms. Remains 597 /726 variables (removed 129) and now considering 703/836 (removed 133) transitions.
// Phase 1: matrix 703 rows 597 cols
[2025-06-04 15:03:44] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:03:44] [INFO ] Implicit Places using invariants in 344 ms returned []
[2025-06-04 15:03:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:03:45] [INFO ] Implicit Places using invariants and state equation in 1058 ms returned []
Implicit Place search using SMT with State Equation took 1406 ms to find 0 implicit places.
Running 702 sub problems to find dead transitions.
[2025-06-04 15:03:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 702 unsolved
SMT process timed out in 30212ms, After SMT, problems are : Problem set: 0 solved, 702 unsolved
Search for dead transitions found 0 dead transitions in 30218ms
Starting structural reductions in LTL mode, iteration 1 : 597/726 places, 703/836 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32062 ms. Remains : 597/726 places, 703/836 transitions.
[2025-06-04 15:04:16] [INFO ] Flatten gal took : 49 ms
[2025-06-04 15:04:16] [INFO ] Flatten gal took : 51 ms
[2025-06-04 15:04:16] [INFO ] Input system was already deterministic with 703 transitions.
[2025-06-04 15:04:16] [INFO ] Flatten gal took : 40 ms
[2025-06-04 15:04:16] [INFO ] Flatten gal took : 39 ms
[2025-06-04 15:04:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality5897840796770514047.gal : 37 ms
[2025-06-04 15:04:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality7402206609033121780.ctl : 4 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5897840796770514047.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7402206609033121780.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.60671e+07,6.19388,115248,2,12550,5,347819,6,0,3093,524910,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 15:04:46] [INFO ] Flatten gal took : 26 ms
[2025-06-04 15:04:46] [INFO ] Applying decomposition
[2025-06-04 15:04:46] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17609232849278439329.txt' '-o' '/tmp/graph17609232849278439329.bin' '-w' '/tmp/graph17609232849278439329.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17609232849278439329.bin' '-l' '-1' '-v' '-w' '/tmp/graph17609232849278439329.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:04:46] [INFO ] Decomposing Gal with order
[2025-06-04 15:04:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:04:47] [INFO ] Removed a total of 368 redundant transitions.
[2025-06-04 15:04:47] [INFO ] Flatten gal took : 126 ms
[2025-06-04 15:04:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 24 ms.
[2025-06-04 15:04:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality16581162749167330626.gal : 22 ms
[2025-06-04 15:04:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality10642263383897916871.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16581162749167330626.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10642263383897916871.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.60671e+07,0.306965,11000,931,20,12545,650,915,15264,66,1319,0


Converting to forward existential form...Done !
original formula: (EG(AX(EX(((i9.u77.p319==0)||(i12.u111.p412==1))))) + EG(EF((((i14.u124.p444==0)||(i23.i1.i0.u195.p729==0))||((i10.i0.i0.u81.p327==1)&&(i...182
=> equivalent forward existential formula: ([FwdG(Init,!(EX(!(EX(((i9.u77.p319==0)||(i12.u111.p412==1)))))))] != FALSE + [FwdG(Init,E(TRUE U (((i14.u124.p4...255
Reverse transition relation is NOT exact ! Due to transitions t68, t121, t325, t414, t441, t569, t570, t573, t576, t581, t584, t587, t588, t591, t594, t597...552
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
(forward)formula 0,1,16.8604,362232,1,0,698001,650,6545,1.06038e+06,283,1551,1720783
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 726/726 places, 836/836 transitions.
Graph (trivial) has 716 edges and 726 vertex of which 53 / 726 are part of one of the 9 SCC in 4 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 513 transitions
Trivial Post-agglo rules discarded 513 transitions
Performed 513 trivial Post agglomeration. Transition count delta: 513
Iterating post reduction 0 with 513 rules applied. Total rules applied 514 place count 681 transition count 272
Reduce places removed 513 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 521 rules applied. Total rules applied 1035 place count 168 transition count 264
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1038 place count 165 transition count 264
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 1038 place count 165 transition count 229
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 1108 place count 130 transition count 229
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1119 place count 119 transition count 218
Iterating global reduction 3 with 11 rules applied. Total rules applied 1130 place count 119 transition count 218
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1130 place count 119 transition count 217
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1132 place count 118 transition count 217
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1134 place count 116 transition count 207
Iterating global reduction 3 with 2 rules applied. Total rules applied 1136 place count 116 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1137 place count 116 transition count 206
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 1173 place count 98 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1175 place count 98 transition count 186
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1195 place count 78 transition count 139
Iterating global reduction 5 with 20 rules applied. Total rules applied 1215 place count 78 transition count 139
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1222 place count 78 transition count 132
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1234 place count 66 transition count 117
Iterating global reduction 6 with 12 rules applied. Total rules applied 1246 place count 66 transition count 117
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1257 place count 55 transition count 104
Iterating global reduction 6 with 11 rules applied. Total rules applied 1268 place count 55 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1274 place count 55 transition count 98
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 7 with 2 rules applied. Total rules applied 1276 place count 54 transition count 97
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1277 place count 53 transition count 93
Iterating global reduction 7 with 1 rules applied. Total rules applied 1278 place count 53 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1279 place count 53 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1282 place count 53 transition count 89
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1288 place count 50 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1289 place count 49 transition count 85
Applied a total of 1289 rules in 110 ms. Remains 49 /726 variables (removed 677) and now considering 85/836 (removed 751) transitions.
[2025-06-04 15:05:04] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
// Phase 1: matrix 81 rows 49 cols
[2025-06-04 15:05:04] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:05:04] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-04 15:05:04] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2025-06-04 15:05:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:05:04] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-04 15:05:04] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:05:04] [INFO ] Redundant transitions in 2 ms returned []
Running 78 sub problems to find dead transitions.
[2025-06-04 15:05:04] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2025-06-04 15:05:04] [INFO ] Invariant cache hit.
[2025-06-04 15:05:04] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 3/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:05] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:05] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:05] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:05] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:05] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:05] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:05] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 80/129 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/130 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:09] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 10 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 12 (OVERLAPS) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 66 constraints, problems are : Problem set: 0 solved, 78 unsolved in 7182 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 3/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 80/129 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 78/143 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 1/130 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:15] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:16] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 146 constraints, problems are : Problem set: 0 solved, 78 unsolved in 8964 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16165ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 16166ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/726 places, 85/836 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16511 ms. Remains : 49/726 places, 85/836 transitions.
[2025-06-04 15:05:20] [INFO ] Flatten gal took : 12 ms
[2025-06-04 15:05:20] [INFO ] Flatten gal took : 6 ms
[2025-06-04 15:05:20] [INFO ] Input system was already deterministic with 85 transitions.
[2025-06-04 15:05:20] [INFO ] Flatten gal took : 5 ms
[2025-06-04 15:05:20] [INFO ] Flatten gal took : 6 ms
[2025-06-04 15:05:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality5850980113249486042.gal : 1 ms
[2025-06-04 15:05:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality3505364499034915810.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5850980113249486042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3505364499034915810.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5582,0.072689,5116,2,785,5,4846,6,0,275,4976,0


Converting to forward existential form...Done !
original formula: AF(((p778==0)&&(p92==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((p778==0)&&(p92==1))))] = FALSE
Hit Full ! (commute/partial/dont) 78/0/7
(forward)formula 0,0,0.341554,9852,1,0,21,27756,20,4,1511,24157,20
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 726/726 places, 836/836 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 709 transition count 819
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 709 transition count 819
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 45 place count 698 transition count 808
Iterating global reduction 0 with 11 rules applied. Total rules applied 56 place count 698 transition count 808
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 691 transition count 801
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 691 transition count 801
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 684 transition count 794
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 684 transition count 794
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 677 transition count 787
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 677 transition count 787
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 99 place count 677 transition count 786
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 105 place count 671 transition count 780
Iterating global reduction 1 with 6 rules applied. Total rules applied 111 place count 671 transition count 780
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 116 place count 666 transition count 775
Iterating global reduction 1 with 5 rules applied. Total rules applied 121 place count 666 transition count 775
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 126 place count 661 transition count 770
Iterating global reduction 1 with 5 rules applied. Total rules applied 131 place count 661 transition count 770
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 135 place count 657 transition count 766
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 657 transition count 766
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 143 place count 653 transition count 762
Iterating global reduction 1 with 4 rules applied. Total rules applied 147 place count 653 transition count 762
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 150 place count 650 transition count 759
Iterating global reduction 1 with 3 rules applied. Total rules applied 153 place count 650 transition count 759
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 156 place count 647 transition count 756
Iterating global reduction 1 with 3 rules applied. Total rules applied 159 place count 647 transition count 756
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 162 place count 644 transition count 753
Iterating global reduction 1 with 3 rules applied. Total rules applied 165 place count 644 transition count 753
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 168 place count 641 transition count 750
Iterating global reduction 1 with 3 rules applied. Total rules applied 171 place count 641 transition count 750
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 174 place count 638 transition count 747
Iterating global reduction 1 with 3 rules applied. Total rules applied 177 place count 638 transition count 747
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 180 place count 635 transition count 744
Iterating global reduction 1 with 3 rules applied. Total rules applied 183 place count 635 transition count 744
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 186 place count 632 transition count 741
Iterating global reduction 1 with 3 rules applied. Total rules applied 189 place count 632 transition count 741
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 192 place count 629 transition count 738
Iterating global reduction 1 with 3 rules applied. Total rules applied 195 place count 629 transition count 738
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 198 place count 626 transition count 735
Iterating global reduction 1 with 3 rules applied. Total rules applied 201 place count 626 transition count 735
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 204 place count 623 transition count 732
Iterating global reduction 1 with 3 rules applied. Total rules applied 207 place count 623 transition count 732
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 209 place count 621 transition count 730
Iterating global reduction 1 with 2 rules applied. Total rules applied 211 place count 621 transition count 730
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 213 place count 619 transition count 728
Iterating global reduction 1 with 2 rules applied. Total rules applied 215 place count 619 transition count 728
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 217 place count 619 transition count 726
Applied a total of 217 rules in 647 ms. Remains 619 /726 variables (removed 107) and now considering 726/836 (removed 110) transitions.
// Phase 1: matrix 726 rows 619 cols
[2025-06-04 15:05:21] [INFO ] Computed 4 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:05:22] [INFO ] Implicit Places using invariants in 498 ms returned []
[2025-06-04 15:05:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:05:23] [INFO ] Implicit Places using invariants and state equation in 1173 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
Running 725 sub problems to find dead transitions.
[2025-06-04 15:05:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 725 unsolved
SMT process timed out in 30183ms, After SMT, problems are : Problem set: 0 solved, 725 unsolved
Search for dead transitions found 0 dead transitions in 30188ms
Starting structural reductions in LTL mode, iteration 1 : 619/726 places, 726/836 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32516 ms. Remains : 619/726 places, 726/836 transitions.
[2025-06-04 15:05:53] [INFO ] Flatten gal took : 31 ms
[2025-06-04 15:05:53] [INFO ] Flatten gal took : 30 ms
[2025-06-04 15:05:53] [INFO ] Input system was already deterministic with 726 transitions.
[2025-06-04 15:05:53] [INFO ] Flatten gal took : 29 ms
[2025-06-04 15:05:53] [INFO ] Flatten gal took : 29 ms
[2025-06-04 15:05:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality8689629032118938904.gal : 7 ms
[2025-06-04 15:05:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality15816177123425864965.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8689629032118938904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15816177123425864965.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.11862e+07,6.55018,129364,2,13172,5,387692,6,0,3204,610617,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 15:06:24] [INFO ] Flatten gal took : 30 ms
[2025-06-04 15:06:24] [INFO ] Applying decomposition
[2025-06-04 15:06:24] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17817719035192786337.txt' '-o' '/tmp/graph17817719035192786337.bin' '-w' '/tmp/graph17817719035192786337.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17817719035192786337.bin' '-l' '-1' '-v' '-w' '/tmp/graph17817719035192786337.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:06:24] [INFO ] Decomposing Gal with order
[2025-06-04 15:06:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:06:24] [INFO ] Removed a total of 381 redundant transitions.
[2025-06-04 15:06:24] [INFO ] Flatten gal took : 78 ms
[2025-06-04 15:06:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 17 ms.
[2025-06-04 15:06:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality13895568792178011962.gal : 17 ms
[2025-06-04 15:06:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality16031114704563333220.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13895568792178011962.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16031114704563333220.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.11862e+07,2.11075,57084,1570,24,102382,437,966,253522,66,886,0


Converting to forward existential form...Done !
original formula: (EG((EF((!(E(((i0.u2.p7==0)||(i13.i1.i1.u109.p370==1)) U (i3.u28.p86==1))) + AF((i9.u1.p256==0)))) * ((i21.u168.p628==0)||(i17.u140.p464=...349
=> equivalent forward existential formula: [(EY(FwdU((Init * EG((E(TRUE U (!(E(((i0.u2.p7==0)||(i13.i1.i1.u109.p370==1)) U (i3.u28.p86==1))) + !(EG(!((i9.u...413
Reverse transition relation is NOT exact ! Due to transitions t154, t210, t244, t330, t331, t332, t388, t514, t515, t571, t588, t589, t592, t595, t600, t60...501
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 726/726 places, 836/836 transitions.
Graph (trivial) has 714 edges and 726 vertex of which 53 / 726 are part of one of the 9 SCC in 3 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 511 transitions
Trivial Post-agglo rules discarded 511 transitions
Performed 511 trivial Post agglomeration. Transition count delta: 511
Iterating post reduction 0 with 511 rules applied. Total rules applied 512 place count 681 transition count 274
Reduce places removed 511 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 519 rules applied. Total rules applied 1031 place count 170 transition count 266
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1034 place count 167 transition count 266
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 1034 place count 167 transition count 231
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 1104 place count 132 transition count 231
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1115 place count 121 transition count 220
Iterating global reduction 3 with 11 rules applied. Total rules applied 1126 place count 121 transition count 220
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1126 place count 121 transition count 219
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1128 place count 120 transition count 219
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1130 place count 118 transition count 209
Iterating global reduction 3 with 2 rules applied. Total rules applied 1132 place count 118 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1133 place count 118 transition count 208
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 1169 place count 100 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1171 place count 100 transition count 188
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1191 place count 80 transition count 141
Iterating global reduction 5 with 20 rules applied. Total rules applied 1211 place count 80 transition count 141
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1219 place count 80 transition count 133
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1229 place count 70 transition count 121
Iterating global reduction 6 with 10 rules applied. Total rules applied 1239 place count 70 transition count 121
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1249 place count 60 transition count 109
Iterating global reduction 6 with 10 rules applied. Total rules applied 1259 place count 60 transition count 109
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1264 place count 60 transition count 104
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 7 with 2 rules applied. Total rules applied 1266 place count 59 transition count 103
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1267 place count 58 transition count 99
Iterating global reduction 7 with 1 rules applied. Total rules applied 1268 place count 58 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1269 place count 58 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1272 place count 58 transition count 95
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1278 place count 55 transition count 92
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1279 place count 54 transition count 91
Applied a total of 1279 rules in 55 ms. Remains 54 /726 variables (removed 672) and now considering 91/836 (removed 745) transitions.
[2025-06-04 15:06:54] [INFO ] Flow matrix only has 87 transitions (discarded 4 similar events)
// Phase 1: matrix 87 rows 54 cols
[2025-06-04 15:06:54] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:06:54] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-04 15:06:54] [INFO ] Flow matrix only has 87 transitions (discarded 4 similar events)
[2025-06-04 15:06:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:06:54] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-04 15:06:54] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:06:54] [INFO ] Redundant transitions in 2 ms returned []
Running 84 sub problems to find dead transitions.
[2025-06-04 15:06:54] [INFO ] Flow matrix only has 87 transitions (discarded 4 similar events)
[2025-06-04 15:06:54] [INFO ] Invariant cache hit.
[2025-06-04 15:06:54] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 3/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:55] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:55] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:55] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:55] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:55] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:55] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:56] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:56] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 86/140 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/141 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:58] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 0/141 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 72 constraints, problems are : Problem set: 0 solved, 84 unsolved in 6226 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 3/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 86/140 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 84/155 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 1/141 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:07:04] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (OVERLAPS) 0/141 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 157 constraints, problems are : Problem set: 0 solved, 84 unsolved in 7628 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13866ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 13866ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/726 places, 91/836 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14094 ms. Remains : 54/726 places, 91/836 transitions.
[2025-06-04 15:07:08] [INFO ] Flatten gal took : 3 ms
[2025-06-04 15:07:08] [INFO ] Flatten gal took : 3 ms
[2025-06-04 15:07:08] [INFO ] Input system was already deterministic with 91 transitions.
[2025-06-04 15:07:08] [INFO ] Flatten gal took : 3 ms
[2025-06-04 15:07:08] [INFO ] Flatten gal took : 3 ms
[2025-06-04 15:07:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13070792602593044503.gal : 1 ms
[2025-06-04 15:07:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6928728853165129945.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13070792602593044503.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6928728853165129945.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 20968 steps (2715 resets) in 138 ms. (150 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Starting structural reductions in LTL mode, iteration 0 : 726/726 places, 836/836 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 710 transition count 820
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 710 transition count 820
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 44 place count 698 transition count 808
Iterating global reduction 0 with 12 rules applied. Total rules applied 56 place count 698 transition count 808
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 691 transition count 801
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 691 transition count 801
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 684 transition count 794
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 684 transition count 794
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 677 transition count 787
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 677 transition count 787
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 105 place count 670 transition count 780
Iterating global reduction 0 with 7 rules applied. Total rules applied 112 place count 670 transition count 780
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 118 place count 664 transition count 774
Iterating global reduction 0 with 6 rules applied. Total rules applied 124 place count 664 transition count 774
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 129 place count 659 transition count 769
Iterating global reduction 0 with 5 rules applied. Total rules applied 134 place count 659 transition count 769
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 138 place count 655 transition count 765
Iterating global reduction 0 with 4 rules applied. Total rules applied 142 place count 655 transition count 765
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 146 place count 651 transition count 761
Iterating global reduction 0 with 4 rules applied. Total rules applied 150 place count 651 transition count 761
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 153 place count 648 transition count 758
Iterating global reduction 0 with 3 rules applied. Total rules applied 156 place count 648 transition count 758
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 159 place count 645 transition count 755
Iterating global reduction 0 with 3 rules applied. Total rules applied 162 place count 645 transition count 755
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 165 place count 642 transition count 752
Iterating global reduction 0 with 3 rules applied. Total rules applied 168 place count 642 transition count 752
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 171 place count 639 transition count 749
Iterating global reduction 0 with 3 rules applied. Total rules applied 174 place count 639 transition count 749
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 177 place count 636 transition count 746
Iterating global reduction 0 with 3 rules applied. Total rules applied 180 place count 636 transition count 746
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 183 place count 633 transition count 743
Iterating global reduction 0 with 3 rules applied. Total rules applied 186 place count 633 transition count 743
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 189 place count 630 transition count 740
Iterating global reduction 0 with 3 rules applied. Total rules applied 192 place count 630 transition count 740
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 194 place count 628 transition count 738
Iterating global reduction 0 with 2 rules applied. Total rules applied 196 place count 628 transition count 738
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 198 place count 626 transition count 736
Iterating global reduction 0 with 2 rules applied. Total rules applied 200 place count 626 transition count 736
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 202 place count 624 transition count 734
Iterating global reduction 0 with 2 rules applied. Total rules applied 204 place count 624 transition count 734
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 206 place count 622 transition count 732
Iterating global reduction 0 with 2 rules applied. Total rules applied 208 place count 622 transition count 732
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 210 place count 620 transition count 730
Iterating global reduction 0 with 2 rules applied. Total rules applied 212 place count 620 transition count 730
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 214 place count 620 transition count 728
Applied a total of 214 rules in 391 ms. Remains 620 /726 variables (removed 106) and now considering 728/836 (removed 108) transitions.
// Phase 1: matrix 728 rows 620 cols
[2025-06-04 15:07:09] [INFO ] Computed 4 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:07:09] [INFO ] Implicit Places using invariants in 412 ms returned []
[2025-06-04 15:07:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:07:10] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1260 ms to find 0 implicit places.
Running 727 sub problems to find dead transitions.
[2025-06-04 15:07:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/619 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 727 unsolved
SMT process timed out in 30090ms, After SMT, problems are : Problem set: 0 solved, 727 unsolved
Search for dead transitions found 0 dead transitions in 30092ms
Starting structural reductions in LTL mode, iteration 1 : 620/726 places, 728/836 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31745 ms. Remains : 620/726 places, 728/836 transitions.
[2025-06-04 15:07:40] [INFO ] Flatten gal took : 25 ms
[2025-06-04 15:07:40] [INFO ] Flatten gal took : 24 ms
[2025-06-04 15:07:40] [INFO ] Input system was already deterministic with 728 transitions.
[2025-06-04 15:07:40] [INFO ] Flatten gal took : 22 ms
[2025-06-04 15:07:40] [INFO ] Flatten gal took : 23 ms
[2025-06-04 15:07:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality3890140067615435820.gal : 6 ms
[2025-06-04 15:07:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality16103118140443757880.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3890140067615435820.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16103118140443757880.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.15033e+07,6.65933,122592,2,13410,5,388538,6,0,3210,561969,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 15:08:10] [INFO ] Flatten gal took : 13 ms
[2025-06-04 15:08:10] [INFO ] Applying decomposition
[2025-06-04 15:08:10] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17631375522537691610.txt' '-o' '/tmp/graph17631375522537691610.bin' '-w' '/tmp/graph17631375522537691610.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17631375522537691610.bin' '-l' '-1' '-v' '-w' '/tmp/graph17631375522537691610.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:08:10] [INFO ] Decomposing Gal with order
[2025-06-04 15:08:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:08:10] [INFO ] Removed a total of 395 redundant transitions.
[2025-06-04 15:08:10] [INFO ] Flatten gal took : 38 ms
[2025-06-04 15:08:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 10 ms.
[2025-06-04 15:08:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality12019042077518612588.gal : 7 ms
[2025-06-04 15:08:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality16094756975585750340.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12019042077518612588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16094756975585750340.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.15033e+07,0.447064,14376,1060,22,18602,495,1031,31033,72,1019,0


Converting to forward existential form...Done !
original formula: EG(A(((!(EG((i10.u113.p391==0))) + AG(AX(((i24.i0.i2.u218.p787==0)||(i27.u236.p906==1))))) + (((i5.i1.i0.u68.p234==1)&&((i8.u79.p287==0)|...319
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(!(EX(!((((i6.u59.p176==1)||(i0.u4.p22==0)) * EG((i0.u29.p74==0)))))))) U (!(((!(EG((i10.u113...557
Reverse transition relation is NOT exact ! Due to transitions t8, t157, t210, t213, t274, t387, t420, t517, t574, t590, t591, t594, t597, t602, t605, t606,...551
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 726/726 places, 836/836 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 705 transition count 815
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 705 transition count 815
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 56 place count 691 transition count 801
Iterating global reduction 0 with 14 rules applied. Total rules applied 70 place count 691 transition count 801
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 79 place count 682 transition count 792
Iterating global reduction 0 with 9 rules applied. Total rules applied 88 place count 682 transition count 792
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 97 place count 673 transition count 783
Iterating global reduction 0 with 9 rules applied. Total rules applied 106 place count 673 transition count 783
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 115 place count 664 transition count 774
Iterating global reduction 0 with 9 rules applied. Total rules applied 124 place count 664 transition count 774
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 125 place count 664 transition count 773
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 133 place count 656 transition count 765
Iterating global reduction 1 with 8 rules applied. Total rules applied 141 place count 656 transition count 765
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 148 place count 649 transition count 758
Iterating global reduction 1 with 7 rules applied. Total rules applied 155 place count 649 transition count 758
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 161 place count 643 transition count 752
Iterating global reduction 1 with 6 rules applied. Total rules applied 167 place count 643 transition count 752
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 172 place count 638 transition count 747
Iterating global reduction 1 with 5 rules applied. Total rules applied 177 place count 638 transition count 747
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 182 place count 633 transition count 742
Iterating global reduction 1 with 5 rules applied. Total rules applied 187 place count 633 transition count 742
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 191 place count 629 transition count 738
Iterating global reduction 1 with 4 rules applied. Total rules applied 195 place count 629 transition count 738
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 198 place count 626 transition count 735
Iterating global reduction 1 with 3 rules applied. Total rules applied 201 place count 626 transition count 735
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 204 place count 623 transition count 732
Iterating global reduction 1 with 3 rules applied. Total rules applied 207 place count 623 transition count 732
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 210 place count 620 transition count 729
Iterating global reduction 1 with 3 rules applied. Total rules applied 213 place count 620 transition count 729
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 216 place count 617 transition count 726
Iterating global reduction 1 with 3 rules applied. Total rules applied 219 place count 617 transition count 726
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 222 place count 614 transition count 723
Iterating global reduction 1 with 3 rules applied. Total rules applied 225 place count 614 transition count 723
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 228 place count 611 transition count 720
Iterating global reduction 1 with 3 rules applied. Total rules applied 231 place count 611 transition count 720
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 234 place count 608 transition count 717
Iterating global reduction 1 with 3 rules applied. Total rules applied 237 place count 608 transition count 717
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 240 place count 605 transition count 714
Iterating global reduction 1 with 3 rules applied. Total rules applied 243 place count 605 transition count 714
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 246 place count 602 transition count 711
Iterating global reduction 1 with 3 rules applied. Total rules applied 249 place count 602 transition count 711
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 252 place count 599 transition count 708
Iterating global reduction 1 with 3 rules applied. Total rules applied 255 place count 599 transition count 708
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 258 place count 596 transition count 705
Iterating global reduction 1 with 3 rules applied. Total rules applied 261 place count 596 transition count 705
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 264 place count 596 transition count 702
Applied a total of 264 rules in 368 ms. Remains 596 /726 variables (removed 130) and now considering 702/836 (removed 134) transitions.
// Phase 1: matrix 702 rows 596 cols
[2025-06-04 15:08:41] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:08:41] [INFO ] Implicit Places using invariants in 347 ms returned []
[2025-06-04 15:08:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:08:42] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 1392 ms to find 0 implicit places.
Running 701 sub problems to find dead transitions.
[2025-06-04 15:08:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/595 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 701 unsolved
SMT process timed out in 30135ms, After SMT, problems are : Problem set: 0 solved, 701 unsolved
Search for dead transitions found 0 dead transitions in 30139ms
Starting structural reductions in LTL mode, iteration 1 : 596/726 places, 702/836 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31901 ms. Remains : 596/726 places, 702/836 transitions.
[2025-06-04 15:09:12] [INFO ] Flatten gal took : 21 ms
[2025-06-04 15:09:12] [INFO ] Flatten gal took : 21 ms
[2025-06-04 15:09:12] [INFO ] Input system was already deterministic with 702 transitions.
[2025-06-04 15:09:12] [INFO ] Flatten gal took : 24 ms
[2025-06-04 15:09:12] [INFO ] Flatten gal took : 23 ms
[2025-06-04 15:09:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality2712796686071682011.gal : 7 ms
[2025-06-04 15:09:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality3073091995946244749.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2712796686071682011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3073091995946244749.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.59098e+07,5.28429,107820,2,12703,5,339851,6,0,3088,469118,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 15:09:43] [INFO ] Flatten gal took : 13 ms
[2025-06-04 15:09:43] [INFO ] Applying decomposition
[2025-06-04 15:09:43] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4262199992453853398.txt' '-o' '/tmp/graph4262199992453853398.bin' '-w' '/tmp/graph4262199992453853398.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4262199992453853398.bin' '-l' '-1' '-v' '-w' '/tmp/graph4262199992453853398.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:09:43] [INFO ] Decomposing Gal with order
[2025-06-04 15:09:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:09:43] [INFO ] Removed a total of 394 redundant transitions.
[2025-06-04 15:09:43] [INFO ] Flatten gal took : 35 ms
[2025-06-04 15:09:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 8 ms.
[2025-06-04 15:09:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality13518893864011072506.gal : 6 ms
[2025-06-04 15:09:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality4970153897933289850.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13518893864011072506.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4970153897933289850.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.59098e+07,1.48665,43792,1207,19,76565,479,977,175206,60,951,0


Converting to forward existential form...Done !
original formula: EG(AX(AG((i26.u99.p373==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(E(TRUE U !((i26.u99.p373==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t95, t207, t241, t324, t380, t413, t440, t496, t568, t569, t572, t575, t580, t583, t586, t587...491
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
(forward)formula 0,0,4.02746,98704,1,0,161516,479,7825,463280,284,951,621806
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 726/726 places, 836/836 transitions.
Graph (trivial) has 714 edges and 726 vertex of which 53 / 726 are part of one of the 9 SCC in 1 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 511 transitions
Trivial Post-agglo rules discarded 511 transitions
Performed 511 trivial Post agglomeration. Transition count delta: 511
Iterating post reduction 0 with 511 rules applied. Total rules applied 512 place count 681 transition count 274
Reduce places removed 511 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 519 rules applied. Total rules applied 1031 place count 170 transition count 266
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 1035 place count 167 transition count 265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1036 place count 166 transition count 265
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 1036 place count 166 transition count 230
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 1106 place count 131 transition count 230
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1117 place count 120 transition count 219
Iterating global reduction 4 with 11 rules applied. Total rules applied 1128 place count 120 transition count 219
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1128 place count 120 transition count 218
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1130 place count 119 transition count 218
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1132 place count 117 transition count 208
Iterating global reduction 4 with 2 rules applied. Total rules applied 1134 place count 117 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1135 place count 117 transition count 207
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 1171 place count 99 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1173 place count 99 transition count 187
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 1193 place count 79 transition count 140
Iterating global reduction 6 with 20 rules applied. Total rules applied 1213 place count 79 transition count 140
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1220 place count 79 transition count 133
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1231 place count 68 transition count 119
Iterating global reduction 7 with 11 rules applied. Total rules applied 1242 place count 68 transition count 119
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1253 place count 57 transition count 105
Iterating global reduction 7 with 11 rules applied. Total rules applied 1264 place count 57 transition count 105
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1269 place count 57 transition count 100
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 1271 place count 56 transition count 99
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1272 place count 55 transition count 96
Iterating global reduction 8 with 1 rules applied. Total rules applied 1273 place count 55 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1274 place count 55 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1277 place count 55 transition count 92
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 1283 place count 52 transition count 89
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1286 place count 52 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1287 place count 51 transition count 88
Applied a total of 1287 rules in 44 ms. Remains 51 /726 variables (removed 675) and now considering 88/836 (removed 748) transitions.
[2025-06-04 15:09:47] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
// Phase 1: matrix 84 rows 51 cols
[2025-06-04 15:09:47] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:09:47] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-04 15:09:47] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
[2025-06-04 15:09:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:09:47] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-04 15:09:47] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:09:47] [INFO ] Redundant transitions in 1 ms returned []
Running 81 sub problems to find dead transitions.
[2025-06-04 15:09:47] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
[2025-06-04 15:09:47] [INFO ] Invariant cache hit.
[2025-06-04 15:09:47] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 3/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:09:48] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:09:48] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:09:48] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:09:48] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:09:48] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:09:48] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:09:49] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:09:49] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 83/134 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 1/135 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/135 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 68 constraints, problems are : Problem set: 0 solved, 81 unsolved in 6040 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 3/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 83/134 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 81/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/135 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:09:57] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (OVERLAPS) 0/135 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 150 constraints, problems are : Problem set: 0 solved, 81 unsolved in 7892 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13943ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 13944ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/726 places, 88/836 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14199 ms. Remains : 51/726 places, 88/836 transitions.
[2025-06-04 15:10:01] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:10:01] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:10:01] [INFO ] Input system was already deterministic with 88 transitions.
[2025-06-04 15:10:01] [INFO ] Flatten gal took : 3 ms
[2025-06-04 15:10:01] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:10:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality16903155546581202415.gal : 1 ms
[2025-06-04 15:10:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality13831269610275555072.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16903155546581202415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13831269610275555072.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6438,0.074405,5164,2,677,5,5428,6,0,286,5139,0


Converting to forward existential form...Done !
original formula: EF(!(E((p157!=1) U EF((p823==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((p157!=1) U E(TRUE U (p823==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t7, t8, t9, t17, t31, t32, t33, t35, t43, t50, t63, t64, t65, t66, t67, t68, t69,...284
(forward)formula 0,0,0.425195,12332,1,0,177,46028,196,80,2005,35573,190
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 726/726 places, 836/836 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 706 transition count 816
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 706 transition count 816
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 693 transition count 803
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 693 transition count 803
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 684 transition count 794
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 684 transition count 794
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 93 place count 675 transition count 785
Iterating global reduction 0 with 9 rules applied. Total rules applied 102 place count 675 transition count 785
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 111 place count 666 transition count 776
Iterating global reduction 0 with 9 rules applied. Total rules applied 120 place count 666 transition count 776
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 121 place count 666 transition count 775
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 129 place count 658 transition count 767
Iterating global reduction 1 with 8 rules applied. Total rules applied 137 place count 658 transition count 767
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 144 place count 651 transition count 760
Iterating global reduction 1 with 7 rules applied. Total rules applied 151 place count 651 transition count 760
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 157 place count 645 transition count 754
Iterating global reduction 1 with 6 rules applied. Total rules applied 163 place count 645 transition count 754
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 168 place count 640 transition count 749
Iterating global reduction 1 with 5 rules applied. Total rules applied 173 place count 640 transition count 749
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 178 place count 635 transition count 744
Iterating global reduction 1 with 5 rules applied. Total rules applied 183 place count 635 transition count 744
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 187 place count 631 transition count 740
Iterating global reduction 1 with 4 rules applied. Total rules applied 191 place count 631 transition count 740
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 194 place count 628 transition count 737
Iterating global reduction 1 with 3 rules applied. Total rules applied 197 place count 628 transition count 737
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 200 place count 625 transition count 734
Iterating global reduction 1 with 3 rules applied. Total rules applied 203 place count 625 transition count 734
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 206 place count 622 transition count 731
Iterating global reduction 1 with 3 rules applied. Total rules applied 209 place count 622 transition count 731
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 212 place count 619 transition count 728
Iterating global reduction 1 with 3 rules applied. Total rules applied 215 place count 619 transition count 728
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 218 place count 616 transition count 725
Iterating global reduction 1 with 3 rules applied. Total rules applied 221 place count 616 transition count 725
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 224 place count 613 transition count 722
Iterating global reduction 1 with 3 rules applied. Total rules applied 227 place count 613 transition count 722
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 230 place count 610 transition count 719
Iterating global reduction 1 with 3 rules applied. Total rules applied 233 place count 610 transition count 719
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 236 place count 607 transition count 716
Iterating global reduction 1 with 3 rules applied. Total rules applied 239 place count 607 transition count 716
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 242 place count 604 transition count 713
Iterating global reduction 1 with 3 rules applied. Total rules applied 245 place count 604 transition count 713
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 248 place count 601 transition count 710
Iterating global reduction 1 with 3 rules applied. Total rules applied 251 place count 601 transition count 710
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 254 place count 598 transition count 707
Iterating global reduction 1 with 3 rules applied. Total rules applied 257 place count 598 transition count 707
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 260 place count 598 transition count 704
Applied a total of 260 rules in 638 ms. Remains 598 /726 variables (removed 128) and now considering 704/836 (removed 132) transitions.
// Phase 1: matrix 704 rows 598 cols
[2025-06-04 15:10:02] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:10:03] [INFO ] Implicit Places using invariants in 518 ms returned []
[2025-06-04 15:10:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:10:04] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 1566 ms to find 0 implicit places.
Running 703 sub problems to find dead transitions.
[2025-06-04 15:10:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (OVERLAPS) 1/598 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 703 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/1302 variables, and 4 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/598 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 703 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (OVERLAPS) 1/598 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 703 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:01] [INFO ] Deduced a trap composed of 290 places in 677 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:02] [INFO ] Deduced a trap composed of 290 places in 421 ms of which 39 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/1302 variables, and 6 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/598 constraints, PredecessorRefiner: 0/703 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 703 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Starting structural reductions in LTL mode, iteration 1 : 598/726 places, 704/836 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62375 ms. Remains : 598/726 places, 704/836 transitions.
[2025-06-04 15:11:04] [INFO ] Flatten gal took : 21 ms
[2025-06-04 15:11:04] [INFO ] Flatten gal took : 22 ms
[2025-06-04 15:11:04] [INFO ] Input system was already deterministic with 704 transitions.
[2025-06-04 15:11:04] [INFO ] Flatten gal took : 22 ms
[2025-06-04 15:11:04] [INFO ] Flatten gal took : 21 ms
[2025-06-04 15:11:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality8769624754064596490.gal : 4 ms
[2025-06-04 15:11:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality11880165576123211014.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8769624754064596490.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11880165576123211014.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.61678e+07,5.54448,103436,2,12743,5,330876,6,0,3098,443892,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 15:11:34] [INFO ] Flatten gal took : 14 ms
[2025-06-04 15:11:34] [INFO ] Applying decomposition
[2025-06-04 15:11:34] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7233596879853938042.txt' '-o' '/tmp/graph7233596879853938042.bin' '-w' '/tmp/graph7233596879853938042.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7233596879853938042.bin' '-l' '-1' '-v' '-w' '/tmp/graph7233596879853938042.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:11:34] [INFO ] Decomposing Gal with order
[2025-06-04 15:11:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:11:34] [INFO ] Removed a total of 376 redundant transitions.
[2025-06-04 15:11:34] [INFO ] Flatten gal took : 37 ms
[2025-06-04 15:11:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 10 ms.
[2025-06-04 15:11:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality17192460456884130390.gal : 8 ms
[2025-06-04 15:11:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality16676392432177667981.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17192460456884130390.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16676392432177667981.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.61678e+07,0.300951,10512,1013,26,11477,575,887,13374,79,1078,0


Converting to forward existential form...Done !
original formula: (AG(EX(EF(AG(((i10.i1.i2.u89.p348==0)&&(i24.i0.i1.u190.p727==1)))))) + EG((AG(((i11.i1.i1.u98.p369==0)&&((i0.u68.p269==0)||(i15.u101.p379...213
=> equivalent forward existential formula: [(FwdU((Init * !(EG((!(E(TRUE U !(((i11.i1.i1.u98.p369==0)&&((i0.u68.p269==0)||(i15.u101.p379==1)))))) + E(TRUE ...306
Reverse transition relation is NOT exact ! Due to transitions t151, t207, t241, t380, t382, t442, t498, t570, t571, t574, t577, t582, t585, t588, t589, t59...500
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
(forward)formula 0,1,13.2159,284688,1,0,556186,994,7619,872059,403,3068,1126285
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 726/726 places, 836/836 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 706 transition count 816
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 706 transition count 816
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 693 transition count 803
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 693 transition count 803
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 685 transition count 795
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 685 transition count 795
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 90 place count 677 transition count 787
Iterating global reduction 0 with 8 rules applied. Total rules applied 98 place count 677 transition count 787
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 106 place count 669 transition count 779
Iterating global reduction 0 with 8 rules applied. Total rules applied 114 place count 669 transition count 779
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 115 place count 669 transition count 778
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 122 place count 662 transition count 771
Iterating global reduction 1 with 7 rules applied. Total rules applied 129 place count 662 transition count 771
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 135 place count 656 transition count 765
Iterating global reduction 1 with 6 rules applied. Total rules applied 141 place count 656 transition count 765
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 146 place count 651 transition count 760
Iterating global reduction 1 with 5 rules applied. Total rules applied 151 place count 651 transition count 760
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 155 place count 647 transition count 756
Iterating global reduction 1 with 4 rules applied. Total rules applied 159 place count 647 transition count 756
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 163 place count 643 transition count 752
Iterating global reduction 1 with 4 rules applied. Total rules applied 167 place count 643 transition count 752
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 170 place count 640 transition count 749
Iterating global reduction 1 with 3 rules applied. Total rules applied 173 place count 640 transition count 749
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 175 place count 638 transition count 747
Iterating global reduction 1 with 2 rules applied. Total rules applied 177 place count 638 transition count 747
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 179 place count 636 transition count 745
Iterating global reduction 1 with 2 rules applied. Total rules applied 181 place count 636 transition count 745
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 183 place count 634 transition count 743
Iterating global reduction 1 with 2 rules applied. Total rules applied 185 place count 634 transition count 743
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 187 place count 632 transition count 741
Iterating global reduction 1 with 2 rules applied. Total rules applied 189 place count 632 transition count 741
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 191 place count 630 transition count 739
Iterating global reduction 1 with 2 rules applied. Total rules applied 193 place count 630 transition count 739
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 195 place count 628 transition count 737
Iterating global reduction 1 with 2 rules applied. Total rules applied 197 place count 628 transition count 737
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 199 place count 626 transition count 735
Iterating global reduction 1 with 2 rules applied. Total rules applied 201 place count 626 transition count 735
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 203 place count 624 transition count 733
Iterating global reduction 1 with 2 rules applied. Total rules applied 205 place count 624 transition count 733
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 207 place count 622 transition count 731
Iterating global reduction 1 with 2 rules applied. Total rules applied 209 place count 622 transition count 731
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 211 place count 620 transition count 729
Iterating global reduction 1 with 2 rules applied. Total rules applied 213 place count 620 transition count 729
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 215 place count 618 transition count 727
Iterating global reduction 1 with 2 rules applied. Total rules applied 217 place count 618 transition count 727
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 219 place count 618 transition count 725
Applied a total of 219 rules in 617 ms. Remains 618 /726 variables (removed 108) and now considering 725/836 (removed 111) transitions.
// Phase 1: matrix 725 rows 618 cols
[2025-06-04 15:11:48] [INFO ] Computed 4 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:11:49] [INFO ] Implicit Places using invariants in 345 ms returned []
[2025-06-04 15:11:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:11:50] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned []
Implicit Place search using SMT with State Equation took 1436 ms to find 0 implicit places.
Running 724 sub problems to find dead transitions.
[2025-06-04 15:11:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
SMT process timed out in 30141ms, After SMT, problems are : Problem set: 0 solved, 724 unsolved
Search for dead transitions found 0 dead transitions in 30147ms
Starting structural reductions in LTL mode, iteration 1 : 618/726 places, 725/836 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32203 ms. Remains : 618/726 places, 725/836 transitions.
[2025-06-04 15:12:20] [INFO ] Flatten gal took : 21 ms
[2025-06-04 15:12:20] [INFO ] Flatten gal took : 21 ms
[2025-06-04 15:12:20] [INFO ] Input system was already deterministic with 725 transitions.
[2025-06-04 15:12:20] [INFO ] Flatten gal took : 21 ms
[2025-06-04 15:12:20] [INFO ] Flatten gal took : 22 ms
[2025-06-04 15:12:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality3333655539397123418.gal : 4 ms
[2025-06-04 15:12:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality6193591056200929017.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3333655539397123418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6193591056200929017.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.1115e+07,6.21915,113964,2,12926,5,355022,6,0,3199,501127,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 15:12:50] [INFO ] Flatten gal took : 15 ms
[2025-06-04 15:12:50] [INFO ] Applying decomposition
[2025-06-04 15:12:50] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph927848986309674905.txt' '-o' '/tmp/graph927848986309674905.bin' '-w' '/tmp/graph927848986309674905.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph927848986309674905.bin' '-l' '-1' '-v' '-w' '/tmp/graph927848986309674905.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:12:50] [INFO ] Decomposing Gal with order
[2025-06-04 15:12:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:12:50] [INFO ] Removed a total of 391 redundant transitions.
[2025-06-04 15:12:50] [INFO ] Flatten gal took : 40 ms
[2025-06-04 15:12:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2025-06-04 15:12:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality238532230236021519.gal : 8 ms
[2025-06-04 15:12:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality7588162859436071595.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality238532230236021519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7588162859436071595.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.1115e+07,0.55854,17720,1098,18,25386,346,955,44920,57,607,0


Converting to forward existential form...Done !
original formula: AX((EF(((i26.u228.p871==0)&&(i11.u98.p362==1))) + EX((EX((i25.u210.p789==1)) * (i5.u52.p156==1)))))
=> equivalent forward existential formula: [((EY(Init) * !(EX((EX((i25.u210.p789==1)) * (i5.u52.p156==1))))) * !(E(TRUE U ((i26.u228.p871==0)&&(i11.u98.p36...173
Reverse transition relation is NOT exact ! Due to transitions t94, t111, t167, t223, t257, t396, t512, t568, t584, t585, t591, t594, t599, t602, t605, t606...501
(forward)formula 0,1,2.788,74040,1,0,123153,346,7491,302741,243,607,505814
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 726/726 places, 836/836 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 706 transition count 816
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 706 transition count 816
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 692 transition count 802
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 692 transition count 802
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 77 place count 683 transition count 793
Iterating global reduction 0 with 9 rules applied. Total rules applied 86 place count 683 transition count 793
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 95 place count 674 transition count 784
Iterating global reduction 0 with 9 rules applied. Total rules applied 104 place count 674 transition count 784
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 113 place count 665 transition count 775
Iterating global reduction 0 with 9 rules applied. Total rules applied 122 place count 665 transition count 775
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 123 place count 665 transition count 774
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 131 place count 657 transition count 766
Iterating global reduction 1 with 8 rules applied. Total rules applied 139 place count 657 transition count 766
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 146 place count 650 transition count 759
Iterating global reduction 1 with 7 rules applied. Total rules applied 153 place count 650 transition count 759
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 159 place count 644 transition count 753
Iterating global reduction 1 with 6 rules applied. Total rules applied 165 place count 644 transition count 753
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 170 place count 639 transition count 748
Iterating global reduction 1 with 5 rules applied. Total rules applied 175 place count 639 transition count 748
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 180 place count 634 transition count 743
Iterating global reduction 1 with 5 rules applied. Total rules applied 185 place count 634 transition count 743
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 189 place count 630 transition count 739
Iterating global reduction 1 with 4 rules applied. Total rules applied 193 place count 630 transition count 739
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 196 place count 627 transition count 736
Iterating global reduction 1 with 3 rules applied. Total rules applied 199 place count 627 transition count 736
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 202 place count 624 transition count 733
Iterating global reduction 1 with 3 rules applied. Total rules applied 205 place count 624 transition count 733
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 208 place count 621 transition count 730
Iterating global reduction 1 with 3 rules applied. Total rules applied 211 place count 621 transition count 730
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 214 place count 618 transition count 727
Iterating global reduction 1 with 3 rules applied. Total rules applied 217 place count 618 transition count 727
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 220 place count 615 transition count 724
Iterating global reduction 1 with 3 rules applied. Total rules applied 223 place count 615 transition count 724
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 226 place count 612 transition count 721
Iterating global reduction 1 with 3 rules applied. Total rules applied 229 place count 612 transition count 721
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 232 place count 609 transition count 718
Iterating global reduction 1 with 3 rules applied. Total rules applied 235 place count 609 transition count 718
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 238 place count 606 transition count 715
Iterating global reduction 1 with 3 rules applied. Total rules applied 241 place count 606 transition count 715
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 244 place count 603 transition count 712
Iterating global reduction 1 with 3 rules applied. Total rules applied 247 place count 603 transition count 712
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 250 place count 600 transition count 709
Iterating global reduction 1 with 3 rules applied. Total rules applied 253 place count 600 transition count 709
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 256 place count 597 transition count 706
Iterating global reduction 1 with 3 rules applied. Total rules applied 259 place count 597 transition count 706
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 262 place count 597 transition count 703
Applied a total of 262 rules in 370 ms. Remains 597 /726 variables (removed 129) and now considering 703/836 (removed 133) transitions.
// Phase 1: matrix 703 rows 597 cols
[2025-06-04 15:12:53] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:12:54] [INFO ] Implicit Places using invariants in 477 ms returned []
[2025-06-04 15:12:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:12:55] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1479 ms to find 0 implicit places.
Running 702 sub problems to find dead transitions.
[2025-06-04 15:12:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 702 unsolved
SMT process timed out in 30140ms, After SMT, problems are : Problem set: 0 solved, 702 unsolved
Search for dead transitions found 0 dead transitions in 30144ms
Starting structural reductions in LTL mode, iteration 1 : 597/726 places, 703/836 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31998 ms. Remains : 597/726 places, 703/836 transitions.
[2025-06-04 15:13:25] [INFO ] Flatten gal took : 24 ms
[2025-06-04 15:13:25] [INFO ] Flatten gal took : 22 ms
[2025-06-04 15:13:25] [INFO ] Input system was already deterministic with 703 transitions.
[2025-06-04 15:13:25] [INFO ] Flatten gal took : 20 ms
[2025-06-04 15:13:25] [INFO ] Flatten gal took : 21 ms
[2025-06-04 15:13:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality9019293147019459813.gal : 5 ms
[2025-06-04 15:13:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality17612394067754462426.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9019293147019459813.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17612394067754462426.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.60671e+07,5.74221,110656,2,12837,5,350189,6,0,3093,482310,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 15:13:55] [INFO ] Flatten gal took : 12 ms
[2025-06-04 15:13:55] [INFO ] Applying decomposition
[2025-06-04 15:13:55] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3411715199814732746.txt' '-o' '/tmp/graph3411715199814732746.bin' '-w' '/tmp/graph3411715199814732746.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3411715199814732746.bin' '-l' '-1' '-v' '-w' '/tmp/graph3411715199814732746.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:13:55] [INFO ] Decomposing Gal with order
[2025-06-04 15:13:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:13:55] [INFO ] Removed a total of 385 redundant transitions.
[2025-06-04 15:13:55] [INFO ] Flatten gal took : 30 ms
[2025-06-04 15:13:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2025-06-04 15:13:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality6358694704415269971.gal : 6 ms
[2025-06-04 15:13:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality8226046016829602944.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6358694704415269971.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8226046016829602944.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.60671e+07,0.749933,22320,1114,20,35132,449,907,65439,66,927,0


Converting to forward existential form...Done !
original formula: ((EX((i23.i1.i0.u196.p730==1)) + EX((i10.u104.p376==1))) + EF(EG(((i27.u229.p911==0)&&(i5.u56.p184==1)))))
=> equivalent forward existential formula: (([(EY(Init) * (i23.i1.i0.u196.p730==1))] != FALSE + [(EY(Init) * (i10.u104.p376==1))] != FALSE) + [FwdG(FwdU(In...214
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
(forward)formula 0,1,1.85167,50992,1,0,83274,449,4808,248235,227,1299,202935
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 726/726 places, 836/836 transitions.
Graph (trivial) has 715 edges and 726 vertex of which 53 / 726 are part of one of the 9 SCC in 2 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 512 transitions
Trivial Post-agglo rules discarded 512 transitions
Performed 512 trivial Post agglomeration. Transition count delta: 512
Iterating post reduction 0 with 512 rules applied. Total rules applied 513 place count 681 transition count 273
Reduce places removed 512 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 520 rules applied. Total rules applied 1033 place count 169 transition count 265
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 1037 place count 166 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1038 place count 165 transition count 264
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 1038 place count 165 transition count 231
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 1104 place count 132 transition count 231
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1116 place count 120 transition count 219
Iterating global reduction 4 with 12 rules applied. Total rules applied 1128 place count 120 transition count 219
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1128 place count 120 transition count 218
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1130 place count 119 transition count 218
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1132 place count 117 transition count 208
Iterating global reduction 4 with 2 rules applied. Total rules applied 1134 place count 117 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1135 place count 117 transition count 207
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 1171 place count 99 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1173 place count 99 transition count 187
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 1194 place count 78 transition count 139
Iterating global reduction 6 with 21 rules applied. Total rules applied 1215 place count 78 transition count 139
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1223 place count 78 transition count 131
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1233 place count 68 transition count 118
Iterating global reduction 7 with 10 rules applied. Total rules applied 1243 place count 68 transition count 118
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1253 place count 58 transition count 105
Iterating global reduction 7 with 10 rules applied. Total rules applied 1263 place count 58 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1267 place count 58 transition count 101
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 1269 place count 57 transition count 100
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1270 place count 56 transition count 97
Iterating global reduction 8 with 1 rules applied. Total rules applied 1271 place count 56 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1272 place count 56 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1275 place count 56 transition count 93
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 1281 place count 53 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1282 place count 52 transition count 89
Applied a total of 1282 rules in 38 ms. Remains 52 /726 variables (removed 674) and now considering 89/836 (removed 747) transitions.
[2025-06-04 15:13:57] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
// Phase 1: matrix 85 rows 52 cols
[2025-06-04 15:13:57] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:13:57] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-04 15:13:57] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2025-06-04 15:13:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:13:57] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-04 15:13:57] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:13:57] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-04 15:13:57] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2025-06-04 15:13:57] [INFO ] Invariant cache hit.
[2025-06-04 15:13:57] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 3/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:13:58] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:13:58] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:13:58] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:13:58] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:13:58] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:13:58] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:13:58] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:13:59] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:13:59] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 84/136 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:14:00] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 1/137 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/137 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 71 constraints, problems are : Problem set: 0 solved, 80 unsolved in 5915 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 3/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 84/136 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 80/150 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:14:05] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/137 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/137 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 152 constraints, problems are : Problem set: 0 solved, 80 unsolved in 6140 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12065ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 12067ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/726 places, 89/836 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12268 ms. Remains : 52/726 places, 89/836 transitions.
[2025-06-04 15:14:10] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:14:10] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:14:10] [INFO ] Input system was already deterministic with 89 transitions.
[2025-06-04 15:14:10] [INFO ] Flatten gal took : 3 ms
[2025-06-04 15:14:10] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:14:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality5107445357542964438.gal : 1 ms
[2025-06-04 15:14:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality17828701057834811456.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5107445357542964438.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17828701057834811456.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6230,0.078034,5324,2,768,5,5156,6,0,291,5505,0


Converting to forward existential form...Done !
original formula: EG(((p562==0)||(p287==1)))
=> equivalent forward existential formula: [FwdG(Init,((p562==0)||(p287==1)))] != FALSE
Hit Full ! (commute/partial/dont) 85/0/4
(forward)formula 0,1,0.426807,12236,1,0,26,33664,19,4,1572,38962,25
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 726/726 places, 836/836 transitions.
Graph (trivial) has 686 edges and 726 vertex of which 53 / 726 are part of one of the 9 SCC in 2 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 480 transitions
Trivial Post-agglo rules discarded 480 transitions
Performed 480 trivial Post agglomeration. Transition count delta: 480
Iterating post reduction 0 with 480 rules applied. Total rules applied 481 place count 681 transition count 305
Reduce places removed 480 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 488 rules applied. Total rules applied 969 place count 201 transition count 297
Reduce places removed 3 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 2 with 17 rules applied. Total rules applied 986 place count 198 transition count 283
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 1000 place count 184 transition count 283
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 1000 place count 184 transition count 246
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 1074 place count 147 transition count 246
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1086 place count 135 transition count 234
Iterating global reduction 4 with 12 rules applied. Total rules applied 1098 place count 135 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1098 place count 135 transition count 233
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1100 place count 134 transition count 233
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1102 place count 132 transition count 223
Iterating global reduction 4 with 2 rules applied. Total rules applied 1104 place count 132 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1105 place count 132 transition count 222
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 1139 place count 115 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1141 place count 115 transition count 203
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 1161 place count 95 transition count 156
Iterating global reduction 6 with 20 rules applied. Total rules applied 1181 place count 95 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1185 place count 95 transition count 152
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1195 place count 85 transition count 140
Iterating global reduction 7 with 10 rules applied. Total rules applied 1205 place count 85 transition count 140
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1215 place count 75 transition count 128
Iterating global reduction 7 with 10 rules applied. Total rules applied 1225 place count 75 transition count 128
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1230 place count 75 transition count 123
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 1232 place count 74 transition count 122
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1233 place count 73 transition count 118
Iterating global reduction 8 with 1 rules applied. Total rules applied 1234 place count 73 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1235 place count 73 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1239 place count 73 transition count 113
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 1245 place count 70 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1246 place count 69 transition count 109
Applied a total of 1246 rules in 55 ms. Remains 69 /726 variables (removed 657) and now considering 109/836 (removed 727) transitions.
[2025-06-04 15:14:10] [INFO ] Flow matrix only has 106 transitions (discarded 3 similar events)
// Phase 1: matrix 106 rows 69 cols
[2025-06-04 15:14:10] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:14:10] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-04 15:14:10] [INFO ] Flow matrix only has 106 transitions (discarded 3 similar events)
[2025-06-04 15:14:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:14:10] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-04 15:14:10] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:14:10] [INFO ] Redundant transitions in 9 ms returned []
Running 101 sub problems to find dead transitions.
[2025-06-04 15:14:10] [INFO ] Flow matrix only has 106 transitions (discarded 3 similar events)
[2025-06-04 15:14:10] [INFO ] Invariant cache hit.
[2025-06-04 15:14:10] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 3/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:14:12] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:14:12] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:14:12] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:14:12] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:14:12] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:14:12] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:14:12] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:14:13] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:14:13] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 105/174 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 1/175 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/175 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 87 constraints, problems are : Problem set: 0 solved, 101 unsolved in 8465 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 3/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 105/174 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 101/187 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 1/175 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/175 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 188 constraints, problems are : Problem set: 0 solved, 101 unsolved in 10496 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18980ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 18980ms
Starting structural reductions in SI_CTL mode, iteration 1 : 69/726 places, 109/836 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19292 ms. Remains : 69/726 places, 109/836 transitions.
[2025-06-04 15:14:29] [INFO ] Flatten gal took : 5 ms
[2025-06-04 15:14:29] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:14:29] [INFO ] Input system was already deterministic with 109 transitions.
[2025-06-04 15:14:29] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:14:29] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:14:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality3956541720420003620.gal : 1 ms
[2025-06-04 15:14:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality8647579814743783211.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3956541720420003620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8647579814743783211.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,17094,0.101439,5916,2,944,5,7685,6,0,379,8487,0


Converting to forward existential form...Done !
original formula: EG(((EF((((p101==0)||(p31==1))&&(p576==0))) + A(!(AF(!(((p402==0)||(p68==1))))) U ((p736==0)||(p555==1)))) + (AG(!(E((p647==0) U ((p624==...195
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U (((p101==0)||(p31==1))&&(p576==0))) + !((E(!(((p736==0)||(p555==1))) U (!(!(!(EG(!(!(((p40...353
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t10, t11, t12, t17, t18, t19, t56, t59, t61, t72, t85, t86, t87, t88, t89, t90, t...286
(forward)formula 0,1,4.54251,104776,1,0,573,660097,255,268,2731,471285,696
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 726/726 places, 836/836 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 705 transition count 815
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 705 transition count 815
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 56 place count 691 transition count 801
Iterating global reduction 0 with 14 rules applied. Total rules applied 70 place count 691 transition count 801
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 79 place count 682 transition count 792
Iterating global reduction 0 with 9 rules applied. Total rules applied 88 place count 682 transition count 792
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 97 place count 673 transition count 783
Iterating global reduction 0 with 9 rules applied. Total rules applied 106 place count 673 transition count 783
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 115 place count 664 transition count 774
Iterating global reduction 0 with 9 rules applied. Total rules applied 124 place count 664 transition count 774
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 125 place count 664 transition count 773
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 133 place count 656 transition count 765
Iterating global reduction 1 with 8 rules applied. Total rules applied 141 place count 656 transition count 765
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 148 place count 649 transition count 758
Iterating global reduction 1 with 7 rules applied. Total rules applied 155 place count 649 transition count 758
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 160 place count 644 transition count 753
Iterating global reduction 1 with 5 rules applied. Total rules applied 165 place count 644 transition count 753
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 169 place count 640 transition count 749
Iterating global reduction 1 with 4 rules applied. Total rules applied 173 place count 640 transition count 749
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 177 place count 636 transition count 745
Iterating global reduction 1 with 4 rules applied. Total rules applied 181 place count 636 transition count 745
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 184 place count 633 transition count 742
Iterating global reduction 1 with 3 rules applied. Total rules applied 187 place count 633 transition count 742
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 190 place count 630 transition count 739
Iterating global reduction 1 with 3 rules applied. Total rules applied 193 place count 630 transition count 739
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 196 place count 627 transition count 736
Iterating global reduction 1 with 3 rules applied. Total rules applied 199 place count 627 transition count 736
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 202 place count 624 transition count 733
Iterating global reduction 1 with 3 rules applied. Total rules applied 205 place count 624 transition count 733
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 208 place count 621 transition count 730
Iterating global reduction 1 with 3 rules applied. Total rules applied 211 place count 621 transition count 730
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 214 place count 618 transition count 727
Iterating global reduction 1 with 3 rules applied. Total rules applied 217 place count 618 transition count 727
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 220 place count 615 transition count 724
Iterating global reduction 1 with 3 rules applied. Total rules applied 223 place count 615 transition count 724
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 226 place count 612 transition count 721
Iterating global reduction 1 with 3 rules applied. Total rules applied 229 place count 612 transition count 721
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 232 place count 609 transition count 718
Iterating global reduction 1 with 3 rules applied. Total rules applied 235 place count 609 transition count 718
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 238 place count 606 transition count 715
Iterating global reduction 1 with 3 rules applied. Total rules applied 241 place count 606 transition count 715
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 244 place count 603 transition count 712
Iterating global reduction 1 with 3 rules applied. Total rules applied 247 place count 603 transition count 712
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 250 place count 600 transition count 709
Iterating global reduction 1 with 3 rules applied. Total rules applied 253 place count 600 transition count 709
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 256 place count 600 transition count 706
Applied a total of 256 rules in 514 ms. Remains 600 /726 variables (removed 126) and now considering 706/836 (removed 130) transitions.
// Phase 1: matrix 706 rows 600 cols
[2025-06-04 15:14:34] [INFO ] Computed 4 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:14:35] [INFO ] Implicit Places using invariants in 374 ms returned []
[2025-06-04 15:14:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:14:36] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
Running 705 sub problems to find dead transitions.
[2025-06-04 15:14:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 705 unsolved
SMT process timed out in 30127ms, After SMT, problems are : Problem set: 0 solved, 705 unsolved
Search for dead transitions found 0 dead transitions in 30129ms
Starting structural reductions in LTL mode, iteration 1 : 600/726 places, 706/836 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31958 ms. Remains : 600/726 places, 706/836 transitions.
[2025-06-04 15:15:06] [INFO ] Flatten gal took : 21 ms
[2025-06-04 15:15:06] [INFO ] Flatten gal took : 21 ms
[2025-06-04 15:15:06] [INFO ] Input system was already deterministic with 706 transitions.
[2025-06-04 15:15:06] [INFO ] Flatten gal took : 21 ms
[2025-06-04 15:15:06] [INFO ] Flatten gal took : 22 ms
[2025-06-04 15:15:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality12167916100935849808.gal : 4 ms
[2025-06-04 15:15:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality5549566096177276330.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12167916100935849808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5549566096177276330.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.68562e+07,5.92869,113656,2,12691,5,351611,6,0,3108,506807,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 15:15:36] [INFO ] Flatten gal took : 13 ms
[2025-06-04 15:15:36] [INFO ] Applying decomposition
[2025-06-04 15:15:36] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12284935379550109499.txt' '-o' '/tmp/graph12284935379550109499.bin' '-w' '/tmp/graph12284935379550109499.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12284935379550109499.bin' '-l' '-1' '-v' '-w' '/tmp/graph12284935379550109499.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:15:36] [INFO ] Decomposing Gal with order
[2025-06-04 15:15:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:15:36] [INFO ] Removed a total of 380 redundant transitions.
[2025-06-04 15:15:36] [INFO ] Flatten gal took : 35 ms
[2025-06-04 15:15:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2025-06-04 15:15:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality7259464521364732345.gal : 6 ms
[2025-06-04 15:15:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality3240740282562129143.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7259464521364732345.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3240740282562129143.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.68562e+07,0.452206,14364,1013,20,19726,421,971,28628,69,877,0


Converting to forward existential form...Done !
original formula: AF((AX(EX(((i11.u92.p357==0)&&(i5.u53.p179==1)))) * (i7.u74.p291==0)))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(EX(((i11.u92.p357==0)&&(i5.u53.p179==1)))))) * (i7.u74.p291==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t68, t95, t207, t380, t413, t442, t554, t570, t571, t574, t577, t582, t585, t586, t590, t593,...484
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
(forward)formula 0,0,19.275,430620,1,0,742296,422,6595,2.22375e+06,301,2121,1656902
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 726/726 places, 836/836 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 706 transition count 816
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 706 transition count 816
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 693 transition count 803
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 693 transition count 803
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 684 transition count 794
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 684 transition count 794
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 93 place count 675 transition count 785
Iterating global reduction 0 with 9 rules applied. Total rules applied 102 place count 675 transition count 785
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 111 place count 666 transition count 776
Iterating global reduction 0 with 9 rules applied. Total rules applied 120 place count 666 transition count 776
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 121 place count 666 transition count 775
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 129 place count 658 transition count 767
Iterating global reduction 1 with 8 rules applied. Total rules applied 137 place count 658 transition count 767
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 144 place count 651 transition count 760
Iterating global reduction 1 with 7 rules applied. Total rules applied 151 place count 651 transition count 760
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 157 place count 645 transition count 754
Iterating global reduction 1 with 6 rules applied. Total rules applied 163 place count 645 transition count 754
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 168 place count 640 transition count 749
Iterating global reduction 1 with 5 rules applied. Total rules applied 173 place count 640 transition count 749
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 178 place count 635 transition count 744
Iterating global reduction 1 with 5 rules applied. Total rules applied 183 place count 635 transition count 744
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 187 place count 631 transition count 740
Iterating global reduction 1 with 4 rules applied. Total rules applied 191 place count 631 transition count 740
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 194 place count 628 transition count 737
Iterating global reduction 1 with 3 rules applied. Total rules applied 197 place count 628 transition count 737
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 200 place count 625 transition count 734
Iterating global reduction 1 with 3 rules applied. Total rules applied 203 place count 625 transition count 734
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 206 place count 622 transition count 731
Iterating global reduction 1 with 3 rules applied. Total rules applied 209 place count 622 transition count 731
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 212 place count 619 transition count 728
Iterating global reduction 1 with 3 rules applied. Total rules applied 215 place count 619 transition count 728
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 218 place count 616 transition count 725
Iterating global reduction 1 with 3 rules applied. Total rules applied 221 place count 616 transition count 725
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 224 place count 613 transition count 722
Iterating global reduction 1 with 3 rules applied. Total rules applied 227 place count 613 transition count 722
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 230 place count 610 transition count 719
Iterating global reduction 1 with 3 rules applied. Total rules applied 233 place count 610 transition count 719
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 236 place count 607 transition count 716
Iterating global reduction 1 with 3 rules applied. Total rules applied 239 place count 607 transition count 716
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 242 place count 604 transition count 713
Iterating global reduction 1 with 3 rules applied. Total rules applied 245 place count 604 transition count 713
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 248 place count 601 transition count 710
Iterating global reduction 1 with 3 rules applied. Total rules applied 251 place count 601 transition count 710
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 254 place count 598 transition count 707
Iterating global reduction 1 with 3 rules applied. Total rules applied 257 place count 598 transition count 707
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 260 place count 598 transition count 704
Applied a total of 260 rules in 422 ms. Remains 598 /726 variables (removed 128) and now considering 704/836 (removed 132) transitions.
// Phase 1: matrix 704 rows 598 cols
[2025-06-04 15:15:56] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:15:57] [INFO ] Implicit Places using invariants in 498 ms returned []
[2025-06-04 15:15:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:15:58] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
Running 703 sub problems to find dead transitions.
[2025-06-04 15:15:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
SMT process timed out in 30128ms, After SMT, problems are : Problem set: 0 solved, 703 unsolved
Search for dead transitions found 0 dead transitions in 30130ms
Starting structural reductions in LTL mode, iteration 1 : 598/726 places, 704/836 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32013 ms. Remains : 598/726 places, 704/836 transitions.
[2025-06-04 15:16:28] [INFO ] Flatten gal took : 17 ms
[2025-06-04 15:16:28] [INFO ] Flatten gal took : 20 ms
[2025-06-04 15:16:28] [INFO ] Input system was already deterministic with 704 transitions.
[2025-06-04 15:16:28] [INFO ] Flatten gal took : 21 ms
[2025-06-04 15:16:28] [INFO ] Flatten gal took : 21 ms
[2025-06-04 15:16:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality8493608892986151199.gal : 4 ms
[2025-06-04 15:16:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality2905773618175747452.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8493608892986151199.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2905773618175747452.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.62364e+07,5.73763,108268,2,12627,5,339490,6,0,3098,465442,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 15:16:58] [INFO ] Flatten gal took : 13 ms
[2025-06-04 15:16:58] [INFO ] Applying decomposition
[2025-06-04 15:16:58] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph832956574013454687.txt' '-o' '/tmp/graph832956574013454687.bin' '-w' '/tmp/graph832956574013454687.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph832956574013454687.bin' '-l' '-1' '-v' '-w' '/tmp/graph832956574013454687.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:16:58] [INFO ] Decomposing Gal with order
[2025-06-04 15:16:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:16:58] [INFO ] Removed a total of 369 redundant transitions.
[2025-06-04 15:16:58] [INFO ] Flatten gal took : 29 ms
[2025-06-04 15:16:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2025-06-04 15:16:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality11755088336438874330.gal : 6 ms
[2025-06-04 15:16:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality14493921305772416348.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11755088336438874330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14493921305772416348.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.62364e+07,0.505788,14708,931,20,20500,553,961,29610,75,1229,0


Converting to forward existential form...Done !
original formula: (EF(AX(E((i1.i0.i1.u8.p32==1) U (i11.u102.p371==1)))) * AF((i15.u106.p389==0)))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(EX(!(E((i1.i0.i1.u8.p32==1) U (i11.u102.p371==1))))))))] = FALSE * [FwdG(Init,!((i15.u106...176
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Reverse transition relation is NOT exact ! Due to transitions t68, t95, t207, t241, t268, t324, t442, t554, t570, t571, t574, t577, t582, t585, t588, t589,...489
(forward)formula 0,1,2.28364,60020,1,0,108960,553,7789,195722,355,1229,440612
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 726/726 places, 836/836 transitions.
Graph (trivial) has 710 edges and 726 vertex of which 53 / 726 are part of one of the 9 SCC in 1 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 508 transitions
Trivial Post-agglo rules discarded 508 transitions
Performed 508 trivial Post agglomeration. Transition count delta: 508
Iterating post reduction 0 with 508 rules applied. Total rules applied 509 place count 681 transition count 277
Reduce places removed 508 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 516 rules applied. Total rules applied 1025 place count 173 transition count 269
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 1030 place count 170 transition count 267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1032 place count 168 transition count 267
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 1032 place count 168 transition count 235
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 1096 place count 136 transition count 235
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1108 place count 124 transition count 223
Iterating global reduction 4 with 12 rules applied. Total rules applied 1120 place count 124 transition count 223
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1120 place count 124 transition count 222
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1122 place count 123 transition count 222
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1124 place count 121 transition count 212
Iterating global reduction 4 with 2 rules applied. Total rules applied 1126 place count 121 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1127 place count 121 transition count 211
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 1163 place count 103 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1165 place count 103 transition count 191
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 1186 place count 82 transition count 143
Iterating global reduction 6 with 21 rules applied. Total rules applied 1207 place count 82 transition count 143
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1215 place count 82 transition count 135
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1227 place count 70 transition count 120
Iterating global reduction 7 with 12 rules applied. Total rules applied 1239 place count 70 transition count 120
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1249 place count 60 transition count 107
Iterating global reduction 7 with 10 rules applied. Total rules applied 1259 place count 60 transition count 107
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1264 place count 60 transition count 102
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 1266 place count 59 transition count 101
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1267 place count 58 transition count 98
Iterating global reduction 8 with 1 rules applied. Total rules applied 1268 place count 58 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1269 place count 58 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1272 place count 58 transition count 94
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 1278 place count 55 transition count 91
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1279 place count 54 transition count 90
Applied a total of 1279 rules in 51 ms. Remains 54 /726 variables (removed 672) and now considering 90/836 (removed 746) transitions.
[2025-06-04 15:17:00] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
// Phase 1: matrix 86 rows 54 cols
[2025-06-04 15:17:00] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:17:00] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-04 15:17:00] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2025-06-04 15:17:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:17:01] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-04 15:17:01] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:17:01] [INFO ] Redundant transitions in 3 ms returned []
Running 83 sub problems to find dead transitions.
[2025-06-04 15:17:01] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2025-06-04 15:17:01] [INFO ] Invariant cache hit.
[2025-06-04 15:17:01] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 3/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:17:01] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:17:01] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:17:01] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:17:02] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:17:02] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:17:02] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:17:02] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 85/139 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 1/140 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:17:05] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 8 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/140 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 12 (OVERLAPS) 0/140 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 71 constraints, problems are : Problem set: 0 solved, 83 unsolved in 6446 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 3/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 85/139 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 83/153 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:17:09] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 1/140 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:17:12] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:17:14] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 4 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/140 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:17:16] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 5 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/140 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/140 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 17 (OVERLAPS) 0/140 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 158 constraints, problems are : Problem set: 0 solved, 83 unsolved in 14431 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20892ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 20893ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/726 places, 90/836 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21140 ms. Remains : 54/726 places, 90/836 transitions.
[2025-06-04 15:17:21] [INFO ] Flatten gal took : 5 ms
[2025-06-04 15:17:21] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:17:21] [INFO ] Input system was already deterministic with 90 transitions.
[2025-06-04 15:17:22] [INFO ] Flatten gal took : 3 ms
[2025-06-04 15:17:22] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:17:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality17903138129325438372.gal : 1 ms
[2025-06-04 15:17:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality7888292298922158017.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17903138129325438372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7888292298922158017.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7752,0.048669,5316,2,864,5,5493,6,0,300,5391,0


Converting to forward existential form...Done !
original formula: EG(E(((p834==0)||(p348==1)) U ((p410==0)||(p802==1))))
=> equivalent forward existential formula: [FwdG(Init,E(((p834==0)||(p348==1)) U ((p410==0)||(p802==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t6, t9, t10, t11, t19, t20, t21, t26, t27, t39, t40, t49, t56, t57, t70, t71, t72, t73, t...282
(forward)formula 0,1,0.620945,18732,1,0,247,65653,201,123,2080,83832,249
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-04 15:17:22] [INFO ] Flatten gal took : 35 ms
[2025-06-04 15:17:22] [INFO ] Flatten gal took : 23 ms
[2025-06-04 15:17:22] [INFO ] Applying decomposition
[2025-06-04 15:17:22] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5428962960016108811.txt' '-o' '/tmp/graph5428962960016108811.bin' '-w' '/tmp/graph5428962960016108811.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5428962960016108811.bin' '-l' '-1' '-v' '-w' '/tmp/graph5428962960016108811.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:17:22] [INFO ] Decomposing Gal with order
[2025-06-04 15:17:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:17:22] [INFO ] Removed a total of 397 redundant transitions.
[2025-06-04 15:17:22] [INFO ] Flatten gal took : 53 ms
[2025-06-04 15:17:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 8 ms.
[2025-06-04 15:17:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality9487508022612558284.gal : 11 ms
[2025-06-04 15:17:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality6855304176325475884.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9487508022612558284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6855304176325475884.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.01869e+08,0.920797,19760,1380,29,30195,564,1132,55759,70,1206,0


Converting to forward existential form...Done !
original formula: (EG((EF((!(E(((i0.u2.p7==0)||(i14.i1.i1.u117.p370==1)) U (i4.u32.p86==1))) + AF((i2.u1.p256==0)))) * ((i27.i0.i1.u192.p628==0)||(i17.i1.i...392
=> equivalent forward existential formula: [(EY(FwdU((Init * EG((E(TRUE U (!(E(((i0.u2.p7==0)||(i14.i1.i1.u117.p370==1)) U (i4.u32.p86==1))) + !(EG(!((i2.u...456
Reverse transition relation is NOT exact ! Due to transitions t8, t73, t110, t133, t159, t191, t247, t287, t451, t452, t454, t487, t592, t594, t654, t670, ...565
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
(forward)formula 0,1,41.9544,811472,1,0,1.30624e+06,681,9577,4.33786e+06,336,2508,2442772
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EG(A(((!(EG((i20.u122.p391==0))) + AG(AX(((i26.u245.p787==0)||(i31.u276.p906==1))))) + (((i7.u78.p234==1)&&((i10.u88.p287==0)||(i5.i0.i1....302
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(!(EX(!((((i8.u63.p176==1)||(i0.u8.p22==0)) * EG((i4.u30.p74==0)))))))) U (!(((!(EG((i20.u122...540
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
(forward)formula 1,0,71.447,1228368,1,0,1.88166e+06,681,9743,5.35545e+06,336,2524,3512622
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Total runtime 970201 ms.

BK_STOP 1749050314839

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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="StigmergyCommit-PT-02b"
export BK_EXAMINATION="CTLCardinality"
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-5832"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-02b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r226-smll-174903490500009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-02b.tgz
mv StigmergyCommit-PT-02b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;