Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690531600114.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is StigmergyCommit-PT-03b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531600114
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 17:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 11 17:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 359K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716984842082

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 12:14:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 12:14:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:14:03] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-05-29 12:14:03] [INFO ] Transformed 1231 places.
[2024-05-29 12:14:03] [INFO ] Transformed 1476 transitions.
[2024-05-29 12:14:03] [INFO ] Found NUPN structural information;
[2024-05-29 12:14:03] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 234 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 128 out of 1231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 88 place count 1143 transition count 1388
Iterating global reduction 0 with 88 rules applied. Total rules applied 176 place count 1143 transition count 1388
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 228 place count 1091 transition count 1336
Iterating global reduction 0 with 52 rules applied. Total rules applied 280 place count 1091 transition count 1336
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 309 place count 1062 transition count 1307
Iterating global reduction 0 with 29 rules applied. Total rules applied 338 place count 1062 transition count 1307
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 363 place count 1037 transition count 1282
Iterating global reduction 0 with 25 rules applied. Total rules applied 388 place count 1037 transition count 1282
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 408 place count 1017 transition count 1262
Iterating global reduction 0 with 20 rules applied. Total rules applied 428 place count 1017 transition count 1262
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 446 place count 999 transition count 1244
Iterating global reduction 0 with 18 rules applied. Total rules applied 464 place count 999 transition count 1244
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 479 place count 984 transition count 1229
Iterating global reduction 0 with 15 rules applied. Total rules applied 494 place count 984 transition count 1229
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 508 place count 970 transition count 1215
Iterating global reduction 0 with 14 rules applied. Total rules applied 522 place count 970 transition count 1215
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 532 place count 960 transition count 1205
Iterating global reduction 0 with 10 rules applied. Total rules applied 542 place count 960 transition count 1205
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 548 place count 954 transition count 1199
Iterating global reduction 0 with 6 rules applied. Total rules applied 554 place count 954 transition count 1199
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 556 place count 952 transition count 1197
Iterating global reduction 0 with 2 rules applied. Total rules applied 558 place count 952 transition count 1197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 559 place count 951 transition count 1196
Iterating global reduction 0 with 1 rules applied. Total rules applied 560 place count 951 transition count 1196
Applied a total of 560 rules in 822 ms. Remains 951 /1231 variables (removed 280) and now considering 1196/1476 (removed 280) transitions.
// Phase 1: matrix 1196 rows 951 cols
[2024-05-29 12:14:04] [INFO ] Computed 5 invariants in 29 ms
[2024-05-29 12:14:05] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-05-29 12:14:05] [INFO ] Invariant cache hit.
[2024-05-29 12:14:05] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 1213 ms to find 0 implicit places.
Running 1195 sub problems to find dead transitions.
[2024-05-29 12:14:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/950 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1195 unsolved
SMT process timed out in 30651ms, After SMT, problems are : Problem set: 0 solved, 1195 unsolved
Search for dead transitions found 0 dead transitions in 30681ms
Starting structural reductions in LTL mode, iteration 1 : 951/1231 places, 1196/1476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32751 ms. Remains : 951/1231 places, 1196/1476 transitions.
Support contains 128 out of 951 places after structural reductions.
[2024-05-29 12:14:36] [INFO ] Flatten gal took : 100 ms
[2024-05-29 12:14:36] [INFO ] Flatten gal took : 59 ms
[2024-05-29 12:14:36] [INFO ] Input system was already deterministic with 1196 transitions.
RANDOM walk for 40000 steps (511 resets) in 2581 ms. (15 steps per ms) remains 61/85 properties
BEST_FIRST walk for 4003 steps (11 resets) in 31 ms. (125 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (11 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (10 resets) in 41 ms. (95 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (10 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (10 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (10 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (9 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (9 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (11 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (10 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (9 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (10 resets) in 12 ms. (307 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (10 resets) in 25 ms. (154 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (11 resets) in 12 ms. (307 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (9 resets) in 11 ms. (333 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (10 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (9 resets) in 12 ms. (307 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (10 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (10 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (9 resets) in 50 ms. (78 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (10 resets) in 27 ms. (142 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (9 resets) in 9 ms. (400 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (9 resets) in 11 ms. (333 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (9 resets) in 12 ms. (307 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (9 resets) in 12 ms. (307 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (11 resets) in 13 ms. (285 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 60/60 properties
[2024-05-29 12:14:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 1 (OVERLAPS) 854/951 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 57 unsolved
[2024-05-29 12:14:39] [INFO ] Deduced a trap composed of 330 places in 395 ms of which 55 ms to minimize.
[2024-05-29 12:14:39] [INFO ] Deduced a trap composed of 335 places in 288 ms of which 6 ms to minimize.
[2024-05-29 12:14:39] [INFO ] Deduced a trap composed of 328 places in 220 ms of which 4 ms to minimize.
[2024-05-29 12:14:39] [INFO ] Deduced a trap composed of 336 places in 216 ms of which 4 ms to minimize.
[2024-05-29 12:14:40] [INFO ] Deduced a trap composed of 344 places in 218 ms of which 4 ms to minimize.
[2024-05-29 12:14:40] [INFO ] Deduced a trap composed of 327 places in 283 ms of which 5 ms to minimize.
[2024-05-29 12:14:40] [INFO ] Deduced a trap composed of 341 places in 300 ms of which 5 ms to minimize.
[2024-05-29 12:14:41] [INFO ] Deduced a trap composed of 338 places in 248 ms of which 5 ms to minimize.
[2024-05-29 12:14:41] [INFO ] Deduced a trap composed of 339 places in 191 ms of which 4 ms to minimize.
[2024-05-29 12:14:41] [INFO ] Deduced a trap composed of 340 places in 204 ms of which 3 ms to minimize.
[2024-05-29 12:14:41] [INFO ] Deduced a trap composed of 340 places in 193 ms of which 4 ms to minimize.
[2024-05-29 12:14:42] [INFO ] Deduced a trap composed of 337 places in 196 ms of which 4 ms to minimize.
[2024-05-29 12:14:42] [INFO ] Deduced a trap composed of 338 places in 191 ms of which 4 ms to minimize.
[2024-05-29 12:14:42] [INFO ] Deduced a trap composed of 338 places in 292 ms of which 6 ms to minimize.
[2024-05-29 12:14:42] [INFO ] Deduced a trap composed of 331 places in 235 ms of which 4 ms to minimize.
[2024-05-29 12:14:43] [INFO ] Deduced a trap composed of 335 places in 228 ms of which 4 ms to minimize.
SMT process timed out in 5096ms, After SMT, problems are : Problem set: 3 solved, 57 unsolved
Fused 57 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 94 out of 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 1196/1196 transitions.
Graph (trivial) has 779 edges and 951 vertex of which 48 / 951 are part of one of the 8 SCC in 5 ms
Free SCC test removed 40 places
Drop transitions (Empty/Sink Transition effects.) removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 1402 edges and 911 vertex of which 909 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 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 534 transitions
Trivial Post-agglo rules discarded 534 transitions
Performed 534 trivial Post agglomeration. Transition count delta: 534
Iterating post reduction 0 with 536 rules applied. Total rules applied 538 place count 909 transition count 609
Reduce places removed 534 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Iterating post reduction 1 with 583 rules applied. Total rules applied 1121 place count 375 transition count 560
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 56 rules applied. Total rules applied 1177 place count 327 transition count 552
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1181 place count 323 transition count 552
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1181 place count 323 transition count 503
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1279 place count 274 transition count 503
Performed 34 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 1347 place count 240 transition count 468
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1349 place count 240 transition count 466
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1357 place count 232 transition count 458
Iterating global reduction 5 with 8 rules applied. Total rules applied 1365 place count 232 transition count 458
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1367 place count 230 transition count 456
Iterating global reduction 5 with 2 rules applied. Total rules applied 1369 place count 230 transition count 456
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1370 place count 229 transition count 455
Iterating global reduction 5 with 1 rules applied. Total rules applied 1371 place count 229 transition count 455
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1375 place count 227 transition count 453
Performed 8 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1391 place count 219 transition count 471
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1394 place count 219 transition count 468
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1399 place count 219 transition count 463
Free-agglomeration rule applied 22 times.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1421 place count 219 transition count 441
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 1443 place count 197 transition count 441
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 1444 place count 197 transition count 440
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1452 place count 197 transition count 440
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1453 place count 197 transition count 440
Applied a total of 1453 rules in 194 ms. Remains 197 /951 variables (removed 754) and now considering 440/1196 (removed 756) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 197/951 places, 440/1196 transitions.
RANDOM walk for 40000 steps (3140 resets) in 488 ms. (81 steps per ms) remains 43/57 properties
BEST_FIRST walk for 4004 steps (37 resets) in 30 ms. (129 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (44 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (44 resets) in 12 ms. (307 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (43 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (41 resets) in 10 ms. (364 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (47 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (47 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (45 resets) in 12 ms. (307 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (44 resets) in 12 ms. (308 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (46 resets) in 12 ms. (307 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (44 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (42 resets) in 11 ms. (333 steps per ms) remains 40/43 properties
BEST_FIRST walk for 4004 steps (43 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (42 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (44 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (42 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (43 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (43 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (35 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (43 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (44 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (47 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (46 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (47 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (40 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (45 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (26 resets) in 11 ms. (333 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (45 resets) in 10 ms. (364 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (43 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (45 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (45 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (43 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (45 resets) in 27 ms. (143 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (47 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (45 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (41 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (43 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (45 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (33 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
// Phase 1: matrix 440 rows 197 cols
[2024-05-29 12:14:43] [INFO ] Computed 5 invariants in 5 ms
[2024-05-29 12:14:43] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 121/197 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 12:14:44] [INFO ] Deduced a trap composed of 66 places in 133 ms of which 1 ms to minimize.
[2024-05-29 12:14:44] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 2 ms to minimize.
[2024-05-29 12:14:44] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
[2024-05-29 12:14:44] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 1 ms to minimize.
[2024-05-29 12:14:44] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 1 ms to minimize.
Problem AtomicPropp24 is UNSAT
[2024-05-29 12:14:44] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 6/11 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 440/637 variables, 197/208 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/637 variables, 8/216 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 0/216 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/637 variables, 0/216 constraints. Problems are: Problem set: 1 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 637/637 variables, and 216 constraints, problems are : Problem set: 1 solved, 38 unsolved in 1902 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 197/197 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 1 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 38 unsolved
Problem AtomicPropp35 is UNSAT
At refinement iteration 1 (OVERLAPS) 123/197 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 6/11 constraints. Problems are: Problem set: 2 solved, 37 unsolved
[2024-05-29 12:14:46] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 1 ms to minimize.
Problem AtomicPropp79 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 1/12 constraints. Problems are: Problem set: 3 solved, 36 unsolved
[2024-05-29 12:14:46] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 1 ms to minimize.
[2024-05-29 12:14:46] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 2/14 constraints. Problems are: Problem set: 3 solved, 36 unsolved
[2024-05-29 12:14:46] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 1/15 constraints. Problems are: Problem set: 3 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 440/637 variables, 197/212 constraints. Problems are: Problem set: 3 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 8/220 constraints. Problems are: Problem set: 3 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/637 variables, 36/256 constraints. Problems are: Problem set: 3 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/637 variables, 0/256 constraints. Problems are: Problem set: 3 solved, 36 unsolved
At refinement iteration 11 (OVERLAPS) 0/637 variables, 0/256 constraints. Problems are: Problem set: 3 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 637/637 variables, and 256 constraints, problems are : Problem set: 3 solved, 36 unsolved in 3182 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 197/197 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 36/39 constraints, Known Traps: 10/10 constraints]
After SMT, in 5132ms problems are : Problem set: 3 solved, 36 unsolved
Parikh walk visited 12 properties in 2053 ms.
Support contains 46 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 440/440 transitions.
Graph (trivial) has 87 edges and 197 vertex of which 6 / 197 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 194 transition count 410
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 54 place count 170 transition count 405
Reduce places removed 2 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 10 rules applied. Total rules applied 64 place count 168 transition count 397
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 73 place count 160 transition count 396
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 73 place count 160 transition count 392
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 81 place count 156 transition count 392
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 88 place count 149 transition count 377
Iterating global reduction 4 with 7 rules applied. Total rules applied 95 place count 149 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 96 place count 149 transition count 376
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 116 place count 139 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 117 place count 139 transition count 365
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 125 place count 131 transition count 357
Iterating global reduction 6 with 8 rules applied. Total rules applied 133 place count 131 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 134 place count 131 transition count 356
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 137 place count 128 transition count 353
Iterating global reduction 7 with 3 rules applied. Total rules applied 140 place count 128 transition count 353
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 143 place count 125 transition count 350
Iterating global reduction 7 with 3 rules applied. Total rules applied 146 place count 125 transition count 350
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 161 place count 125 transition count 335
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 163 place count 124 transition count 341
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 164 place count 124 transition count 340
Free-agglomeration rule applied 16 times.
Iterating global reduction 8 with 16 rules applied. Total rules applied 180 place count 124 transition count 324
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 196 place count 108 transition count 324
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 197 place count 108 transition count 323
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 198 place count 108 transition count 323
Applied a total of 198 rules in 110 ms. Remains 108 /197 variables (removed 89) and now considering 323/440 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 108/197 places, 323/440 transitions.
RANDOM walk for 40000 steps (3254 resets) in 285 ms. (139 steps per ms) remains 21/24 properties
BEST_FIRST walk for 4003 steps (48 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (57 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (62 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (56 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (60 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (56 resets) in 10 ms. (364 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (56 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (48 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (57 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (51 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (57 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (62 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (59 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (62 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (56 resets) in 9 ms. (400 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4002 steps (59 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (55 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (53 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (66 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (60 resets) in 7 ms. (500 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (49 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
// Phase 1: matrix 323 rows 108 cols
[2024-05-29 12:14:51] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 12:14:51] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 70/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 323/431 variables, 108/113 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 92/205 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/431 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 0/431 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 205 constraints, problems are : Problem set: 0 solved, 19 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 108/108 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 70/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 323/431 variables, 108/113 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 92/205 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/431 variables, 19/224 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/431 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 431/431 variables, and 224 constraints, problems are : Problem set: 0 solved, 19 unsolved in 866 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 108/108 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 1317ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 18 properties in 1007 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 323/323 transitions.
Graph (trivial) has 80 edges and 108 vertex of which 8 / 108 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 376 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 102 transition count 293
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 46 place count 81 transition count 292
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 46 place count 81 transition count 286
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 58 place count 75 transition count 286
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 70 place count 63 transition count 177
Iterating global reduction 2 with 12 rules applied. Total rules applied 82 place count 63 transition count 177
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 93 place count 63 transition count 166
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 95 place count 61 transition count 164
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 61 transition count 164
Performed 6 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 109 place count 55 transition count 157
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 112 place count 55 transition count 154
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 117 place count 50 transition count 149
Iterating global reduction 4 with 5 rules applied. Total rules applied 122 place count 50 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 124 place count 50 transition count 147
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 126 place count 48 transition count 145
Iterating global reduction 5 with 2 rules applied. Total rules applied 128 place count 48 transition count 145
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 130 place count 46 transition count 143
Iterating global reduction 5 with 2 rules applied. Total rules applied 132 place count 46 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 133 place count 46 transition count 142
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 136 place count 46 transition count 139
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 137 place count 45 transition count 137
Iterating global reduction 6 with 1 rules applied. Total rules applied 138 place count 45 transition count 137
Free-agglomeration rule applied 17 times with reduction of 10 identical transitions.
Iterating global reduction 6 with 17 rules applied. Total rules applied 155 place count 45 transition count 110
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 6 with 44 rules applied. Total rules applied 199 place count 28 transition count 83
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 203 place count 24 transition count 79
Iterating global reduction 7 with 4 rules applied. Total rules applied 207 place count 24 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 7 with 23 rules applied. Total rules applied 230 place count 24 transition count 56
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 232 place count 23 transition count 57
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 233 place count 23 transition count 57
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 234 place count 23 transition count 56
Applied a total of 234 rules in 27 ms. Remains 23 /108 variables (removed 85) and now considering 56/323 (removed 267) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 23/108 places, 56/323 transitions.
RANDOM walk for 1519 steps (14 resets) in 44 ms. (33 steps per ms) remains 0/1 properties
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2024-05-29 12:14:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 12:14:53] [INFO ] Flatten gal took : 45 ms
FORMULA StigmergyCommit-PT-03b-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 12:14:53] [INFO ] Flatten gal took : 46 ms
[2024-05-29 12:14:53] [INFO ] Input system was already deterministic with 1196 transitions.
Support contains 107 out of 951 places (down from 115) after GAL structural reductions.
Computed a total of 176 stabilizing places and 184 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 951/951 places, 1196/1196 transitions.
Graph (trivial) has 943 edges and 951 vertex of which 75 / 951 are part of one of the 12 SCC in 2 ms
Free SCC test removed 63 places
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 662 transitions
Trivial Post-agglo rules discarded 662 transitions
Performed 662 trivial Post agglomeration. Transition count delta: 662
Iterating post reduction 0 with 662 rules applied. Total rules applied 663 place count 887 transition count 462
Reduce places removed 662 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 673 rules applied. Total rules applied 1336 place count 225 transition count 451
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1341 place count 220 transition count 451
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1341 place count 220 transition count 404
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1435 place count 173 transition count 404
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1451 place count 157 transition count 388
Iterating global reduction 3 with 16 rules applied. Total rules applied 1467 place count 157 transition count 388
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1473 place count 151 transition count 382
Iterating global reduction 3 with 6 rules applied. Total rules applied 1479 place count 151 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1480 place count 151 transition count 381
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1483 place count 148 transition count 378
Iterating global reduction 4 with 3 rules applied. Total rules applied 1486 place count 148 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1487 place count 148 transition count 377
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1489 place count 146 transition count 375
Iterating global reduction 5 with 2 rules applied. Total rules applied 1491 place count 146 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1492 place count 146 transition count 374
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 1548 place count 118 transition count 346
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1554 place count 118 transition count 340
Discarding 25 places :
Symmetric choice reduction at 7 with 25 rule applications. Total rules 1579 place count 93 transition count 189
Iterating global reduction 7 with 25 rules applied. Total rules applied 1604 place count 93 transition count 189
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1615 place count 93 transition count 178
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1628 place count 80 transition count 161
Iterating global reduction 8 with 13 rules applied. Total rules applied 1641 place count 80 transition count 161
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1653 place count 68 transition count 146
Iterating global reduction 8 with 12 rules applied. Total rules applied 1665 place count 68 transition count 146
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1671 place count 68 transition count 140
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 9 with 2 rules applied. Total rules applied 1673 place count 67 transition count 139
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1674 place count 66 transition count 134
Iterating global reduction 9 with 1 rules applied. Total rules applied 1675 place count 66 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1676 place count 66 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1680 place count 66 transition count 129
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 10 with 8 rules applied. Total rules applied 1688 place count 62 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1689 place count 61 transition count 124
Applied a total of 1689 rules in 69 ms. Remains 61 /951 variables (removed 890) and now considering 124/1196 (removed 1072) transitions.
[2024-05-29 12:14:53] [INFO ] Flow matrix only has 119 transitions (discarded 5 similar events)
// Phase 1: matrix 119 rows 61 cols
[2024-05-29 12:14:53] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:14:54] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 12:14:54] [INFO ] Flow matrix only has 119 transitions (discarded 5 similar events)
[2024-05-29 12:14:54] [INFO ] Invariant cache hit.
[2024-05-29 12:14:54] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 12:14:54] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-29 12:14:54] [INFO ] Redundant transitions in 3 ms returned []
Running 115 sub problems to find dead transitions.
[2024-05-29 12:14:54] [INFO ] Flow matrix only has 119 transitions (discarded 5 similar events)
[2024-05-29 12:14:54] [INFO ] Invariant cache hit.
[2024-05-29 12:14:54] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 4/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 12:14:54] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:14:54] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:14:54] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:14:54] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:14:54] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:14:54] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:14:54] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:14:54] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:14:54] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 4 ms to minimize.
[2024-05-29 12:14:55] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:14:55] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:14:55] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 12:14:55] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 12:14:55] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 118/179 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 14/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 1/180 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (OVERLAPS) 0/180 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 92 constraints, problems are : Problem set: 0 solved, 115 unsolved in 3683 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 4/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 12:14:58] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:14:58] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:14:58] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:14:58] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 12:14:58] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 12:14:58] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 118/179 variables, 61/83 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 14/97 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 115/212 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 12:14:59] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 13 (OVERLAPS) 1/180 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/180 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 15 (OVERLAPS) 0/180 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 214 constraints, problems are : Problem set: 0 solved, 115 unsolved in 5227 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 21/21 constraints]
After SMT, in 8957ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 8960ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/951 places, 124/1196 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9161 ms. Remains : 61/951 places, 124/1196 transitions.
[2024-05-29 12:15:03] [INFO ] Flatten gal took : 17 ms
[2024-05-29 12:15:03] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:15:03] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-29 12:15:03] [INFO ] Flatten gal took : 26 ms
[2024-05-29 12:15:03] [INFO ] Flatten gal took : 14 ms
RANDOM walk for 27322 steps (2911 resets) in 302 ms. (90 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-03b-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 12:15:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17759228887845616657.gal : 4 ms
[2024-05-29 12:15:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10318472997684954684.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17759228887845616657.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10318472997684954684.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 951/951 places, 1196/1196 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 925 transition count 1170
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 925 transition count 1170
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 69 place count 908 transition count 1153
Iterating global reduction 0 with 17 rules applied. Total rules applied 86 place count 908 transition count 1153
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 100 place count 894 transition count 1139
Iterating global reduction 0 with 14 rules applied. Total rules applied 114 place count 894 transition count 1139
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 894 transition count 1138
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 127 place count 882 transition count 1126
Iterating global reduction 1 with 12 rules applied. Total rules applied 139 place count 882 transition count 1126
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 149 place count 872 transition count 1116
Iterating global reduction 1 with 10 rules applied. Total rules applied 159 place count 872 transition count 1116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 160 place count 872 transition count 1115
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 169 place count 863 transition count 1106
Iterating global reduction 2 with 9 rules applied. Total rules applied 178 place count 863 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 186 place count 855 transition count 1098
Iterating global reduction 2 with 8 rules applied. Total rules applied 194 place count 855 transition count 1098
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 855 transition count 1097
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 201 place count 849 transition count 1091
Iterating global reduction 3 with 6 rules applied. Total rules applied 207 place count 849 transition count 1091
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 208 place count 849 transition count 1090
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 212 place count 845 transition count 1086
Iterating global reduction 4 with 4 rules applied. Total rules applied 216 place count 845 transition count 1086
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 220 place count 841 transition count 1082
Iterating global reduction 4 with 4 rules applied. Total rules applied 224 place count 841 transition count 1082
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 228 place count 837 transition count 1078
Iterating global reduction 4 with 4 rules applied. Total rules applied 232 place count 837 transition count 1078
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 236 place count 833 transition count 1074
Iterating global reduction 4 with 4 rules applied. Total rules applied 240 place count 833 transition count 1074
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 243 place count 830 transition count 1071
Iterating global reduction 4 with 3 rules applied. Total rules applied 246 place count 830 transition count 1071
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 249 place count 827 transition count 1068
Iterating global reduction 4 with 3 rules applied. Total rules applied 252 place count 827 transition count 1068
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 255 place count 824 transition count 1065
Iterating global reduction 4 with 3 rules applied. Total rules applied 258 place count 824 transition count 1065
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 261 place count 821 transition count 1062
Iterating global reduction 4 with 3 rules applied. Total rules applied 264 place count 821 transition count 1062
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 265 place count 821 transition count 1061
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 267 place count 819 transition count 1059
Iterating global reduction 5 with 2 rules applied. Total rules applied 269 place count 819 transition count 1059
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 271 place count 817 transition count 1057
Iterating global reduction 5 with 2 rules applied. Total rules applied 273 place count 817 transition count 1057
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 275 place count 815 transition count 1055
Iterating global reduction 5 with 2 rules applied. Total rules applied 277 place count 815 transition count 1055
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 279 place count 813 transition count 1053
Iterating global reduction 5 with 2 rules applied. Total rules applied 281 place count 813 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 282 place count 813 transition count 1052
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 283 place count 812 transition count 1051
Iterating global reduction 6 with 1 rules applied. Total rules applied 284 place count 812 transition count 1051
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 285 place count 812 transition count 1050
Applied a total of 285 rules in 716 ms. Remains 812 /951 variables (removed 139) and now considering 1050/1196 (removed 146) transitions.
// Phase 1: matrix 1050 rows 812 cols
[2024-05-29 12:15:04] [INFO ] Computed 5 invariants in 13 ms
[2024-05-29 12:15:04] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-29 12:15:04] [INFO ] Invariant cache hit.
[2024-05-29 12:15:04] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
Running 1049 sub problems to find dead transitions.
[2024-05-29 12:15:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/811 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1049 unsolved
At refinement iteration 1 (OVERLAPS) 1/812 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1049 unsolved
[2024-05-29 12:15:32] [INFO ] Deduced a trap composed of 297 places in 275 ms of which 7 ms to minimize.
[2024-05-29 12:15:33] [INFO ] Deduced a trap composed of 298 places in 199 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 812/1862 variables, and 7 constraints, problems are : Problem set: 0 solved, 1049 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/812 constraints, PredecessorRefiner: 1049/1049 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1049 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/811 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1049 unsolved
At refinement iteration 1 (OVERLAPS) 1/812 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1049 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/812 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1049 unsolved
[2024-05-29 12:15:53] [INFO ] Deduced a trap composed of 292 places in 188 ms of which 3 ms to minimize.
[2024-05-29 12:15:54] [INFO ] Deduced a trap composed of 292 places in 176 ms of which 4 ms to minimize.
[2024-05-29 12:15:55] [INFO ] Deduced a trap composed of 291 places in 265 ms of which 5 ms to minimize.
[2024-05-29 12:15:55] [INFO ] Deduced a trap composed of 290 places in 222 ms of which 4 ms to minimize.
[2024-05-29 12:15:55] [INFO ] Deduced a trap composed of 297 places in 227 ms of which 4 ms to minimize.
[2024-05-29 12:15:56] [INFO ] Deduced a trap composed of 293 places in 194 ms of which 3 ms to minimize.
[2024-05-29 12:15:56] [INFO ] Deduced a trap composed of 299 places in 256 ms of which 4 ms to minimize.
[2024-05-29 12:15:57] [INFO ] Deduced a trap composed of 303 places in 224 ms of which 4 ms to minimize.
[2024-05-29 12:15:57] [INFO ] Deduced a trap composed of 302 places in 251 ms of which 5 ms to minimize.
[2024-05-29 12:15:57] [INFO ] Deduced a trap composed of 314 places in 219 ms of which 4 ms to minimize.
[2024-05-29 12:15:57] [INFO ] Deduced a trap composed of 299 places in 209 ms of which 4 ms to minimize.
[2024-05-29 12:15:59] [INFO ] Deduced a trap composed of 309 places in 219 ms of which 4 ms to minimize.
[2024-05-29 12:15:59] [INFO ] Deduced a trap composed of 303 places in 212 ms of which 4 ms to minimize.
[2024-05-29 12:16:00] [INFO ] Deduced a trap composed of 309 places in 194 ms of which 4 ms to minimize.
[2024-05-29 12:16:00] [INFO ] Deduced a trap composed of 303 places in 170 ms of which 4 ms to minimize.
[2024-05-29 12:16:01] [INFO ] Deduced a trap composed of 303 places in 185 ms of which 3 ms to minimize.
[2024-05-29 12:16:04] [INFO ] Deduced a trap composed of 303 places in 186 ms of which 4 ms to minimize.
[2024-05-29 12:16:04] [INFO ] Deduced a trap composed of 305 places in 166 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 812/1862 variables, and 25 constraints, problems are : Problem set: 0 solved, 1049 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/812 constraints, PredecessorRefiner: 0/1049 constraints, Known Traps: 20/20 constraints]
After SMT, in 60452ms problems are : Problem set: 0 solved, 1049 unsolved
Search for dead transitions found 0 dead transitions in 60463ms
Starting structural reductions in LTL mode, iteration 1 : 812/951 places, 1050/1196 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61918 ms. Remains : 812/951 places, 1050/1196 transitions.
[2024-05-29 12:16:05] [INFO ] Flatten gal took : 28 ms
[2024-05-29 12:16:05] [INFO ] Flatten gal took : 27 ms
[2024-05-29 12:16:05] [INFO ] Input system was already deterministic with 1050 transitions.
[2024-05-29 12:16:05] [INFO ] Flatten gal took : 26 ms
[2024-05-29 12:16:05] [INFO ] Flatten gal took : 27 ms
[2024-05-29 12:16:05] [INFO ] Time to serialize gal into /tmp/CTLFireability11496638064289520461.gal : 9 ms
[2024-05-29 12:16:05] [INFO ] Time to serialize properties into /tmp/CTLFireability15530020306608424076.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11496638064289520461.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15530020306608424076.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1.01906e+10,20.1408,516752,2,28287,5,1.5536e+06,6,0,4300,2.2427e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:16:35] [INFO ] Flatten gal took : 26 ms
[2024-05-29 12:16:35] [INFO ] Applying decomposition
[2024-05-29 12:16:35] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3152049652804907873.txt' '-o' '/tmp/graph3152049652804907873.bin' '-w' '/tmp/graph3152049652804907873.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3152049652804907873.bin' '-l' '-1' '-v' '-w' '/tmp/graph3152049652804907873.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:16:35] [INFO ] Decomposing Gal with order
[2024-05-29 12:16:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:16:35] [INFO ] Removed a total of 861 redundant transitions.
[2024-05-29 12:16:36] [INFO ] Flatten gal took : 168 ms
[2024-05-29 12:16:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 26 ms.
[2024-05-29 12:16:36] [INFO ] Time to serialize gal into /tmp/CTLFireability15370040380193482910.gal : 13 ms
[2024-05-29 12:16:36] [INFO ] Time to serialize properties into /tmp/CTLFireability12435800086028756388.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15370040380193482910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12435800086028756388.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1.01906e+10,6.04697,181544,2302,17,318723,1036,1270,941231,51,3206,0


Converting to forward existential form...Done !
original formula: EG(E(((EG(AX((i7.u59.p174==1))) * (i37.i1.i0.u147.p500==1)) * (i37.i1.i0.u337.p1229==1)) U (E(AF((i30.u257.p923==1)) U (i14.u112.p382==1)...295
=> equivalent forward existential formula: [FwdG(Init,E(((EG(!(EX(!((i7.u59.p174==1))))) * (i37.i1.i0.u147.p500==1)) * (i37.i1.i0.u337.p1229==1)) U (E(!(EG...356
Reverse transition relation is NOT exact ! Due to transitions t76, t159, t215, t249, t276, t332, t422, t513, t569, t602, t692, t748, t768, t769, t772, t775...605
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 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 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
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 951/951 places, 1196/1196 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 924 transition count 1169
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 924 transition count 1169
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 73 place count 905 transition count 1150
Iterating global reduction 0 with 19 rules applied. Total rules applied 92 place count 905 transition count 1150
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 107 place count 890 transition count 1135
Iterating global reduction 0 with 15 rules applied. Total rules applied 122 place count 890 transition count 1135
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 890 transition count 1134
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 136 place count 877 transition count 1121
Iterating global reduction 1 with 13 rules applied. Total rules applied 149 place count 877 transition count 1121
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 160 place count 866 transition count 1110
Iterating global reduction 1 with 11 rules applied. Total rules applied 171 place count 866 transition count 1110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 172 place count 866 transition count 1109
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 182 place count 856 transition count 1099
Iterating global reduction 2 with 10 rules applied. Total rules applied 192 place count 856 transition count 1099
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 201 place count 847 transition count 1090
Iterating global reduction 2 with 9 rules applied. Total rules applied 210 place count 847 transition count 1090
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 211 place count 847 transition count 1089
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 218 place count 840 transition count 1082
Iterating global reduction 3 with 7 rules applied. Total rules applied 225 place count 840 transition count 1082
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 231 place count 834 transition count 1076
Iterating global reduction 3 with 6 rules applied. Total rules applied 237 place count 834 transition count 1076
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 243 place count 828 transition count 1070
Iterating global reduction 3 with 6 rules applied. Total rules applied 249 place count 828 transition count 1070
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 254 place count 823 transition count 1065
Iterating global reduction 3 with 5 rules applied. Total rules applied 259 place count 823 transition count 1065
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 260 place count 823 transition count 1064
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 264 place count 819 transition count 1060
Iterating global reduction 4 with 4 rules applied. Total rules applied 268 place count 819 transition count 1060
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 271 place count 816 transition count 1057
Iterating global reduction 4 with 3 rules applied. Total rules applied 274 place count 816 transition count 1057
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 277 place count 813 transition count 1054
Iterating global reduction 4 with 3 rules applied. Total rules applied 280 place count 813 transition count 1054
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 283 place count 810 transition count 1051
Iterating global reduction 4 with 3 rules applied. Total rules applied 286 place count 810 transition count 1051
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 289 place count 807 transition count 1048
Iterating global reduction 4 with 3 rules applied. Total rules applied 292 place count 807 transition count 1048
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 293 place count 807 transition count 1047
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 295 place count 805 transition count 1045
Iterating global reduction 5 with 2 rules applied. Total rules applied 297 place count 805 transition count 1045
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 299 place count 803 transition count 1043
Iterating global reduction 5 with 2 rules applied. Total rules applied 301 place count 803 transition count 1043
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 303 place count 801 transition count 1041
Iterating global reduction 5 with 2 rules applied. Total rules applied 305 place count 801 transition count 1041
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 307 place count 799 transition count 1039
Iterating global reduction 5 with 2 rules applied. Total rules applied 309 place count 799 transition count 1039
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 310 place count 799 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 311 place count 798 transition count 1037
Iterating global reduction 6 with 1 rules applied. Total rules applied 312 place count 798 transition count 1037
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 313 place count 798 transition count 1036
Applied a total of 313 rules in 412 ms. Remains 798 /951 variables (removed 153) and now considering 1036/1196 (removed 160) transitions.
// Phase 1: matrix 1036 rows 798 cols
[2024-05-29 12:17:06] [INFO ] Computed 5 invariants in 13 ms
[2024-05-29 12:17:06] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-29 12:17:06] [INFO ] Invariant cache hit.
[2024-05-29 12:17:07] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
Running 1035 sub problems to find dead transitions.
[2024-05-29 12:17:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/797 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 1 (OVERLAPS) 1/798 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
[2024-05-29 12:17:34] [INFO ] Deduced a trap composed of 297 places in 267 ms of which 7 ms to minimize.
[2024-05-29 12:17:34] [INFO ] Deduced a trap composed of 298 places in 193 ms of which 3 ms to minimize.
[2024-05-29 12:17:34] [INFO ] Deduced a trap composed of 297 places in 191 ms of which 4 ms to minimize.
[2024-05-29 12:17:36] [INFO ] Deduced a trap composed of 297 places in 192 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 798/1834 variables, and 9 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/798 constraints, PredecessorRefiner: 1035/1035 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1035 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/797 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 1 (OVERLAPS) 1/798 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/798 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
[2024-05-29 12:17:50] [INFO ] Deduced a trap composed of 292 places in 194 ms of which 4 ms to minimize.
[2024-05-29 12:17:55] [INFO ] Deduced a trap composed of 306 places in 225 ms of which 4 ms to minimize.
[2024-05-29 12:17:58] [INFO ] Deduced a trap composed of 291 places in 213 ms of which 4 ms to minimize.
[2024-05-29 12:18:01] [INFO ] Deduced a trap composed of 299 places in 188 ms of which 3 ms to minimize.
[2024-05-29 12:18:02] [INFO ] Deduced a trap composed of 293 places in 189 ms of which 3 ms to minimize.
[2024-05-29 12:18:05] [INFO ] Deduced a trap composed of 292 places in 193 ms of which 4 ms to minimize.
[2024-05-29 12:18:05] [INFO ] Deduced a trap composed of 292 places in 195 ms of which 3 ms to minimize.
[2024-05-29 12:18:06] [INFO ] Deduced a trap composed of 293 places in 230 ms of which 4 ms to minimize.
[2024-05-29 12:18:06] [INFO ] Deduced a trap composed of 297 places in 228 ms of which 4 ms to minimize.
[2024-05-29 12:18:06] [INFO ] Deduced a trap composed of 291 places in 203 ms of which 4 ms to minimize.
[2024-05-29 12:18:07] [INFO ] Deduced a trap composed of 299 places in 251 ms of which 5 ms to minimize.
[2024-05-29 12:18:07] [INFO ] Deduced a trap composed of 297 places in 241 ms of which 4 ms to minimize.
[2024-05-29 12:18:07] [INFO ] Deduced a trap composed of 297 places in 217 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 798/1834 variables, and 22 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/798 constraints, PredecessorRefiner: 0/1035 constraints, Known Traps: 17/17 constraints]
After SMT, in 60385ms problems are : Problem set: 0 solved, 1035 unsolved
Search for dead transitions found 0 dead transitions in 60394ms
Starting structural reductions in LTL mode, iteration 1 : 798/951 places, 1036/1196 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61488 ms. Remains : 798/951 places, 1036/1196 transitions.
[2024-05-29 12:18:07] [INFO ] Flatten gal took : 23 ms
[2024-05-29 12:18:07] [INFO ] Flatten gal took : 23 ms
[2024-05-29 12:18:07] [INFO ] Input system was already deterministic with 1036 transitions.
[2024-05-29 12:18:07] [INFO ] Flatten gal took : 21 ms
[2024-05-29 12:18:07] [INFO ] Flatten gal took : 22 ms
[2024-05-29 12:18:07] [INFO ] Time to serialize gal into /tmp/CTLFireability10751633579071617139.gal : 4 ms
[2024-05-29 12:18:07] [INFO ] Time to serialize properties into /tmp/CTLFireability6723355976349786364.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10751633579071617139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6723355976349786364.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,9.76446e+09,21.1731,460912,2,26014,5,1.38604e+06,6,0,4230,2.0018e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:18:37] [INFO ] Flatten gal took : 23 ms
[2024-05-29 12:18:37] [INFO ] Applying decomposition
[2024-05-29 12:18:37] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10774403941723816871.txt' '-o' '/tmp/graph10774403941723816871.bin' '-w' '/tmp/graph10774403941723816871.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10774403941723816871.bin' '-l' '-1' '-v' '-w' '/tmp/graph10774403941723816871.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:18:38] [INFO ] Decomposing Gal with order
[2024-05-29 12:18:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:18:38] [INFO ] Removed a total of 858 redundant transitions.
[2024-05-29 12:18:38] [INFO ] Flatten gal took : 83 ms
[2024-05-29 12:18:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 15 ms.
[2024-05-29 12:18:38] [INFO ] Time to serialize gal into /tmp/CTLFireability3610052253314126255.gal : 9 ms
[2024-05-29 12:18:38] [INFO ] Time to serialize properties into /tmp/CTLFireability12657418844652376695.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3610052253314126255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12657418844652376695.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,9.76446e+09,7.31602,263560,2383,17,493638,839,1270,1.20487e+06,43,2628,0


Converting to forward existential form...Done !
original formula: E(AG(!((EG(AX((i15.i1.i1.u328.p1215==1))) * AG(A((((i8.u26.p139==1)&&(i8.u112.p396==1))&&((i8.u192.p698==1)&&(i8.u244.p1022==1))) U (i23....202
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(!((EG(!(EX(!((i15.i1.i1.u328.p1215==1))))) * !(E(TRUE U !(!((E(!((i23.u219.p775==1)) U ...343
Reverse transition relation is NOT exact ! Due to transitions t76, t166, t222, t256, t283, t339, t429, t511, t512, t568, t601, t684, t760, t761, t764, t767...611
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 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 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
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 951/951 places, 1196/1196 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 924 transition count 1169
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 924 transition count 1169
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 73 place count 905 transition count 1150
Iterating global reduction 0 with 19 rules applied. Total rules applied 92 place count 905 transition count 1150
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 108 place count 889 transition count 1134
Iterating global reduction 0 with 16 rules applied. Total rules applied 124 place count 889 transition count 1134
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 889 transition count 1133
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 139 place count 875 transition count 1119
Iterating global reduction 1 with 14 rules applied. Total rules applied 153 place count 875 transition count 1119
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 165 place count 863 transition count 1107
Iterating global reduction 1 with 12 rules applied. Total rules applied 177 place count 863 transition count 1107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 178 place count 863 transition count 1106
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 189 place count 852 transition count 1095
Iterating global reduction 2 with 11 rules applied. Total rules applied 200 place count 852 transition count 1095
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 210 place count 842 transition count 1085
Iterating global reduction 2 with 10 rules applied. Total rules applied 220 place count 842 transition count 1085
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 221 place count 842 transition count 1084
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 229 place count 834 transition count 1076
Iterating global reduction 3 with 8 rules applied. Total rules applied 237 place count 834 transition count 1076
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 238 place count 834 transition count 1075
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 244 place count 828 transition count 1069
Iterating global reduction 4 with 6 rules applied. Total rules applied 250 place count 828 transition count 1069
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 256 place count 822 transition count 1063
Iterating global reduction 4 with 6 rules applied. Total rules applied 262 place count 822 transition count 1063
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 267 place count 817 transition count 1058
Iterating global reduction 4 with 5 rules applied. Total rules applied 272 place count 817 transition count 1058
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 273 place count 817 transition count 1057
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 277 place count 813 transition count 1053
Iterating global reduction 5 with 4 rules applied. Total rules applied 281 place count 813 transition count 1053
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 284 place count 810 transition count 1050
Iterating global reduction 5 with 3 rules applied. Total rules applied 287 place count 810 transition count 1050
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 290 place count 807 transition count 1047
Iterating global reduction 5 with 3 rules applied. Total rules applied 293 place count 807 transition count 1047
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 296 place count 804 transition count 1044
Iterating global reduction 5 with 3 rules applied. Total rules applied 299 place count 804 transition count 1044
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 302 place count 801 transition count 1041
Iterating global reduction 5 with 3 rules applied. Total rules applied 305 place count 801 transition count 1041
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 306 place count 801 transition count 1040
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 308 place count 799 transition count 1038
Iterating global reduction 6 with 2 rules applied. Total rules applied 310 place count 799 transition count 1038
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 312 place count 797 transition count 1036
Iterating global reduction 6 with 2 rules applied. Total rules applied 314 place count 797 transition count 1036
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 316 place count 795 transition count 1034
Iterating global reduction 6 with 2 rules applied. Total rules applied 318 place count 795 transition count 1034
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 320 place count 793 transition count 1032
Iterating global reduction 6 with 2 rules applied. Total rules applied 322 place count 793 transition count 1032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 323 place count 793 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 324 place count 792 transition count 1030
Iterating global reduction 7 with 1 rules applied. Total rules applied 325 place count 792 transition count 1030
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 326 place count 792 transition count 1029
Applied a total of 326 rules in 409 ms. Remains 792 /951 variables (removed 159) and now considering 1029/1196 (removed 167) transitions.
// Phase 1: matrix 1029 rows 792 cols
[2024-05-29 12:19:08] [INFO ] Computed 5 invariants in 6 ms
[2024-05-29 12:19:08] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-29 12:19:08] [INFO ] Invariant cache hit.
[2024-05-29 12:19:09] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
Running 1028 sub problems to find dead transitions.
[2024-05-29 12:19:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/791 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 1 (OVERLAPS) 1/792 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
[2024-05-29 12:19:35] [INFO ] Deduced a trap composed of 297 places in 267 ms of which 5 ms to minimize.
[2024-05-29 12:19:36] [INFO ] Deduced a trap composed of 290 places in 199 ms of which 3 ms to minimize.
[2024-05-29 12:19:36] [INFO ] Deduced a trap composed of 297 places in 193 ms of which 3 ms to minimize.
[2024-05-29 12:19:38] [INFO ] Deduced a trap composed of 297 places in 185 ms of which 3 ms to minimize.
[2024-05-29 12:19:39] [INFO ] Deduced a trap composed of 292 places in 183 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 792/1821 variables, and 10 constraints, problems are : Problem set: 0 solved, 1028 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/792 constraints, PredecessorRefiner: 1028/1028 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1028 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/791 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 1 (OVERLAPS) 1/792 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
[2024-05-29 12:19:58] [INFO ] Deduced a trap composed of 298 places in 197 ms of which 3 ms to minimize.
[2024-05-29 12:19:59] [INFO ] Deduced a trap composed of 291 places in 228 ms of which 4 ms to minimize.
[2024-05-29 12:19:59] [INFO ] Deduced a trap composed of 300 places in 224 ms of which 4 ms to minimize.
[2024-05-29 12:20:00] [INFO ] Deduced a trap composed of 291 places in 234 ms of which 4 ms to minimize.
[2024-05-29 12:20:04] [INFO ] Deduced a trap composed of 299 places in 214 ms of which 5 ms to minimize.
[2024-05-29 12:20:04] [INFO ] Deduced a trap composed of 291 places in 185 ms of which 3 ms to minimize.
[2024-05-29 12:20:04] [INFO ] Deduced a trap composed of 298 places in 191 ms of which 3 ms to minimize.
[2024-05-29 12:20:04] [INFO ] Deduced a trap composed of 291 places in 232 ms of which 4 ms to minimize.
[2024-05-29 12:20:04] [INFO ] Deduced a trap composed of 299 places in 226 ms of which 4 ms to minimize.
[2024-05-29 12:20:05] [INFO ] Deduced a trap composed of 297 places in 207 ms of which 4 ms to minimize.
[2024-05-29 12:20:05] [INFO ] Deduced a trap composed of 386 places in 223 ms of which 4 ms to minimize.
[2024-05-29 12:20:06] [INFO ] Deduced a trap composed of 299 places in 194 ms of which 4 ms to minimize.
[2024-05-29 12:20:06] [INFO ] Deduced a trap composed of 301 places in 226 ms of which 4 ms to minimize.
[2024-05-29 12:20:06] [INFO ] Deduced a trap composed of 291 places in 191 ms of which 3 ms to minimize.
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 1)
(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 0)
(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 1)
(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 timeout
0)
(s476 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 792/1821 variables, and 24 constraints, problems are : Problem set: 0 solved, 1028 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/792 constraints, PredecessorRefiner: 0/1028 constraints, Known Traps: 19/19 constraints]
After SMT, in 60387ms problems are : Problem set: 0 solved, 1028 unsolved
Search for dead transitions found 0 dead transitions in 60399ms
Starting structural reductions in LTL mode, iteration 1 : 792/951 places, 1029/1196 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61489 ms. Remains : 792/951 places, 1029/1196 transitions.
[2024-05-29 12:20:09] [INFO ] Flatten gal took : 26 ms
[2024-05-29 12:20:09] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:20:09] [INFO ] Input system was already deterministic with 1029 transitions.
[2024-05-29 12:20:09] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:20:10] [INFO ] Flatten gal took : 21 ms
[2024-05-29 12:20:10] [INFO ] Time to serialize gal into /tmp/CTLFireability17672681698142292611.gal : 4 ms
[2024-05-29 12:20:10] [INFO ] Time to serialize properties into /tmp/CTLFireability10735485852625293597.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17672681698142292611.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10735485852625293597.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,9.57991e+09,18.0392,450968,2,25800,5,1.3603e+06,6,0,4199,1.95567e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:20:40] [INFO ] Flatten gal took : 31 ms
[2024-05-29 12:20:40] [INFO ] Applying decomposition
[2024-05-29 12:20:40] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph121951245445327210.txt' '-o' '/tmp/graph121951245445327210.bin' '-w' '/tmp/graph121951245445327210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph121951245445327210.bin' '-l' '-1' '-v' '-w' '/tmp/graph121951245445327210.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:20:40] [INFO ] Decomposing Gal with order
[2024-05-29 12:20:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:20:40] [INFO ] Removed a total of 858 redundant transitions.
[2024-05-29 12:20:40] [INFO ] Flatten gal took : 43 ms
[2024-05-29 12:20:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2024-05-29 12:20:40] [INFO ] Time to serialize gal into /tmp/CTLFireability16237034306897698397.gal : 6 ms
[2024-05-29 12:20:40] [INFO ] Time to serialize properties into /tmp/CTLFireability2920329940543955134.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16237034306897698397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2920329940543955134.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,9.57991e+09,3.4472,137524,2080,15,255022,870,1226,647237,47,2526,0


Converting to forward existential form...Done !
original formula: EX((AF((((i36.u313.p1192==1) + A((i11.u91.p340==1) U (i11.u90.p337==1))) * A(EG((i21.i1.i1.u198.p716==1)) U ((i15.u133.p469==1)||(i6.u59....215
=> equivalent forward existential formula: ([(EY(Init) * !(EG(!((((i36.u313.p1192==1) + !((E(!((i11.u90.p337==1)) U (!((i11.u91.p340==1)) * !((i11.u90.p337...456
Reverse transition relation is NOT exact ! Due to transitions t76, t159, t249, t276, t332, t388, t422, t507, t563, t596, t679, t755, t756, t759, t762, t765...587
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 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 a local 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
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 951/951 places, 1196/1196 transitions.
Graph (trivial) has 938 edges and 951 vertex of which 75 / 951 are part of one of the 12 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 657 transitions
Trivial Post-agglo rules discarded 657 transitions
Performed 657 trivial Post agglomeration. Transition count delta: 657
Iterating post reduction 0 with 657 rules applied. Total rules applied 658 place count 887 transition count 467
Reduce places removed 657 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 666 rules applied. Total rules applied 1324 place count 230 transition count 458
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 1330 place count 226 transition count 456
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 1334 place count 224 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1335 place count 223 transition count 454
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 47 Pre rules applied. Total rules applied 1335 place count 223 transition count 407
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 1429 place count 176 transition count 407
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1445 place count 160 transition count 391
Iterating global reduction 5 with 16 rules applied. Total rules applied 1461 place count 160 transition count 391
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1467 place count 154 transition count 385
Iterating global reduction 5 with 6 rules applied. Total rules applied 1473 place count 154 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1474 place count 154 transition count 384
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1477 place count 151 transition count 381
Iterating global reduction 6 with 3 rules applied. Total rules applied 1480 place count 151 transition count 381
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1482 place count 149 transition count 379
Iterating global reduction 6 with 2 rules applied. Total rules applied 1484 place count 149 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1485 place count 149 transition count 378
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 1541 place count 121 transition count 350
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1547 place count 121 transition count 344
Discarding 25 places :
Symmetric choice reduction at 8 with 25 rule applications. Total rules 1572 place count 96 transition count 193
Iterating global reduction 8 with 25 rules applied. Total rules applied 1597 place count 96 transition count 193
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1608 place count 96 transition count 182
Discarding 13 places :
Symmetric choice reduction at 9 with 13 rule applications. Total rules 1621 place count 83 transition count 165
Iterating global reduction 9 with 13 rules applied. Total rules applied 1634 place count 83 transition count 165
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 1646 place count 71 transition count 150
Iterating global reduction 9 with 12 rules applied. Total rules applied 1658 place count 71 transition count 150
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1664 place count 71 transition count 144
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 10 with 2 rules applied. Total rules applied 1666 place count 70 transition count 143
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1667 place count 69 transition count 138
Iterating global reduction 10 with 1 rules applied. Total rules applied 1668 place count 69 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1669 place count 69 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 1673 place count 69 transition count 133
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 11 with 8 rules applied. Total rules applied 1681 place count 65 transition count 129
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1682 place count 65 transition count 129
Applied a total of 1682 rules in 50 ms. Remains 65 /951 variables (removed 886) and now considering 129/1196 (removed 1067) transitions.
[2024-05-29 12:21:10] [INFO ] Flow matrix only has 124 transitions (discarded 5 similar events)
// Phase 1: matrix 124 rows 65 cols
[2024-05-29 12:21:10] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:21:10] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 12:21:10] [INFO ] Flow matrix only has 124 transitions (discarded 5 similar events)
[2024-05-29 12:21:10] [INFO ] Invariant cache hit.
[2024-05-29 12:21:10] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 12:21:10] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-29 12:21:10] [INFO ] Redundant transitions in 3 ms returned []
Running 126 sub problems to find dead transitions.
[2024-05-29 12:21:10] [INFO ] Flow matrix only has 124 transitions (discarded 5 similar events)
[2024-05-29 12:21:10] [INFO ] Invariant cache hit.
[2024-05-29 12:21:10] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 12:21:11] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:21:11] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:21:11] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-29 12:21:11] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-29 12:21:11] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-29 12:21:11] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:21:11] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:21:11] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:21:11] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:21:11] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:21:11] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:21:11] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:21:11] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:21:11] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:21:11] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:21:11] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:21:11] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 12:21:12] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 12:21:12] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:21:12] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:21:12] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:21:12] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 123/188 variables, 65/89 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 14/103 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 1/189 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 12 (OVERLAPS) 0/189 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 104 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5233 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 123/188 variables, 65/89 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 14/103 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 126/229 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 12:21:17] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:21:17] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 1/189 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 12:21:21] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 12:21:22] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 14 (OVERLAPS) 0/189 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 234 constraints, problems are : Problem set: 0 solved, 126 unsolved in 10921 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 26/26 constraints]
After SMT, in 16201ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 16203ms
Starting structural reductions in SI_CTL mode, iteration 1 : 65/951 places, 129/1196 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16381 ms. Remains : 65/951 places, 129/1196 transitions.
[2024-05-29 12:21:26] [INFO ] Flatten gal took : 16 ms
[2024-05-29 12:21:26] [INFO ] Flatten gal took : 7 ms
[2024-05-29 12:21:26] [INFO ] Input system was already deterministic with 129 transitions.
[2024-05-29 12:21:26] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:21:26] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:21:26] [INFO ] Time to serialize gal into /tmp/CTLFireability7801075854337367109.gal : 7 ms
[2024-05-29 12:21:26] [INFO ] Time to serialize properties into /tmp/CTLFireability16607856241147400664.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7801075854337367109.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16607856241147400664.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,64912,0.204392,12228,2,2756,5,30127,6,0,384,27787,0


Converting to forward existential form...Done !
original formula: EF((AF(EG(A((p558==1) U (p25==1)))) * (p507==1)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p507==1)) * !(EG(!(EG(!((E(!((p25==1)) U (!((p558==1)) * !((p25==1)))) + EG(!((p25==1)))))...170
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t10, t11, t12, t15, t18, t19, t24, t26, t27, t28, t44, t51, t60, t61, t64, t65, t...325
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,7.69398,215364,1,0,625,1.2956e+06,289,329,3496,947001,685
FORMULA StigmergyCommit-PT-03b-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 951/951 places, 1196/1196 transitions.
Graph (trivial) has 942 edges and 951 vertex of which 72 / 951 are part of one of the 11 SCC in 4 ms
Free SCC test removed 61 places
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 662 transitions
Trivial Post-agglo rules discarded 662 transitions
Performed 662 trivial Post agglomeration. Transition count delta: 662
Iterating post reduction 0 with 662 rules applied. Total rules applied 663 place count 889 transition count 464
Reduce places removed 662 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 673 rules applied. Total rules applied 1336 place count 227 transition count 453
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 1342 place count 222 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1343 place count 221 transition count 452
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 1343 place count 221 transition count 404
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1439 place count 173 transition count 404
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1454 place count 158 transition count 389
Iterating global reduction 4 with 15 rules applied. Total rules applied 1469 place count 158 transition count 389
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1475 place count 152 transition count 383
Iterating global reduction 4 with 6 rules applied. Total rules applied 1481 place count 152 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1482 place count 152 transition count 382
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1485 place count 149 transition count 379
Iterating global reduction 5 with 3 rules applied. Total rules applied 1488 place count 149 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1489 place count 149 transition count 378
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1491 place count 147 transition count 376
Iterating global reduction 6 with 2 rules applied. Total rules applied 1493 place count 147 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1494 place count 147 transition count 375
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 1550 place count 119 transition count 347
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1556 place count 119 transition count 341
Discarding 25 places :
Symmetric choice reduction at 8 with 25 rule applications. Total rules 1581 place count 94 transition count 190
Iterating global reduction 8 with 25 rules applied. Total rules applied 1606 place count 94 transition count 190
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1617 place count 94 transition count 179
Discarding 13 places :
Symmetric choice reduction at 9 with 13 rule applications. Total rules 1630 place count 81 transition count 162
Iterating global reduction 9 with 13 rules applied. Total rules applied 1643 place count 81 transition count 162
Discarding 13 places :
Symmetric choice reduction at 9 with 13 rule applications. Total rules 1656 place count 68 transition count 145
Iterating global reduction 9 with 13 rules applied. Total rules applied 1669 place count 68 transition count 145
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1675 place count 68 transition count 139
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 10 with 2 rules applied. Total rules applied 1677 place count 67 transition count 138
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1678 place count 66 transition count 134
Iterating global reduction 10 with 1 rules applied. Total rules applied 1679 place count 66 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1680 place count 66 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 1684 place count 66 transition count 129
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 11 with 8 rules applied. Total rules applied 1692 place count 62 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1693 place count 61 transition count 124
Applied a total of 1693 rules in 56 ms. Remains 61 /951 variables (removed 890) and now considering 124/1196 (removed 1072) transitions.
[2024-05-29 12:21:34] [INFO ] Flow matrix only has 119 transitions (discarded 5 similar events)
// Phase 1: matrix 119 rows 61 cols
[2024-05-29 12:21:34] [INFO ] Computed 3 invariants in 15 ms
[2024-05-29 12:21:34] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-29 12:21:34] [INFO ] Flow matrix only has 119 transitions (discarded 5 similar events)
[2024-05-29 12:21:34] [INFO ] Invariant cache hit.
[2024-05-29 12:21:34] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 12:21:34] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-29 12:21:34] [INFO ] Redundant transitions in 2 ms returned []
Running 115 sub problems to find dead transitions.
[2024-05-29 12:21:34] [INFO ] Flow matrix only has 119 transitions (discarded 5 similar events)
[2024-05-29 12:21:34] [INFO ] Invariant cache hit.
[2024-05-29 12:21:34] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 4/61 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 12:21:35] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:21:35] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:21:35] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:21:35] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:21:35] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:21:35] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:21:35] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:21:35] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:21:35] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:21:35] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:21:35] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:21:35] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-29 12:21:35] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:21:35] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 12:21:36] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:21:36] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 118/179 variables, 61/80 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 14/94 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 1/180 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 12:21:37] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:21:37] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (OVERLAPS) 0/180 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 97 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 4/61 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 12:21:39] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 118/179 variables, 61/83 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 14/97 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 115/212 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 12:21:40] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (OVERLAPS) 1/180 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 13 (OVERLAPS) 0/180 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 214 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4637 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 20/20 constraints]
After SMT, in 8704ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 8705ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/951 places, 124/1196 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8900 ms. Remains : 61/951 places, 124/1196 transitions.
[2024-05-29 12:21:43] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:21:43] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:21:43] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-29 12:21:43] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:21:43] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:21:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18363857840642956480.gal : 7 ms
[2024-05-29 12:21:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17915962591615766411.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18363857840642956480.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17915962591615766411.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17915962591615766411.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
RANDOM walk for 40000 steps (4262 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 49
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :49 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 1200
BEST_FIRST walk for 40004 steps (564 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1200 after 4147
Finished probabilistic random walk after 164 steps, run visited all 1 properties in 5 ms. (steps per millisecond=32 )
Probabilistic random walk after 164 steps, saw 154 distinct states, run finished after 24 ms. (steps per millisecond=6 ) properties seen :1
FORMULA StigmergyCommit-PT-03b-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4147 after 7044
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 951/951 places, 1196/1196 transitions.
Graph (trivial) has 933 edges and 951 vertex of which 75 / 951 are part of one of the 12 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 651 transitions
Trivial Post-agglo rules discarded 651 transitions
Performed 651 trivial Post agglomeration. Transition count delta: 651
Iterating post reduction 0 with 651 rules applied. Total rules applied 652 place count 887 transition count 473
Reduce places removed 651 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 662 rules applied. Total rules applied 1314 place count 236 transition count 462
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1319 place count 231 transition count 462
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 1319 place count 231 transition count 414
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 1415 place count 183 transition count 414
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1431 place count 167 transition count 398
Iterating global reduction 3 with 16 rules applied. Total rules applied 1447 place count 167 transition count 398
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1453 place count 161 transition count 392
Iterating global reduction 3 with 6 rules applied. Total rules applied 1459 place count 161 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1460 place count 161 transition count 391
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1463 place count 158 transition count 388
Iterating global reduction 4 with 3 rules applied. Total rules applied 1466 place count 158 transition count 388
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1467 place count 158 transition count 387
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1469 place count 156 transition count 385
Iterating global reduction 5 with 2 rules applied. Total rules applied 1471 place count 156 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1472 place count 156 transition count 384
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 1528 place count 128 transition count 356
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1534 place count 128 transition count 350
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 1553 place count 109 transition count 284
Iterating global reduction 7 with 19 rules applied. Total rules applied 1572 place count 109 transition count 284
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1577 place count 109 transition count 279
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1590 place count 96 transition count 262
Iterating global reduction 8 with 13 rules applied. Total rules applied 1603 place count 96 transition count 262
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1616 place count 83 transition count 245
Iterating global reduction 8 with 13 rules applied. Total rules applied 1629 place count 83 transition count 245
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1635 place count 83 transition count 239
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 9 with 2 rules applied. Total rules applied 1637 place count 82 transition count 238
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1638 place count 81 transition count 234
Iterating global reduction 9 with 1 rules applied. Total rules applied 1639 place count 81 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1640 place count 81 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1644 place count 81 transition count 229
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 10 with 8 rules applied. Total rules applied 1652 place count 77 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1653 place count 76 transition count 224
Applied a total of 1653 rules in 57 ms. Remains 76 /951 variables (removed 875) and now considering 224/1196 (removed 972) transitions.
[2024-05-29 12:21:43] [INFO ] Flow matrix only has 219 transitions (discarded 5 similar events)
// Phase 1: matrix 219 rows 76 cols
[2024-05-29 12:21:43] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 12:21:44] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-29 12:21:44] [INFO ] Flow matrix only has 219 transitions (discarded 5 similar events)
[2024-05-29 12:21:44] [INFO ] Invariant cache hit.
[2024-05-29 12:21:44] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 12:21:44] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2024-05-29 12:21:44] [INFO ] Redundant transitions in 11 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-29 12:21:44] [INFO ] Flow matrix only has 219 transitions (discarded 5 similar events)
[2024-05-29 12:21:44] [INFO ] Invariant cache hit.
[2024-05-29 12:21:44] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-29 12:21:45] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-29 12:21:45] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:21:45] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-29 12:21:45] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-29 12:21:45] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-05-29 12:21:45] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-29 12:21:45] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:21:45] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:21:45] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2024-05-29 12:21:45] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 0 ms to minimize.
[2024-05-29 12:21:45] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-29 12:21:46] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-29 12:21:46] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 0 ms to minimize.
[2024-05-29 12:21:46] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 218/294 variables, 76/92 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 1/295 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (OVERLAPS) 0/295 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 107 constraints, problems are : Problem set: 0 solved, 215 unsolved in 7390 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-29 12:21:52] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-29 12:21:52] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 218/294 variables, 76/94 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 215/323 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (OVERLAPS) 1/295 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 12 (OVERLAPS) 0/295 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 324 constraints, problems are : Problem set: 0 solved, 215 unsolved in 12910 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 16/16 constraints]
After SMT, in 20492ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 20495ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/951 places, 224/1196 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21026 ms. Remains : 76/951 places, 224/1196 transitions.
[2024-05-29 12:22:04] [INFO ] Flatten gal took : 10 ms
[2024-05-29 12:22:04] [INFO ] Flatten gal took : 13 ms
[2024-05-29 12:22:04] [INFO ] Input system was already deterministic with 224 transitions.
[2024-05-29 12:22:04] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:22:04] [INFO ] Flatten gal took : 7 ms
[2024-05-29 12:22:04] [INFO ] Time to serialize gal into /tmp/CTLFireability9354530114372772467.gal : 2 ms
[2024-05-29 12:22:04] [INFO ] Time to serialize properties into /tmp/CTLFireability5817399124024416141.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9354530114372772467.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5817399124024416141.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,182996,0.319087,15944,2,3693,5,35338,6,0,520,36463,0


Converting to forward existential form...Done !
original formula: !(E(!(EG((!((((p72==1)&&(p329==1))&&((p676==1)&&(p933==1)))) + EG((((p139==1)&&(p441==1))&&((p698==1)&&(p1000==1))))))) U (((p139==1)&&(p...191
=> equivalent forward existential formula: [(FwdU(Init,!(EG((!((((p72==1)&&(p329==1))&&((p676==1)&&(p933==1)))) + EG((((p139==1)&&(p441==1))&&((p698==1)&&(...233
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t14, t15, t16, t22, t23, t24, t33, t35, t36, t37, t62, t63, t73, t74, t80, t81, t...330
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,9.61229,295816,1,0,538,1.5782e+06,477,329,5572,1.06921e+06,677
FORMULA StigmergyCommit-PT-03b-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 951/951 places, 1196/1196 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 924 transition count 1169
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 924 transition count 1169
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 73 place count 905 transition count 1150
Iterating global reduction 0 with 19 rules applied. Total rules applied 92 place count 905 transition count 1150
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 107 place count 890 transition count 1135
Iterating global reduction 0 with 15 rules applied. Total rules applied 122 place count 890 transition count 1135
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 890 transition count 1134
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 136 place count 877 transition count 1121
Iterating global reduction 1 with 13 rules applied. Total rules applied 149 place count 877 transition count 1121
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 160 place count 866 transition count 1110
Iterating global reduction 1 with 11 rules applied. Total rules applied 171 place count 866 transition count 1110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 172 place count 866 transition count 1109
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 182 place count 856 transition count 1099
Iterating global reduction 2 with 10 rules applied. Total rules applied 192 place count 856 transition count 1099
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 201 place count 847 transition count 1090
Iterating global reduction 2 with 9 rules applied. Total rules applied 210 place count 847 transition count 1090
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 211 place count 847 transition count 1089
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 218 place count 840 transition count 1082
Iterating global reduction 3 with 7 rules applied. Total rules applied 225 place count 840 transition count 1082
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 226 place count 840 transition count 1081
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 231 place count 835 transition count 1076
Iterating global reduction 4 with 5 rules applied. Total rules applied 236 place count 835 transition count 1076
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 241 place count 830 transition count 1071
Iterating global reduction 4 with 5 rules applied. Total rules applied 246 place count 830 transition count 1071
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 250 place count 826 transition count 1067
Iterating global reduction 4 with 4 rules applied. Total rules applied 254 place count 826 transition count 1067
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 255 place count 826 transition count 1066
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 258 place count 823 transition count 1063
Iterating global reduction 5 with 3 rules applied. Total rules applied 261 place count 823 transition count 1063
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 263 place count 821 transition count 1061
Iterating global reduction 5 with 2 rules applied. Total rules applied 265 place count 821 transition count 1061
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 267 place count 819 transition count 1059
Iterating global reduction 5 with 2 rules applied. Total rules applied 269 place count 819 transition count 1059
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 271 place count 817 transition count 1057
Iterating global reduction 5 with 2 rules applied. Total rules applied 273 place count 817 transition count 1057
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 275 place count 815 transition count 1055
Iterating global reduction 5 with 2 rules applied. Total rules applied 277 place count 815 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 278 place count 815 transition count 1054
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 279 place count 814 transition count 1053
Iterating global reduction 6 with 1 rules applied. Total rules applied 280 place count 814 transition count 1053
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 281 place count 813 transition count 1052
Iterating global reduction 6 with 1 rules applied. Total rules applied 282 place count 813 transition count 1052
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 283 place count 812 transition count 1051
Iterating global reduction 6 with 1 rules applied. Total rules applied 284 place count 812 transition count 1051
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 285 place count 811 transition count 1050
Iterating global reduction 6 with 1 rules applied. Total rules applied 286 place count 811 transition count 1050
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 287 place count 810 transition count 1049
Iterating global reduction 6 with 1 rules applied. Total rules applied 288 place count 810 transition count 1049
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 289 place count 810 transition count 1048
Applied a total of 289 rules in 417 ms. Remains 810 /951 variables (removed 141) and now considering 1048/1196 (removed 148) transitions.
// Phase 1: matrix 1048 rows 810 cols
[2024-05-29 12:22:14] [INFO ] Computed 5 invariants in 12 ms
[2024-05-29 12:22:15] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-29 12:22:15] [INFO ] Invariant cache hit.
[2024-05-29 12:22:15] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
Running 1047 sub problems to find dead transitions.
[2024-05-29 12:22:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/809 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
At refinement iteration 1 (OVERLAPS) 1/810 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
[2024-05-29 12:22:43] [INFO ] Deduced a trap composed of 291 places in 268 ms of which 5 ms to minimize.
[2024-05-29 12:22:44] [INFO ] Deduced a trap composed of 317 places in 268 ms of which 5 ms to minimize.
[2024-05-29 12:22:44] [INFO ] Deduced a trap composed of 290 places in 193 ms of which 3 ms to minimize.
[2024-05-29 12:22:44] [INFO ] Deduced a trap composed of 297 places in 192 ms of which 3 ms to minimize.
[2024-05-29 12:22:45] [INFO ] Deduced a trap composed of 298 places in 182 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/1858 variables, and 10 constraints, problems are : Problem set: 0 solved, 1047 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/810 constraints, PredecessorRefiner: 1047/1047 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1047 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/809 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
At refinement iteration 1 (OVERLAPS) 1/810 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
[2024-05-29 12:22:59] [INFO ] Deduced a trap composed of 292 places in 177 ms of which 3 ms to minimize.
[2024-05-29 12:23:07] [INFO ] Deduced a trap composed of 298 places in 230 ms of which 4 ms to minimize.
[2024-05-29 12:23:08] [INFO ] Deduced a trap composed of 299 places in 190 ms of which 4 ms to minimize.
[2024-05-29 12:23:09] [INFO ] Deduced a trap composed of 299 places in 208 ms of which 4 ms to minimize.
[2024-05-29 12:23:09] [INFO ] Deduced a trap composed of 293 places in 190 ms of which 3 ms to minimize.
[2024-05-29 12:23:10] [INFO ] Deduced a trap composed of 293 places in 191 ms of which 3 ms to minimize.
[2024-05-29 12:23:11] [INFO ] Deduced a trap composed of 292 places in 197 ms of which 4 ms to minimize.
[2024-05-29 12:23:11] [INFO ] Deduced a trap composed of 293 places in 176 ms of which 3 ms to minimize.
[2024-05-29 12:23:12] [INFO ] Deduced a trap composed of 292 places in 191 ms of which 3 ms to minimize.
[2024-05-29 12:23:12] [INFO ] Deduced a trap composed of 319 places in 193 ms of which 4 ms to minimize.
[2024-05-29 12:23:13] [INFO ] Deduced a trap composed of 299 places in 193 ms of which 3 ms to minimize.
[2024-05-29 12:23:14] [INFO ] Deduced a trap composed of 293 places in 180 ms of which 4 ms to minimize.
[2024-05-29 12:23:14] [INFO ] Deduced a trap composed of 299 places in 194 ms of which 3 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 1)
(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 1)
(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 0)
(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 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 1)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 1)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 timeout
0)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/1858 variables, and 23 constraints, problems are : Problem set: 0 solved, 1047 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/810 constraints, PredecessorRefiner: 0/1047 constraints, Known Traps: 18/18 constraints]
After SMT, in 60386ms problems are : Problem set: 0 solved, 1047 unsolved
Search for dead transitions found 0 dead transitions in 60396ms
Starting structural reductions in LTL mode, iteration 1 : 810/951 places, 1048/1196 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61543 ms. Remains : 810/951 places, 1048/1196 transitions.
[2024-05-29 12:23:16] [INFO ] Flatten gal took : 29 ms
[2024-05-29 12:23:16] [INFO ] Flatten gal took : 21 ms
[2024-05-29 12:23:16] [INFO ] Input system was already deterministic with 1048 transitions.
[2024-05-29 12:23:16] [INFO ] Flatten gal took : 19 ms
[2024-05-29 12:23:16] [INFO ] Flatten gal took : 19 ms
[2024-05-29 12:23:16] [INFO ] Time to serialize gal into /tmp/CTLFireability4276585196070801256.gal : 4 ms
[2024-05-29 12:23:16] [INFO ] Time to serialize properties into /tmp/CTLFireability9515195014745142299.ctl : 24 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4276585196070801256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9515195014745142299.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1.01336e+10,20.5504,521496,2,31906,5,1.65454e+06,6,0,4290,2.25899e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:23:46] [INFO ] Flatten gal took : 21 ms
[2024-05-29 12:23:46] [INFO ] Applying decomposition
[2024-05-29 12:23:46] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11648369979864575504.txt' '-o' '/tmp/graph11648369979864575504.bin' '-w' '/tmp/graph11648369979864575504.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11648369979864575504.bin' '-l' '-1' '-v' '-w' '/tmp/graph11648369979864575504.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:23:46] [INFO ] Decomposing Gal with order
[2024-05-29 12:23:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:23:46] [INFO ] Removed a total of 864 redundant transitions.
[2024-05-29 12:23:46] [INFO ] Flatten gal took : 75 ms
[2024-05-29 12:23:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-29 12:23:46] [INFO ] Time to serialize gal into /tmp/CTLFireability12916684921994638764.gal : 20 ms
[2024-05-29 12:23:46] [INFO ] Time to serialize properties into /tmp/CTLFireability18237743491415905069.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12916684921994638764.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18237743491415905069.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1.01336e+10,5.02445,185828,2225,15,320098,1000,1319,1.00797e+06,52,3113,0


Converting to forward existential form...Done !
original formula: EX(AF(AG((i6.u64.p188==0))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(E(TRUE U !((i6.u64.p188==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t76, t103, t215, t249, t332, t385, t388, t422, t504, t505, t561, t594, t691, t767, t768, t771...585
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 4
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
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
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
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 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 a local 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
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 951/951 places, 1196/1196 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 928 transition count 1173
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 928 transition count 1173
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 63 place count 911 transition count 1156
Iterating global reduction 0 with 17 rules applied. Total rules applied 80 place count 911 transition count 1156
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 93 place count 898 transition count 1143
Iterating global reduction 0 with 13 rules applied. Total rules applied 106 place count 898 transition count 1143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 107 place count 898 transition count 1142
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 118 place count 887 transition count 1131
Iterating global reduction 1 with 11 rules applied. Total rules applied 129 place count 887 transition count 1131
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 138 place count 878 transition count 1122
Iterating global reduction 1 with 9 rules applied. Total rules applied 147 place count 878 transition count 1122
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 156 place count 869 transition count 1113
Iterating global reduction 1 with 9 rules applied. Total rules applied 165 place count 869 transition count 1113
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 172 place count 862 transition count 1106
Iterating global reduction 1 with 7 rules applied. Total rules applied 179 place count 862 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 180 place count 862 transition count 1105
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 186 place count 856 transition count 1099
Iterating global reduction 2 with 6 rules applied. Total rules applied 192 place count 856 transition count 1099
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 193 place count 856 transition count 1098
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 198 place count 851 transition count 1093
Iterating global reduction 3 with 5 rules applied. Total rules applied 203 place count 851 transition count 1093
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 208 place count 846 transition count 1088
Iterating global reduction 3 with 5 rules applied. Total rules applied 213 place count 846 transition count 1088
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 217 place count 842 transition count 1084
Iterating global reduction 3 with 4 rules applied. Total rules applied 221 place count 842 transition count 1084
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 842 transition count 1083
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 225 place count 839 transition count 1080
Iterating global reduction 4 with 3 rules applied. Total rules applied 228 place count 839 transition count 1080
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 230 place count 837 transition count 1078
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 837 transition count 1078
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 234 place count 835 transition count 1076
Iterating global reduction 4 with 2 rules applied. Total rules applied 236 place count 835 transition count 1076
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 238 place count 833 transition count 1074
Iterating global reduction 4 with 2 rules applied. Total rules applied 240 place count 833 transition count 1074
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 242 place count 831 transition count 1072
Iterating global reduction 4 with 2 rules applied. Total rules applied 244 place count 831 transition count 1072
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 246 place count 829 transition count 1070
Iterating global reduction 4 with 2 rules applied. Total rules applied 248 place count 829 transition count 1070
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 250 place count 827 transition count 1068
Iterating global reduction 4 with 2 rules applied. Total rules applied 252 place count 827 transition count 1068
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 254 place count 825 transition count 1066
Iterating global reduction 4 with 2 rules applied. Total rules applied 256 place count 825 transition count 1066
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 258 place count 823 transition count 1064
Iterating global reduction 4 with 2 rules applied. Total rules applied 260 place count 823 transition count 1064
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 823 transition count 1063
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 262 place count 822 transition count 1062
Iterating global reduction 5 with 1 rules applied. Total rules applied 263 place count 822 transition count 1062
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 264 place count 822 transition count 1061
Applied a total of 264 rules in 420 ms. Remains 822 /951 variables (removed 129) and now considering 1061/1196 (removed 135) transitions.
// Phase 1: matrix 1061 rows 822 cols
[2024-05-29 12:24:17] [INFO ] Computed 5 invariants in 11 ms
[2024-05-29 12:24:17] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-29 12:24:17] [INFO ] Invariant cache hit.
[2024-05-29 12:24:17] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
Running 1060 sub problems to find dead transitions.
[2024-05-29 12:24:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/821 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
At refinement iteration 1 (OVERLAPS) 1/822 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
[2024-05-29 12:24:46] [INFO ] Deduced a trap composed of 308 places in 273 ms of which 6 ms to minimize.
[2024-05-29 12:24:47] [INFO ] Deduced a trap composed of 309 places in 278 ms of which 5 ms to minimize.
[2024-05-29 12:24:47] [INFO ] Deduced a trap composed of 316 places in 201 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 822/1883 variables, and 8 constraints, problems are : Problem set: 0 solved, 1060 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/822 constraints, PredecessorRefiner: 1060/1060 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1060 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/821 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
At refinement iteration 1 (OVERLAPS) 1/822 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/822 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
[2024-05-29 12:25:05] [INFO ] Deduced a trap composed of 317 places in 203 ms of which 3 ms to minimize.
[2024-05-29 12:25:09] [INFO ] Deduced a trap composed of 303 places in 219 ms of which 4 ms to minimize.
[2024-05-29 12:25:09] [INFO ] Deduced a trap composed of 299 places in 230 ms of which 4 ms to minimize.
[2024-05-29 12:25:11] [INFO ] Deduced a trap composed of 299 places in 204 ms of which 3 ms to minimize.
[2024-05-29 12:25:11] [INFO ] Deduced a trap composed of 294 places in 163 ms of which 3 ms to minimize.
[2024-05-29 12:25:13] [INFO ] Deduced a trap composed of 299 places in 230 ms of which 4 ms to minimize.
[2024-05-29 12:25:14] [INFO ] Deduced a trap composed of 300 places in 228 ms of which 4 ms to minimize.
[2024-05-29 12:25:15] [INFO ] Deduced a trap composed of 293 places in 207 ms of which 4 ms to minimize.
[2024-05-29 12:25:16] [INFO ] Deduced a trap composed of 293 places in 206 ms of which 4 ms to minimize.
[2024-05-29 12:25:17] [INFO ] Deduced a trap composed of 296 places in 195 ms of which 4 ms to minimize.
[2024-05-29 12:25:18] [INFO ] Deduced a trap composed of 298 places in 257 ms of which 5 ms to minimize.
SMT process timed out in 60670ms, After SMT, problems are : Problem set: 0 solved, 1060 unsolved
Search for dead transitions found 0 dead transitions in 60685ms
Starting structural reductions in LTL mode, iteration 1 : 822/951 places, 1061/1196 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61880 ms. Remains : 822/951 places, 1061/1196 transitions.
[2024-05-29 12:25:18] [INFO ] Flatten gal took : 21 ms
[2024-05-29 12:25:18] [INFO ] Flatten gal took : 26 ms
[2024-05-29 12:25:18] [INFO ] Input system was already deterministic with 1061 transitions.
[2024-05-29 12:25:18] [INFO ] Flatten gal took : 19 ms
[2024-05-29 12:25:18] [INFO ] Flatten gal took : 19 ms
[2024-05-29 12:25:18] [INFO ] Time to serialize gal into /tmp/CTLFireability8251322149548755630.gal : 4 ms
[2024-05-29 12:25:18] [INFO ] Time to serialize properties into /tmp/CTLFireability16270960933836362106.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8251322149548755630.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16270960933836362106.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1.05481e+10,25.0331,484844,2,26585,5,1.47119e+06,6,0,4351,2.12132e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:25:48] [INFO ] Flatten gal took : 24 ms
[2024-05-29 12:25:48] [INFO ] Applying decomposition
[2024-05-29 12:25:48] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17701755288356985490.txt' '-o' '/tmp/graph17701755288356985490.bin' '-w' '/tmp/graph17701755288356985490.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17701755288356985490.bin' '-l' '-1' '-v' '-w' '/tmp/graph17701755288356985490.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:25:48] [INFO ] Decomposing Gal with order
[2024-05-29 12:25:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:25:48] [INFO ] Removed a total of 863 redundant transitions.
[2024-05-29 12:25:48] [INFO ] Flatten gal took : 41 ms
[2024-05-29 12:25:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2024-05-29 12:25:48] [INFO ] Time to serialize gal into /tmp/CTLFireability6227116814211792897.gal : 7 ms
[2024-05-29 12:25:48] [INFO ] Time to serialize properties into /tmp/CTLFireability9979548850410906949.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6227116814211792897.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9979548850410906949.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1.05481e+10,4.7464,160860,2274,15,293611,941,1310,767848,49,2715,0


Converting to forward existential form...Done !
original formula: ((AF((i30.u295.p1030==1)) * (A(AG((i23.u234.p849==1)) U AX((i32.u253.p912==1))) + EF(((i37.i1.i0.u316.p1104==0)||(i37.i1.i0.u341.p1229==0...323
=> equivalent forward existential formula: (([FwdG(Init,!((i30.u295.p1030==1)))] = FALSE * ([(EY((FwdU((Init * !(E(TRUE U ((i37.i1.i0.u316.p1104==0)||(i37....862
Reverse transition relation is NOT exact ! Due to transitions t77, t106, t116, t172, t230, t263, t356, t412, t446, t529, t530, t586, t619, t758, t779, t784...610
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 a local 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
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
(forward)formula 0,0,28.5796,1009368,1,0,1.49632e+06,1061,12926,7.60451e+06,272,4571,2999108
FORMULA StigmergyCommit-PT-03b-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 951/951 places, 1196/1196 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 923 transition count 1168
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 923 transition count 1168
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 75 place count 904 transition count 1149
Iterating global reduction 0 with 19 rules applied. Total rules applied 94 place count 904 transition count 1149
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 110 place count 888 transition count 1133
Iterating global reduction 0 with 16 rules applied. Total rules applied 126 place count 888 transition count 1133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 127 place count 888 transition count 1132
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 141 place count 874 transition count 1118
Iterating global reduction 1 with 14 rules applied. Total rules applied 155 place count 874 transition count 1118
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 167 place count 862 transition count 1106
Iterating global reduction 1 with 12 rules applied. Total rules applied 179 place count 862 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 180 place count 862 transition count 1105
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 191 place count 851 transition count 1094
Iterating global reduction 2 with 11 rules applied. Total rules applied 202 place count 851 transition count 1094
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 212 place count 841 transition count 1084
Iterating global reduction 2 with 10 rules applied. Total rules applied 222 place count 841 transition count 1084
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 223 place count 841 transition count 1083
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 231 place count 833 transition count 1075
Iterating global reduction 3 with 8 rules applied. Total rules applied 239 place count 833 transition count 1075
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 240 place count 833 transition count 1074
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 246 place count 827 transition count 1068
Iterating global reduction 4 with 6 rules applied. Total rules applied 252 place count 827 transition count 1068
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 258 place count 821 transition count 1062
Iterating global reduction 4 with 6 rules applied. Total rules applied 264 place count 821 transition count 1062
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 269 place count 816 transition count 1057
Iterating global reduction 4 with 5 rules applied. Total rules applied 274 place count 816 transition count 1057
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 275 place count 816 transition count 1056
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 279 place count 812 transition count 1052
Iterating global reduction 5 with 4 rules applied. Total rules applied 283 place count 812 transition count 1052
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 286 place count 809 transition count 1049
Iterating global reduction 5 with 3 rules applied. Total rules applied 289 place count 809 transition count 1049
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 292 place count 806 transition count 1046
Iterating global reduction 5 with 3 rules applied. Total rules applied 295 place count 806 transition count 1046
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 298 place count 803 transition count 1043
Iterating global reduction 5 with 3 rules applied. Total rules applied 301 place count 803 transition count 1043
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 303 place count 801 transition count 1041
Iterating global reduction 5 with 2 rules applied. Total rules applied 305 place count 801 transition count 1041
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 306 place count 801 transition count 1040
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 307 place count 800 transition count 1039
Iterating global reduction 6 with 1 rules applied. Total rules applied 308 place count 800 transition count 1039
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 309 place count 799 transition count 1038
Iterating global reduction 6 with 1 rules applied. Total rules applied 310 place count 799 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 311 place count 798 transition count 1037
Iterating global reduction 6 with 1 rules applied. Total rules applied 312 place count 798 transition count 1037
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 313 place count 797 transition count 1036
Iterating global reduction 6 with 1 rules applied. Total rules applied 314 place count 797 transition count 1036
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 315 place count 796 transition count 1035
Iterating global reduction 6 with 1 rules applied. Total rules applied 316 place count 796 transition count 1035
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 317 place count 796 transition count 1034
Applied a total of 317 rules in 406 ms. Remains 796 /951 variables (removed 155) and now considering 1034/1196 (removed 162) transitions.
// Phase 1: matrix 1034 rows 796 cols
[2024-05-29 12:26:18] [INFO ] Computed 5 invariants in 12 ms
[2024-05-29 12:26:18] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-29 12:26:18] [INFO ] Invariant cache hit.
[2024-05-29 12:26:18] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
Running 1033 sub problems to find dead transitions.
[2024-05-29 12:26:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/795 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1033 unsolved
At refinement iteration 1 (OVERLAPS) 1/796 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1033 unsolved
[2024-05-29 12:26:46] [INFO ] Deduced a trap composed of 291 places in 295 ms of which 4 ms to minimize.
[2024-05-29 12:26:46] [INFO ] Deduced a trap composed of 292 places in 242 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 796/1830 variables, and 7 constraints, problems are : Problem set: 0 solved, 1033 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/796 constraints, PredecessorRefiner: 1033/1033 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1033 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/795 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1033 unsolved
At refinement iteration 1 (OVERLAPS) 1/796 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1033 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/796 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1033 unsolved
[2024-05-29 12:27:09] [INFO ] Deduced a trap composed of 298 places in 233 ms of which 5 ms to minimize.
[2024-05-29 12:27:10] [INFO ] Deduced a trap composed of 292 places in 224 ms of which 4 ms to minimize.
[2024-05-29 12:27:11] [INFO ] Deduced a trap composed of 293 places in 197 ms of which 3 ms to minimize.
[2024-05-29 12:27:12] [INFO ] Deduced a trap composed of 293 places in 202 ms of which 3 ms to minimize.
[2024-05-29 12:27:13] [INFO ] Deduced a trap composed of 304 places in 208 ms of which 3 ms to minimize.
[2024-05-29 12:27:13] [INFO ] Deduced a trap composed of 293 places in 202 ms of which 3 ms to minimize.
[2024-05-29 12:27:14] [INFO ] Deduced a trap composed of 299 places in 173 ms of which 3 ms to minimize.
[2024-05-29 12:27:15] [INFO ] Deduced a trap composed of 292 places in 174 ms of which 3 ms to minimize.
[2024-05-29 12:27:15] [INFO ] Deduced a trap composed of 293 places in 180 ms of which 3 ms to minimize.
[2024-05-29 12:27:18] [INFO ] Deduced a trap composed of 298 places in 163 ms of which 4 ms to minimize.
[2024-05-29 12:27:18] [INFO ] Deduced a trap composed of 302 places in 184 ms of which 3 ms to minimize.
[2024-05-29 12:27:18] [INFO ] Deduced a trap composed of 291 places in 189 ms of which 4 ms to minimize.
[2024-05-29 12:27:19] [INFO ] Deduced a trap composed of 297 places in 213 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 796/1830 variables, and 20 constraints, problems are : Problem set: 0 solved, 1033 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/796 constraints, PredecessorRefiner: 0/1033 constraints, Known Traps: 15/15 constraints]
After SMT, in 60417ms problems are : Problem set: 0 solved, 1033 unsolved
Search for dead transitions found 0 dead transitions in 60431ms
Starting structural reductions in LTL mode, iteration 1 : 796/951 places, 1034/1196 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61552 ms. Remains : 796/951 places, 1034/1196 transitions.
[2024-05-29 12:27:19] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:27:19] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:27:19] [INFO ] Input system was already deterministic with 1034 transitions.
[2024-05-29 12:27:19] [INFO ] Flatten gal took : 19 ms
[2024-05-29 12:27:19] [INFO ] Flatten gal took : 19 ms
[2024-05-29 12:27:19] [INFO ] Time to serialize gal into /tmp/CTLFireability14660153116685564996.gal : 4 ms
[2024-05-29 12:27:19] [INFO ] Time to serialize properties into /tmp/CTLFireability5047080929990633248.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14660153116685564996.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5047080929990633248.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,9.68982e+09,19.6625,474068,2,24954,5,1.41407e+06,6,0,4220,2.10279e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:27:49] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:27:49] [INFO ] Applying decomposition
[2024-05-29 12:27:49] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5018739544420508919.txt' '-o' '/tmp/graph5018739544420508919.bin' '-w' '/tmp/graph5018739544420508919.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5018739544420508919.bin' '-l' '-1' '-v' '-w' '/tmp/graph5018739544420508919.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:27:49] [INFO ] Decomposing Gal with order
[2024-05-29 12:27:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:27:49] [INFO ] Removed a total of 860 redundant transitions.
[2024-05-29 12:27:49] [INFO ] Flatten gal took : 44 ms
[2024-05-29 12:27:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-29 12:27:49] [INFO ] Time to serialize gal into /tmp/CTLFireability1041003830784216452.gal : 6 ms
[2024-05-29 12:27:49] [INFO ] Time to serialize properties into /tmp/CTLFireability9228629030533415323.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1041003830784216452.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9228629030533415323.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,9.68982e+09,7.84895,290512,2167,17,530820,900,1297,1.44383e+06,51,2676,0


Converting to forward existential form...Done !
original formula: E(((i7.i1.i1.u329.p1226==1) + EX(EG((i22.i0.i0.u198.p701!=1)))) U !(((((i10.u86.p327==1)||(((i9.u2.p116==1)&&(i9.u88.p441==1))&&((i9.u167...277
=> equivalent forward existential formula: [(FwdU(Init,((i7.i1.i1.u329.p1226==1) + EX(EG((i22.i0.i0.u198.p701!=1))))) * !(((((i10.u86.p327==1)||(((i9.u2.p1...323
Reverse transition relation is NOT exact ! Due to transitions t76, t159, t215, t249, t332, t388, t422, t561, t594, t683, t759, t760, t763, t766, t769, t770...598
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 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 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
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 951/951 places, 1196/1196 transitions.
Graph (trivial) has 938 edges and 951 vertex of which 75 / 951 are part of one of the 12 SCC in 0 ms
Free SCC test removed 63 places
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 656 transitions
Trivial Post-agglo rules discarded 656 transitions
Performed 656 trivial Post agglomeration. Transition count delta: 656
Iterating post reduction 0 with 656 rules applied. Total rules applied 657 place count 887 transition count 468
Reduce places removed 656 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 667 rules applied. Total rules applied 1324 place count 231 transition count 457
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1329 place count 226 transition count 457
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 1329 place count 226 transition count 409
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 1425 place count 178 transition count 409
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1441 place count 162 transition count 393
Iterating global reduction 3 with 16 rules applied. Total rules applied 1457 place count 162 transition count 393
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1463 place count 156 transition count 387
Iterating global reduction 3 with 6 rules applied. Total rules applied 1469 place count 156 transition count 387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1470 place count 156 transition count 386
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1473 place count 153 transition count 383
Iterating global reduction 4 with 3 rules applied. Total rules applied 1476 place count 153 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1477 place count 153 transition count 382
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1479 place count 151 transition count 380
Iterating global reduction 5 with 2 rules applied. Total rules applied 1481 place count 151 transition count 380
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1482 place count 151 transition count 379
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 1538 place count 123 transition count 351
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1543 place count 123 transition count 346
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 1565 place count 101 transition count 233
Iterating global reduction 7 with 22 rules applied. Total rules applied 1587 place count 101 transition count 233
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1595 place count 101 transition count 225
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1608 place count 88 transition count 208
Iterating global reduction 8 with 13 rules applied. Total rules applied 1621 place count 88 transition count 208
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1634 place count 75 transition count 191
Iterating global reduction 8 with 13 rules applied. Total rules applied 1647 place count 75 transition count 191
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1653 place count 75 transition count 185
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 9 with 2 rules applied. Total rules applied 1655 place count 74 transition count 184
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1656 place count 73 transition count 180
Iterating global reduction 9 with 1 rules applied. Total rules applied 1657 place count 73 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1658 place count 73 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1662 place count 73 transition count 175
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 10 with 8 rules applied. Total rules applied 1670 place count 69 transition count 171
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1671 place count 68 transition count 170
Applied a total of 1671 rules in 52 ms. Remains 68 /951 variables (removed 883) and now considering 170/1196 (removed 1026) transitions.
[2024-05-29 12:28:19] [INFO ] Flow matrix only has 165 transitions (discarded 5 similar events)
// Phase 1: matrix 165 rows 68 cols
[2024-05-29 12:28:19] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 12:28:19] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 12:28:19] [INFO ] Flow matrix only has 165 transitions (discarded 5 similar events)
[2024-05-29 12:28:19] [INFO ] Invariant cache hit.
[2024-05-29 12:28:19] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 12:28:19] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-29 12:28:19] [INFO ] Redundant transitions in 5 ms returned []
Running 161 sub problems to find dead transitions.
[2024-05-29 12:28:19] [INFO ] Flow matrix only has 165 transitions (discarded 5 similar events)
[2024-05-29 12:28:20] [INFO ] Invariant cache hit.
[2024-05-29 12:28:20] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 4/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-29 12:28:20] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:28:20] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:28:20] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2024-05-29 12:28:20] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:28:20] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-29 12:28:20] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 0 ms to minimize.
[2024-05-29 12:28:21] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-29 12:28:21] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:28:21] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-29 12:28:21] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2024-05-29 12:28:21] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 7 ms to minimize.
[2024-05-29 12:28:21] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-29 12:28:21] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-29 12:28:21] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:28:21] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 11 ms to minimize.
[2024-05-29 12:28:21] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 164/232 variables, 68/86 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 14/100 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 1/233 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (OVERLAPS) 0/233 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 101 constraints, problems are : Problem set: 0 solved, 161 unsolved in 4957 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 4/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 164/232 variables, 68/86 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 14/100 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 161/261 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-29 12:28:27] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (OVERLAPS) 1/233 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-29 12:28:33] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 4 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/233 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-29 12:28:34] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-29 12:28:35] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/233 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 16 (OVERLAPS) 0/233 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 266 constraints, problems are : Problem set: 0 solved, 161 unsolved in 16700 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 20/20 constraints]
After SMT, in 21776ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 21777ms
Starting structural reductions in SI_CTL mode, iteration 1 : 68/951 places, 170/1196 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22014 ms. Remains : 68/951 places, 170/1196 transitions.
[2024-05-29 12:28:41] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:28:41] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:28:41] [INFO ] Input system was already deterministic with 170 transitions.
[2024-05-29 12:28:41] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:28:41] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:28:41] [INFO ] Time to serialize gal into /tmp/CTLFireability4076619108205807312.gal : 1 ms
[2024-05-29 12:28:41] [INFO ] Time to serialize properties into /tmp/CTLFireability18029188474113011328.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4076619108205807312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18029188474113011328.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,103764,0.288563,15176,2,2797,5,33010,6,0,434,33387,0


Converting to forward existential form...Done !
original formula: EG(!(E((p1071==1) U (((p27==1)&&(p351==1))&&((p653==1)&&(p955==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E((p1071==1) U (((p27==1)&&(p351==1))&&((p653==1)&&(p955==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t6, t14, t15, t16, t20, t21, t22, t29, t31, t32, t33, t55, t56, t65, t66, t68, t69, t...332
(forward)formula 0,1,2.25616,76644,1,0,358,259701,360,198,4473,313843,415
FORMULA StigmergyCommit-PT-03b-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 951/951 places, 1196/1196 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 930 transition count 1175
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 930 transition count 1175
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 57 place count 915 transition count 1160
Iterating global reduction 0 with 15 rules applied. Total rules applied 72 place count 915 transition count 1160
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 83 place count 904 transition count 1149
Iterating global reduction 0 with 11 rules applied. Total rules applied 94 place count 904 transition count 1149
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 104 place count 894 transition count 1139
Iterating global reduction 0 with 10 rules applied. Total rules applied 114 place count 894 transition count 1139
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 122 place count 886 transition count 1131
Iterating global reduction 0 with 8 rules applied. Total rules applied 130 place count 886 transition count 1131
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 138 place count 878 transition count 1123
Iterating global reduction 0 with 8 rules applied. Total rules applied 146 place count 878 transition count 1123
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 153 place count 871 transition count 1116
Iterating global reduction 0 with 7 rules applied. Total rules applied 160 place count 871 transition count 1116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 161 place count 871 transition count 1115
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 166 place count 866 transition count 1110
Iterating global reduction 1 with 5 rules applied. Total rules applied 171 place count 866 transition count 1110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 172 place count 866 transition count 1109
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 175 place count 863 transition count 1106
Iterating global reduction 2 with 3 rules applied. Total rules applied 178 place count 863 transition count 1106
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 181 place count 860 transition count 1103
Iterating global reduction 2 with 3 rules applied. Total rules applied 184 place count 860 transition count 1103
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 186 place count 858 transition count 1101
Iterating global reduction 2 with 2 rules applied. Total rules applied 188 place count 858 transition count 1101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 190 place count 856 transition count 1099
Iterating global reduction 2 with 2 rules applied. Total rules applied 192 place count 856 transition count 1099
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 193 place count 855 transition count 1098
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 855 transition count 1098
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 195 place count 854 transition count 1097
Iterating global reduction 2 with 1 rules applied. Total rules applied 196 place count 854 transition count 1097
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 197 place count 853 transition count 1096
Iterating global reduction 2 with 1 rules applied. Total rules applied 198 place count 853 transition count 1096
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 199 place count 852 transition count 1095
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 852 transition count 1095
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 201 place count 851 transition count 1094
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 851 transition count 1094
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 203 place count 850 transition count 1093
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 850 transition count 1093
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 205 place count 849 transition count 1092
Iterating global reduction 2 with 1 rules applied. Total rules applied 206 place count 849 transition count 1092
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 207 place count 848 transition count 1091
Iterating global reduction 2 with 1 rules applied. Total rules applied 208 place count 848 transition count 1091
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 209 place count 848 transition count 1090
Applied a total of 209 rules in 530 ms. Remains 848 /951 variables (removed 103) and now considering 1090/1196 (removed 106) transitions.
// Phase 1: matrix 1090 rows 848 cols
[2024-05-29 12:28:44] [INFO ] Computed 5 invariants in 20 ms
[2024-05-29 12:28:44] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-29 12:28:44] [INFO ] Invariant cache hit.
[2024-05-29 12:28:45] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
Running 1089 sub problems to find dead transitions.
[2024-05-29 12:28:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/847 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 1 (OVERLAPS) 1/848 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
[2024-05-29 12:29:11] [INFO ] Deduced a trap composed of 314 places in 217 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 848/1938 variables, and 6 constraints, problems are : Problem set: 0 solved, 1089 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/848 constraints, PredecessorRefiner: 1089/1089 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1089 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/847 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 1 (OVERLAPS) 1/848 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/848 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
[2024-05-29 12:29:33] [INFO ] Deduced a trap composed of 307 places in 270 ms of which 5 ms to minimize.
[2024-05-29 12:29:34] [INFO ] Deduced a trap composed of 307 places in 214 ms of which 4 ms to minimize.
[2024-05-29 12:29:36] [INFO ] Deduced a trap composed of 323 places in 192 ms of which 3 ms to minimize.
[2024-05-29 12:29:38] [INFO ] Deduced a trap composed of 307 places in 199 ms of which 4 ms to minimize.
[2024-05-29 12:29:39] [INFO ] Deduced a trap composed of 311 places in 252 ms of which 4 ms to minimize.
[2024-05-29 12:29:39] [INFO ] Deduced a trap composed of 309 places in 192 ms of which 3 ms to minimize.
[2024-05-29 12:29:40] [INFO ] Deduced a trap composed of 316 places in 234 ms of which 4 ms to minimize.
[2024-05-29 12:29:40] [INFO ] Deduced a trap composed of 326 places in 192 ms of which 3 ms to minimize.
[2024-05-29 12:29:41] [INFO ] Deduced a trap composed of 315 places in 236 ms of which 4 ms to minimize.
[2024-05-29 12:29:41] [INFO ] Deduced a trap composed of 304 places in 178 ms of which 3 ms to minimize.
[2024-05-29 12:29:42] [INFO ] Deduced a trap composed of 305 places in 203 ms of which 3 ms to minimize.
[2024-05-29 12:29:44] [INFO ] Deduced a trap composed of 304 places in 205 ms of which 3 ms to minimize.
[2024-05-29 12:29:44] [INFO ] Deduced a trap composed of 303 places in 218 ms of which 3 ms to minimize.
[2024-05-29 12:29:45] [INFO ] Deduced a trap composed of 305 places in 275 ms of which 5 ms to minimize.
[2024-05-29 12:29:45] [INFO ] Deduced a trap composed of 304 places in 213 ms of which 4 ms to minimize.
SMT process timed out in 60502ms, After SMT, problems are : Problem set: 0 solved, 1089 unsolved
Search for dead transitions found 0 dead transitions in 60515ms
Starting structural reductions in LTL mode, iteration 1 : 848/951 places, 1090/1196 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61857 ms. Remains : 848/951 places, 1090/1196 transitions.
[2024-05-29 12:29:45] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:29:46] [INFO ] Flatten gal took : 32 ms
[2024-05-29 12:29:46] [INFO ] Input system was already deterministic with 1090 transitions.
[2024-05-29 12:29:46] [INFO ] Flatten gal took : 19 ms
[2024-05-29 12:29:46] [INFO ] Flatten gal took : 19 ms
[2024-05-29 12:29:46] [INFO ] Time to serialize gal into /tmp/CTLFireability14245763971191452879.gal : 4 ms
[2024-05-29 12:29:46] [INFO ] Time to serialize properties into /tmp/CTLFireability6228199328872870826.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14245763971191452879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6228199328872870826.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1.15338e+10,19.7574,500524,2,27043,5,1.51655e+06,6,0,4484,2.18409e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:30:16] [INFO ] Flatten gal took : 21 ms
[2024-05-29 12:30:16] [INFO ] Applying decomposition
[2024-05-29 12:30:16] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2358874416375971084.txt' '-o' '/tmp/graph2358874416375971084.bin' '-w' '/tmp/graph2358874416375971084.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2358874416375971084.bin' '-l' '-1' '-v' '-w' '/tmp/graph2358874416375971084.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:30:16] [INFO ] Decomposing Gal with order
[2024-05-29 12:30:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:30:16] [INFO ] Removed a total of 877 redundant transitions.
[2024-05-29 12:30:16] [INFO ] Flatten gal took : 39 ms
[2024-05-29 12:30:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2024-05-29 12:30:16] [INFO ] Time to serialize gal into /tmp/CTLFireability7702153412190353809.gal : 5 ms
[2024-05-29 12:30:16] [INFO ] Time to serialize properties into /tmp/CTLFireability6343948215507125043.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7702153412190353809.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6343948215507125043.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1.15338e+10,7.88986,284416,2495,15,490201,1100,1267,1.54533e+06,49,3826,0


Converting to forward existential form...Done !
original formula: ((A((i3.i0.i1.u38.p102==1) U !(EF((i14.u92.p307==1)))) * AX((AG((((i0.u3.p252==1)&&(i0.u87.p556==1))&&((i0.u174.p858==1)&&(i0.u261.p1160=...830
=> equivalent forward existential formula: ((([(FwdU((FwdU(Init,!(!(E(TRUE U (i14.u92.p307==1))))) * !((i3.i0.i1.u38.p102==1))),TRUE) * (i14.u92.p307==1))]...1229
Reverse transition relation is NOT exact ! Due to transitions t24, t77, t227, t261, t363, t416, t419, t453, t545, t602, t635, t722, t798, t799, t805, t808,...647
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 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 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
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
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 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 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
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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 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
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 951/951 places, 1196/1196 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 925 transition count 1170
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 925 transition count 1170
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 69 place count 908 transition count 1153
Iterating global reduction 0 with 17 rules applied. Total rules applied 86 place count 908 transition count 1153
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 99 place count 895 transition count 1140
Iterating global reduction 0 with 13 rules applied. Total rules applied 112 place count 895 transition count 1140
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 125 place count 882 transition count 1127
Iterating global reduction 0 with 13 rules applied. Total rules applied 138 place count 882 transition count 1127
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 149 place count 871 transition count 1116
Iterating global reduction 0 with 11 rules applied. Total rules applied 160 place count 871 transition count 1116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 161 place count 871 transition count 1115
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 171 place count 861 transition count 1105
Iterating global reduction 1 with 10 rules applied. Total rules applied 181 place count 861 transition count 1105
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 190 place count 852 transition count 1096
Iterating global reduction 1 with 9 rules applied. Total rules applied 199 place count 852 transition count 1096
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 200 place count 852 transition count 1095
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 207 place count 845 transition count 1088
Iterating global reduction 2 with 7 rules applied. Total rules applied 214 place count 845 transition count 1088
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 215 place count 845 transition count 1087
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 220 place count 840 transition count 1082
Iterating global reduction 3 with 5 rules applied. Total rules applied 225 place count 840 transition count 1082
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 230 place count 835 transition count 1077
Iterating global reduction 3 with 5 rules applied. Total rules applied 235 place count 835 transition count 1077
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 239 place count 831 transition count 1073
Iterating global reduction 3 with 4 rules applied. Total rules applied 243 place count 831 transition count 1073
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 244 place count 831 transition count 1072
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 247 place count 828 transition count 1069
Iterating global reduction 4 with 3 rules applied. Total rules applied 250 place count 828 transition count 1069
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 253 place count 825 transition count 1066
Iterating global reduction 4 with 3 rules applied. Total rules applied 256 place count 825 transition count 1066
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 259 place count 822 transition count 1063
Iterating global reduction 4 with 3 rules applied. Total rules applied 262 place count 822 transition count 1063
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 265 place count 819 transition count 1060
Iterating global reduction 4 with 3 rules applied. Total rules applied 268 place count 819 transition count 1060
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 271 place count 816 transition count 1057
Iterating global reduction 4 with 3 rules applied. Total rules applied 274 place count 816 transition count 1057
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 275 place count 816 transition count 1056
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 277 place count 814 transition count 1054
Iterating global reduction 5 with 2 rules applied. Total rules applied 279 place count 814 transition count 1054
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 281 place count 812 transition count 1052
Iterating global reduction 5 with 2 rules applied. Total rules applied 283 place count 812 transition count 1052
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 285 place count 810 transition count 1050
Iterating global reduction 5 with 2 rules applied. Total rules applied 287 place count 810 transition count 1050
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 289 place count 808 transition count 1048
Iterating global reduction 5 with 2 rules applied. Total rules applied 291 place count 808 transition count 1048
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 292 place count 808 transition count 1047
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 293 place count 807 transition count 1046
Iterating global reduction 6 with 1 rules applied. Total rules applied 294 place count 807 transition count 1046
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 295 place count 807 transition count 1045
Applied a total of 295 rules in 384 ms. Remains 807 /951 variables (removed 144) and now considering 1045/1196 (removed 151) transitions.
// Phase 1: matrix 1045 rows 807 cols
[2024-05-29 12:30:46] [INFO ] Computed 5 invariants in 14 ms
[2024-05-29 12:30:47] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-29 12:30:47] [INFO ] Invariant cache hit.
[2024-05-29 12:30:47] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
Running 1044 sub problems to find dead transitions.
[2024-05-29 12:30:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/806 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
At refinement iteration 1 (OVERLAPS) 1/807 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
[2024-05-29 12:31:11] [INFO ] Deduced a trap composed of 292 places in 216 ms of which 5 ms to minimize.
[2024-05-29 12:31:12] [INFO ] Deduced a trap composed of 291 places in 229 ms of which 4 ms to minimize.
[2024-05-29 12:31:12] [INFO ] Deduced a trap composed of 305 places in 232 ms of which 4 ms to minimize.
[2024-05-29 12:31:12] [INFO ] Deduced a trap composed of 299 places in 194 ms of which 3 ms to minimize.
[2024-05-29 12:31:13] [INFO ] Deduced a trap composed of 293 places in 225 ms of which 5 ms to minimize.
[2024-05-29 12:31:14] [INFO ] Deduced a trap composed of 309 places in 224 ms of which 4 ms to minimize.
[2024-05-29 12:31:14] [INFO ] Deduced a trap composed of 297 places in 212 ms of which 4 ms to minimize.
[2024-05-29 12:31:14] [INFO ] Deduced a trap composed of 297 places in 219 ms of which 4 ms to minimize.
[2024-05-29 12:31:16] [INFO ] Deduced a trap composed of 295 places in 231 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 807/1852 variables, and 14 constraints, problems are : Problem set: 0 solved, 1044 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/807 constraints, PredecessorRefiner: 1044/1044 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1044 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/806 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
At refinement iteration 1 (OVERLAPS) 1/807 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/807 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
[2024-05-29 12:31:30] [INFO ] Deduced a trap composed of 291 places in 175 ms of which 3 ms to minimize.
[2024-05-29 12:31:40] [INFO ] Deduced a trap composed of 299 places in 211 ms of which 3 ms to minimize.
[2024-05-29 12:31:41] [INFO ] Deduced a trap composed of 292 places in 197 ms of which 3 ms to minimize.
[2024-05-29 12:31:41] [INFO ] Deduced a trap composed of 304 places in 174 ms of which 3 ms to minimize.
[2024-05-29 12:31:42] [INFO ] Deduced a trap composed of 301 places in 194 ms of which 4 ms to minimize.
[2024-05-29 12:31:42] [INFO ] Deduced a trap composed of 308 places in 260 ms of which 4 ms to minimize.
[2024-05-29 12:31:42] [INFO ] Deduced a trap composed of 308 places in 207 ms of which 3 ms to minimize.
[2024-05-29 12:31:43] [INFO ] Deduced a trap composed of 304 places in 212 ms of which 4 ms to minimize.
[2024-05-29 12:31:46] [INFO ] Deduced a trap composed of 294 places in 218 ms of which 4 ms to minimize.
[2024-05-29 12:31:46] [INFO ] Deduced a trap composed of 298 places in 230 ms of which 3 ms to minimize.
[2024-05-29 12:31:47] [INFO ] Deduced a trap composed of 299 places in 197 ms of which 3 ms to minimize.
[2024-05-29 12:31:47] [INFO ] Deduced a trap composed of 302 places in 234 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 807/1852 variables, and 26 constraints, problems are : Problem set: 0 solved, 1044 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/807 constraints, PredecessorRefiner: 0/1044 constraints, Known Traps: 21/21 constraints]
After SMT, in 60394ms problems are : Problem set: 0 solved, 1044 unsolved
Search for dead transitions found 0 dead transitions in 60405ms
Starting structural reductions in LTL mode, iteration 1 : 807/951 places, 1045/1196 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61498 ms. Remains : 807/951 places, 1045/1196 transitions.
[2024-05-29 12:31:47] [INFO ] Flatten gal took : 18 ms
[2024-05-29 12:31:48] [INFO ] Flatten gal took : 19 ms
[2024-05-29 12:31:48] [INFO ] Input system was already deterministic with 1045 transitions.
[2024-05-29 12:31:48] [INFO ] Flatten gal took : 19 ms
[2024-05-29 12:31:48] [INFO ] Flatten gal took : 19 ms
[2024-05-29 12:31:48] [INFO ] Time to serialize gal into /tmp/CTLFireability2375390187831143150.gal : 4 ms
[2024-05-29 12:31:48] [INFO ] Time to serialize properties into /tmp/CTLFireability6036461462734029684.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2375390187831143150.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6036461462734029684.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1.0002e+10,19.8881,464744,2,26055,5,1.38936e+06,6,0,4275,2.0386e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:32:18] [INFO ] Flatten gal took : 21 ms
[2024-05-29 12:32:18] [INFO ] Applying decomposition
[2024-05-29 12:32:18] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11467782660580542406.txt' '-o' '/tmp/graph11467782660580542406.bin' '-w' '/tmp/graph11467782660580542406.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11467782660580542406.bin' '-l' '-1' '-v' '-w' '/tmp/graph11467782660580542406.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:32:18] [INFO ] Decomposing Gal with order
[2024-05-29 12:32:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:32:18] [INFO ] Removed a total of 864 redundant transitions.
[2024-05-29 12:32:18] [INFO ] Flatten gal took : 34 ms
[2024-05-29 12:32:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-29 12:32:18] [INFO ] Time to serialize gal into /tmp/CTLFireability3640004027863624976.gal : 5 ms
[2024-05-29 12:32:18] [INFO ] Time to serialize properties into /tmp/CTLFireability10135168916446178915.ctl : 54 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3640004027863624976.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10135168916446178915.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1.0002e+10,10.7257,316396,2355,15,570952,884,1255,1.60287e+06,42,2865,0


Converting to forward existential form...Done !
original formula: E(((!(EX(E((i5.u66.p248==1) U (i2.u34.p98==1)))) * EF((i4.u8.p24==1))) * ((i16.u142.p474!=1)||((i9.u86.p309==1)&&((i13.u121.p407==1)||(((...266
=> equivalent forward existential formula: [(FwdU(Init,((!(EX(E((i5.u66.p248==1) U (i2.u34.p98==1)))) * E(TRUE U (i4.u8.p24==1))) * ((i16.u142.p474!=1)||((...318
Reverse transition relation is NOT exact ! Due to transitions t77, t160, t250, t332, t333, t389, t423, t445, t514, t515, t572, t573, t606, t692, t768, t769...589
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 951/951 places, 1196/1196 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 924 transition count 1169
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 924 transition count 1169
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 74 place count 904 transition count 1149
Iterating global reduction 0 with 20 rules applied. Total rules applied 94 place count 904 transition count 1149
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 110 place count 888 transition count 1133
Iterating global reduction 0 with 16 rules applied. Total rules applied 126 place count 888 transition count 1133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 127 place count 888 transition count 1132
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 141 place count 874 transition count 1118
Iterating global reduction 1 with 14 rules applied. Total rules applied 155 place count 874 transition count 1118
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 167 place count 862 transition count 1106
Iterating global reduction 1 with 12 rules applied. Total rules applied 179 place count 862 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 180 place count 862 transition count 1105
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 191 place count 851 transition count 1094
Iterating global reduction 2 with 11 rules applied. Total rules applied 202 place count 851 transition count 1094
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 212 place count 841 transition count 1084
Iterating global reduction 2 with 10 rules applied. Total rules applied 222 place count 841 transition count 1084
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 223 place count 841 transition count 1083
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 231 place count 833 transition count 1075
Iterating global reduction 3 with 8 rules applied. Total rules applied 239 place count 833 transition count 1075
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 240 place count 833 transition count 1074
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 246 place count 827 transition count 1068
Iterating global reduction 4 with 6 rules applied. Total rules applied 252 place count 827 transition count 1068
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 258 place count 821 transition count 1062
Iterating global reduction 4 with 6 rules applied. Total rules applied 264 place count 821 transition count 1062
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 269 place count 816 transition count 1057
Iterating global reduction 4 with 5 rules applied. Total rules applied 274 place count 816 transition count 1057
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 275 place count 816 transition count 1056
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 279 place count 812 transition count 1052
Iterating global reduction 5 with 4 rules applied. Total rules applied 283 place count 812 transition count 1052
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 286 place count 809 transition count 1049
Iterating global reduction 5 with 3 rules applied. Total rules applied 289 place count 809 transition count 1049
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 291 place count 807 transition count 1047
Iterating global reduction 5 with 2 rules applied. Total rules applied 293 place count 807 transition count 1047
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 295 place count 805 transition count 1045
Iterating global reduction 5 with 2 rules applied. Total rules applied 297 place count 805 transition count 1045
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 299 place count 803 transition count 1043
Iterating global reduction 5 with 2 rules applied. Total rules applied 301 place count 803 transition count 1043
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 302 place count 803 transition count 1042
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 303 place count 802 transition count 1041
Iterating global reduction 6 with 1 rules applied. Total rules applied 304 place count 802 transition count 1041
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 305 place count 801 transition count 1040
Iterating global reduction 6 with 1 rules applied. Total rules applied 306 place count 801 transition count 1040
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 307 place count 800 transition count 1039
Iterating global reduction 6 with 1 rules applied. Total rules applied 308 place count 800 transition count 1039
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 309 place count 799 transition count 1038
Iterating global reduction 6 with 1 rules applied. Total rules applied 310 place count 799 transition count 1038
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 311 place count 799 transition count 1037
Applied a total of 311 rules in 378 ms. Remains 799 /951 variables (removed 152) and now considering 1037/1196 (removed 159) transitions.
// Phase 1: matrix 1037 rows 799 cols
[2024-05-29 12:32:48] [INFO ] Computed 5 invariants in 8 ms
[2024-05-29 12:32:48] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-29 12:32:48] [INFO ] Invariant cache hit.
[2024-05-29 12:32:49] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Running 1036 sub problems to find dead transitions.
[2024-05-29 12:32:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/798 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 1 (OVERLAPS) 1/799 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-05-29 12:33:13] [INFO ] Deduced a trap composed of 291 places in 175 ms of which 3 ms to minimize.
[2024-05-29 12:33:13] [INFO ] Deduced a trap composed of 305 places in 174 ms of which 3 ms to minimize.
[2024-05-29 12:33:19] [INFO ] Deduced a trap composed of 301 places in 187 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 799/1836 variables, and 8 constraints, problems are : Problem set: 0 solved, 1036 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/799 constraints, PredecessorRefiner: 1036/1036 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1036 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/798 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 1 (OVERLAPS) 1/799 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/799 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-05-29 12:33:39] [INFO ] Deduced a trap composed of 300 places in 228 ms of which 4 ms to minimize.
[2024-05-29 12:33:43] [INFO ] Deduced a trap composed of 299 places in 181 ms of which 3 ms to minimize.
[2024-05-29 12:33:44] [INFO ] Deduced a trap composed of 293 places in 182 ms of which 4 ms to minimize.
[2024-05-29 12:33:47] [INFO ] Deduced a trap composed of 292 places in 189 ms of which 3 ms to minimize.
[2024-05-29 12:33:47] [INFO ] Deduced a trap composed of 299 places in 196 ms of which 4 ms to minimize.
[2024-05-29 12:33:48] [INFO ] Deduced a trap composed of 297 places in 227 ms of which 4 ms to minimize.
[2024-05-29 12:33:48] [INFO ] Deduced a trap composed of 299 places in 182 ms of which 4 ms to minimize.
[2024-05-29 12:33:48] [INFO ] Deduced a trap composed of 301 places in 226 ms of which 4 ms to minimize.
[2024-05-29 12:33:48] [INFO ] Deduced a trap composed of 299 places in 226 ms of which 4 ms to minimize.
[2024-05-29 12:33:49] [INFO ] Deduced a trap composed of 297 places in 211 ms of which 4 ms to minimize.
[2024-05-29 12:33:49] [INFO ] Deduced a trap composed of 292 places in 217 ms of which 4 ms to minimize.
[2024-05-29 12:33:49] [INFO ] Deduced a trap composed of 293 places in 226 ms of which 4 ms to minimize.
[2024-05-29 12:33:49] [INFO ] Deduced a trap composed of 301 places in 190 ms of which 4 ms to minimize.
SMT process timed out in 60516ms, After SMT, problems are : Problem set: 0 solved, 1036 unsolved
Search for dead transitions found 0 dead transitions in 60526ms
Starting structural reductions in LTL mode, iteration 1 : 799/951 places, 1037/1196 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61575 ms. Remains : 799/951 places, 1037/1196 transitions.
[2024-05-29 12:33:50] [INFO ] Flatten gal took : 18 ms
[2024-05-29 12:33:50] [INFO ] Flatten gal took : 18 ms
[2024-05-29 12:33:50] [INFO ] Input system was already deterministic with 1037 transitions.
[2024-05-29 12:33:50] [INFO ] Flatten gal took : 19 ms
[2024-05-29 12:33:50] [INFO ] Flatten gal took : 18 ms
[2024-05-29 12:33:50] [INFO ] Time to serialize gal into /tmp/CTLFireability16861032528058408001.gal : 4 ms
[2024-05-29 12:33:50] [INFO ] Time to serialize properties into /tmp/CTLFireability9842799991587985967.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16861032528058408001.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9842799991587985967.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,9.80455e+09,21.0774,455576,2,25298,5,1.38404e+06,6,0,4235,2.00173e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:34:20] [INFO ] Flatten gal took : 24 ms
[2024-05-29 12:34:20] [INFO ] Applying decomposition
[2024-05-29 12:34:20] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph761855585518239873.txt' '-o' '/tmp/graph761855585518239873.bin' '-w' '/tmp/graph761855585518239873.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph761855585518239873.bin' '-l' '-1' '-v' '-w' '/tmp/graph761855585518239873.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:34:20] [INFO ] Decomposing Gal with order
[2024-05-29 12:34:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:34:20] [INFO ] Removed a total of 859 redundant transitions.
[2024-05-29 12:34:20] [INFO ] Flatten gal took : 38 ms
[2024-05-29 12:34:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 14 ms.
[2024-05-29 12:34:20] [INFO ] Time to serialize gal into /tmp/CTLFireability6688221593168102382.gal : 6 ms
[2024-05-29 12:34:20] [INFO ] Time to serialize properties into /tmp/CTLFireability411319883277229492.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6688221593168102382.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability411319883277229492.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,9.80455e+09,10.473,319252,2440,21,559581,910,1271,1.71992e+06,60,3024,0


Converting to forward existential form...Done !
original formula: (EX(AF(AG(((i17.u10.p26==0)||(i14.i1.i1.u326.p1214==0))))) + AX((((AF((i29.u253.p928==0)) * (i22.u206.p725==1)) * (i14.i1.i1.u224.p804==0...181
=> equivalent forward existential formula: (([FwdG((EY((Init * !(EX(!(EG(!(!(E(TRUE U !(((i17.u10.p26==0)||(i14.i1.i1.u326.p1214==0)))))))))))) * !((i17.u1...520
Reverse transition relation is NOT exact ! Due to transitions t77, t160, t250, t340, t396, t430, t513, t569, t602, t685, t761, t762, t765, t768, t771, t772...615
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 951/951 places, 1196/1196 transitions.
Graph (trivial) has 912 edges and 951 vertex of which 69 / 951 are part of one of the 12 SCC in 2 ms
Free SCC test removed 57 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 638 transitions
Trivial Post-agglo rules discarded 638 transitions
Performed 638 trivial Post agglomeration. Transition count delta: 638
Iterating post reduction 0 with 638 rules applied. Total rules applied 639 place count 893 transition count 494
Reduce places removed 638 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 647 rules applied. Total rules applied 1286 place count 255 transition count 485
Reduce places removed 4 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 2 with 20 rules applied. Total rules applied 1306 place count 251 transition count 469
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 18 rules applied. Total rules applied 1324 place count 235 transition count 467
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1325 place count 234 transition count 467
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 46 Pre rules applied. Total rules applied 1325 place count 234 transition count 421
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 1417 place count 188 transition count 421
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1433 place count 172 transition count 405
Iterating global reduction 5 with 16 rules applied. Total rules applied 1449 place count 172 transition count 405
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1455 place count 166 transition count 399
Iterating global reduction 5 with 6 rules applied. Total rules applied 1461 place count 166 transition count 399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1462 place count 166 transition count 398
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1465 place count 163 transition count 395
Iterating global reduction 6 with 3 rules applied. Total rules applied 1468 place count 163 transition count 395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1469 place count 163 transition count 394
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1471 place count 161 transition count 392
Iterating global reduction 7 with 2 rules applied. Total rules applied 1473 place count 161 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1474 place count 161 transition count 391
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 8 with 56 rules applied. Total rules applied 1530 place count 133 transition count 363
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1536 place count 133 transition count 357
Discarding 23 places :
Symmetric choice reduction at 9 with 23 rule applications. Total rules 1559 place count 110 transition count 210
Iterating global reduction 9 with 23 rules applied. Total rules applied 1582 place count 110 transition count 210
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1592 place count 110 transition count 200
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 1603 place count 99 transition count 187
Iterating global reduction 10 with 11 rules applied. Total rules applied 1614 place count 99 transition count 187
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 1625 place count 88 transition count 174
Iterating global reduction 10 with 11 rules applied. Total rules applied 1636 place count 88 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1640 place count 88 transition count 170
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 11 with 2 rules applied. Total rules applied 1642 place count 87 transition count 169
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1643 place count 86 transition count 163
Iterating global reduction 11 with 1 rules applied. Total rules applied 1644 place count 86 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1645 place count 86 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 12 with 6 rules applied. Total rules applied 1651 place count 86 transition count 156
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 12 with 12 rules applied. Total rules applied 1663 place count 80 transition count 150
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 1665 place count 80 transition count 150
Applied a total of 1665 rules in 51 ms. Remains 80 /951 variables (removed 871) and now considering 150/1196 (removed 1046) transitions.
[2024-05-29 12:34:50] [INFO ] Flow matrix only has 144 transitions (discarded 6 similar events)
// Phase 1: matrix 144 rows 80 cols
[2024-05-29 12:34:50] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:34:50] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 12:34:50] [INFO ] Flow matrix only has 144 transitions (discarded 6 similar events)
[2024-05-29 12:34:50] [INFO ] Invariant cache hit.
[2024-05-29 12:34:50] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 12:34:50] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-05-29 12:34:50] [INFO ] Redundant transitions in 1 ms returned []
Running 146 sub problems to find dead transitions.
[2024-05-29 12:34:50] [INFO ] Flow matrix only has 144 transitions (discarded 6 similar events)
[2024-05-29 12:34:50] [INFO ] Invariant cache hit.
[2024-05-29 12:34:50] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-29 12:34:51] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:34:51] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:34:51] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:34:51] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-05-29 12:34:51] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:34:51] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:34:51] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:34:51] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:34:51] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:34:51] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:34:51] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:34:51] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:34:51] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:34:51] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:34:51] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:34:51] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:34:52] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:34:52] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:34:52] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:34:52] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-29 12:34:52] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-05-29 12:34:52] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-29 12:34:52] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:34:52] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 143/223 variables, 80/106 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 14/120 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 1/224 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/224 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 121 constraints, problems are : Problem set: 0 solved, 146 unsolved in 6034 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-29 12:34:57] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-29 12:34:57] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:34:57] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-29 12:34:57] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 143/223 variables, 80/110 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 14/124 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 146/270 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-29 12:35:00] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
[2024-05-29 12:35:00] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 13 (OVERLAPS) 1/224 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-29 12:35:05] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/224 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/224 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 16 (OVERLAPS) 0/224 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 274 constraints, problems are : Problem set: 0 solved, 146 unsolved in 15331 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 31/31 constraints]
After SMT, in 21408ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 21409ms
Starting structural reductions in SI_CTL mode, iteration 1 : 80/951 places, 150/1196 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21622 ms. Remains : 80/951 places, 150/1196 transitions.
[2024-05-29 12:35:12] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:35:12] [INFO ] Flatten gal took : 10 ms
[2024-05-29 12:35:12] [INFO ] Input system was already deterministic with 150 transitions.
[2024-05-29 12:35:12] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:35:12] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:35:12] [INFO ] Time to serialize gal into /tmp/CTLFireability17330235238203155127.gal : 1 ms
[2024-05-29 12:35:12] [INFO ] Time to serialize properties into /tmp/CTLFireability823669206046301454.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17330235238203155127.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability823669206046301454.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,121998,0.279307,15748,2,3716,5,42586,6,0,463,40804,0


Converting to forward existential form...Done !
original formula: AG(!(A((((E((p873==1) U (p120==1)) + (p254!=1)) + (((p607==1)&&(p618==1))||(p84==1))) + (p298==1)) U ((!((p950==1)||(p250==1)))&&(p135==1...160
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(((!((p950==1)||(p250==1)))&&(p135==1)))))) * !(E(!(((!((p950==1)||(p250==1)))&&(p135...316
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t12, t13, t14, t18, t21, t22, t23, t28, t31, t40, t64, t65, t66, t77, t79, t82, t...339
(forward)formula 0,0,21.7525,628904,1,0,738,4.07024e+06,324,343,3911,3.01119e+06,821
FORMULA StigmergyCommit-PT-03b-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-29 12:35:34] [INFO ] Flatten gal took : 21 ms
[2024-05-29 12:35:34] [INFO ] Flatten gal took : 23 ms
[2024-05-29 12:35:34] [INFO ] Applying decomposition
[2024-05-29 12:35:34] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9476918151389680469.txt' '-o' '/tmp/graph9476918151389680469.bin' '-w' '/tmp/graph9476918151389680469.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9476918151389680469.bin' '-l' '-1' '-v' '-w' '/tmp/graph9476918151389680469.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:35:34] [INFO ] Decomposing Gal with order
[2024-05-29 12:35:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:35:34] [INFO ] Removed a total of 886 redundant transitions.
[2024-05-29 12:35:34] [INFO ] Flatten gal took : 40 ms
[2024-05-29 12:35:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-05-29 12:35:34] [INFO ] Time to serialize gal into /tmp/CTLFireability1294175325824201974.gal : 6 ms
[2024-05-29 12:35:34] [INFO ] Time to serialize properties into /tmp/CTLFireability7163928095839821155.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1294175325824201974.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7163928095839821155.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 8 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.60446e+10,9.05551,312796,3065,23,547355,1525,1448,1.66348e+06,65,5760,0


Converting to forward existential form...Done !
original formula: EG(E(((EG(AX((i6.u57.p174==1))) * (i42.u163.p500==1)) * (i42.u383.p1229==1)) U (E(AF((i33.u291.p923==1)) U (i20.u124.p382==1)) + (!((((i2...288
=> equivalent forward existential formula: [FwdG(Init,E(((EG(!(EX(!((i6.u57.p174==1))))) * (i42.u163.p500==1)) * (i42.u383.p1229==1)) U (E(!(EG(!((i33.u291...349
Reverse transition relation is NOT exact ! Due to transitions t17, t26, t81, t135, t191, t249, t282, t389, t443, t446, t524, t597, t656, t657, t693, t745, ...638
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 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 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
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
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
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
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
(forward)formula 0,1,1521.38,6318740,1,0,4.60435e+06,1857,3509,7.17754e+07,125,9147,1307648
FORMULA StigmergyCommit-PT-03b-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2024-05-29 13:02:44] [INFO ] Applying decomposition
[2024-05-29 13:02:44] [INFO ] Flatten gal took : 23 ms
[2024-05-29 13:02:44] [INFO ] Decomposing Gal with order
[2024-05-29 13:02:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:02:44] [INFO ] Removed a total of 755 redundant transitions.
[2024-05-29 13:02:44] [INFO ] Flatten gal took : 46 ms
[2024-05-29 13:02:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 276 labels/synchronizations in 4 ms.
[2024-05-29 13:02:44] [INFO ] Time to serialize gal into /tmp/CTLFireability5581409280839484089.gal : 4 ms
[2024-05-29 13:02:44] [INFO ] Time to serialize properties into /tmp/CTLFireability2745710273449021277.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5581409280839484089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2745710273449021277.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 7 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.60446e+10,3.14086,88228,112,6275,8670,197236,140,31207,1884,1.21266e+06,0


Converting to forward existential form...Done !
original formula: E(AG(!((EG(AX((u8.p1215==1))) * AG(A((((i0.i0.i0.u4.p139==1)&&(i0.i0.i0.u5.p396==1))&&((i0.i0.u6.p698==1)&&(i0.u7.p1022==1))) U (i0.i0.u6...189
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(!((EG(!(EX(!((u8.p1215==1))))) * !(E(TRUE U !(!((E(!((i0.i0.u6.p775==1)) U (!((((i0.i0....330
Reverse transition relation is NOT exact ! Due to transitions t879, i0.u7.t81, i0.u7.t84, i0.u7.t110, i0.u7.t125, i0.u7.t135, i0.u7.t189, i0.u7.t190, i0.u7...919
ITS-tools command line returned an error code 137
[2024-05-29 13:12:01] [INFO ] Flatten gal took : 24 ms
[2024-05-29 13:12:01] [INFO ] Input system was already deterministic with 1196 transitions.
[2024-05-29 13:12:01] [INFO ] Transformed 951 places.
[2024-05-29 13:12:01] [INFO ] Transformed 1196 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 13:12:01] [INFO ] Time to serialize gal into /tmp/CTLFireability778306874249475778.gal : 3 ms
[2024-05-29 13:12:01] [INFO ] Time to serialize properties into /tmp/CTLFireability3283190515880135993.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability778306874249475778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3283190515880135993.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...327
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 7 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.60446e+10,25.9524,622068,2,47698,5,2.27257e+06,6,0,5002,1.02667e+06,0


Converting to forward existential form...Done !

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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-03b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-03b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690531600114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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