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-171690531600113.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531600113
=====================================================================

--------------------
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-CTLCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2023-12
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2023-14
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716984829090

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 12:13:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 12:13:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:13:50] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2024-05-29 12:13:50] [INFO ] Transformed 1231 places.
[2024-05-29 12:13:50] [INFO ] Transformed 1476 transitions.
[2024-05-29 12:13:50] [INFO ] Found NUPN structural information;
[2024-05-29 12:13:50] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyCommit-PT-03b-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 118 out of 1231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 87 place count 1144 transition count 1389
Iterating global reduction 0 with 87 rules applied. Total rules applied 174 place count 1144 transition count 1389
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 221 place count 1097 transition count 1342
Iterating global reduction 0 with 47 rules applied. Total rules applied 268 place count 1097 transition count 1342
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 293 place count 1072 transition count 1317
Iterating global reduction 0 with 25 rules applied. Total rules applied 318 place count 1072 transition count 1317
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 339 place count 1051 transition count 1296
Iterating global reduction 0 with 21 rules applied. Total rules applied 360 place count 1051 transition count 1296
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 378 place count 1033 transition count 1278
Iterating global reduction 0 with 18 rules applied. Total rules applied 396 place count 1033 transition count 1278
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 413 place count 1016 transition count 1261
Iterating global reduction 0 with 17 rules applied. Total rules applied 430 place count 1016 transition count 1261
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 446 place count 1000 transition count 1245
Iterating global reduction 0 with 16 rules applied. Total rules applied 462 place count 1000 transition count 1245
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 475 place count 987 transition count 1232
Iterating global reduction 0 with 13 rules applied. Total rules applied 488 place count 987 transition count 1232
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 496 place count 979 transition count 1224
Iterating global reduction 0 with 8 rules applied. Total rules applied 504 place count 979 transition count 1224
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 509 place count 974 transition count 1219
Iterating global reduction 0 with 5 rules applied. Total rules applied 514 place count 974 transition count 1219
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 517 place count 971 transition count 1216
Iterating global reduction 0 with 3 rules applied. Total rules applied 520 place count 971 transition count 1216
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 522 place count 969 transition count 1214
Iterating global reduction 0 with 2 rules applied. Total rules applied 524 place count 969 transition count 1214
Applied a total of 524 rules in 903 ms. Remains 969 /1231 variables (removed 262) and now considering 1214/1476 (removed 262) transitions.
// Phase 1: matrix 1214 rows 969 cols
[2024-05-29 12:13:51] [INFO ] Computed 5 invariants in 32 ms
[2024-05-29 12:13:52] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-05-29 12:13:52] [INFO ] Invariant cache hit.
[2024-05-29 12:13:52] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
Running 1213 sub problems to find dead transitions.
[2024-05-29 12:13:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/968 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
SMT process timed out in 30648ms, After SMT, problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 30676ms
Starting structural reductions in LTL mode, iteration 1 : 969/1231 places, 1214/1476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32780 ms. Remains : 969/1231 places, 1214/1476 transitions.
Support contains 118 out of 969 places after structural reductions.
[2024-05-29 12:14:23] [INFO ] Flatten gal took : 103 ms
[2024-05-29 12:14:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA StigmergyCommit-PT-03b-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 12:14:23] [INFO ] Flatten gal took : 61 ms
[2024-05-29 12:14:23] [INFO ] Input system was already deterministic with 1214 transitions.
Support contains 108 out of 969 places (down from 118) after GAL structural reductions.
RANDOM walk for 40000 steps (513 resets) in 2015 ms. (19 steps per ms) remains 41/63 properties
BEST_FIRST walk for 4002 steps (11 resets) in 56 ms. (70 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (9 resets) in 30 ms. (129 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (12 resets) in 61 ms. (64 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (10 resets) in 51 ms. (77 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (9 resets) in 30 ms. (129 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (9 resets) in 35 ms. (111 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (9 resets) in 33 ms. (117 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (10 resets) in 36 ms. (108 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (10 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (11 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (10 resets) in 41 ms. (95 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (9 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (10 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (11 resets) in 25 ms. (153 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (10 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (10 resets) in 21 ms. (182 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (10 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (11 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (11 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (11 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (10 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (10 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (12 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (10 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (9 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
[2024-05-29 12:14:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 899/969 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-29 12:14:25] [INFO ] Deduced a trap composed of 350 places in 393 ms of which 52 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/969 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-29 12:14:26] [INFO ] Deduced a trap composed of 340 places in 478 ms of which 7 ms to minimize.
[2024-05-29 12:14:27] [INFO ] Deduced a trap composed of 346 places in 294 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/969 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-29 12:14:28] [INFO ] Deduced a trap composed of 351 places in 210 ms of which 4 ms to minimize.
[2024-05-29 12:14:28] [INFO ] Deduced a trap composed of 330 places in 303 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/969 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-29 12:14:29] [INFO ] Deduced a trap composed of 433 places in 335 ms of which 5 ms to minimize.
[2024-05-29 12:14:30] [INFO ] Deduced a trap composed of 323 places in 261 ms of which 6 ms to minimize.
[2024-05-29 12:14:30] [INFO ] Deduced a trap composed of 325 places in 278 ms of which 5 ms to minimize.
SMT process timed out in 5259ms, After SMT, problems are : Problem set: 0 solved, 41 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 70 out of 969 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 969/969 places, 1214/1214 transitions.
Graph (trivial) has 840 edges and 969 vertex of which 50 / 969 are part of one of the 9 SCC in 6 ms
Free SCC test removed 41 places
Drop transitions (Empty/Sink Transition effects.) removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Graph (complete) has 1414 edges and 928 vertex of which 925 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 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 582 transitions
Trivial Post-agglo rules discarded 582 transitions
Performed 582 trivial Post agglomeration. Transition count delta: 582
Iterating post reduction 0 with 584 rules applied. Total rules applied 586 place count 925 transition count 576
Reduce places removed 582 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 593 rules applied. Total rules applied 1179 place count 343 transition count 565
Reduce places removed 5 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 2 with 29 rules applied. Total rules applied 1208 place count 338 transition count 541
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 28 rules applied. Total rules applied 1236 place count 314 transition count 537
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1238 place count 312 transition count 537
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 48 Pre rules applied. Total rules applied 1238 place count 312 transition count 489
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 1334 place count 264 transition count 489
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1335 place count 263 transition count 488
Iterating global reduction 5 with 1 rules applied. Total rules applied 1336 place count 263 transition count 488
Performed 36 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 1408 place count 227 transition count 451
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 1422 place count 213 transition count 333
Iterating global reduction 5 with 14 rules applied. Total rules applied 1436 place count 213 transition count 333
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1443 place count 213 transition count 326
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1447 place count 209 transition count 322
Iterating global reduction 6 with 4 rules applied. Total rules applied 1451 place count 209 transition count 322
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1455 place count 205 transition count 318
Iterating global reduction 6 with 4 rules applied. Total rules applied 1459 place count 205 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1460 place count 205 transition count 317
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 7 with 12 rules applied. Total rules applied 1472 place count 199 transition count 311
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1478 place count 196 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 1480 place count 196 transition count 319
Free-agglomeration rule applied 40 times.
Iterating global reduction 7 with 40 rules applied. Total rules applied 1520 place count 196 transition count 279
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 7 with 40 rules applied. Total rules applied 1560 place count 156 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 8 with 22 rules applied. Total rules applied 1582 place count 156 transition count 257
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1588 place count 156 transition count 257
Applied a total of 1588 rules in 193 ms. Remains 156 /969 variables (removed 813) and now considering 257/1214 (removed 957) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 156/969 places, 257/1214 transitions.
RANDOM walk for 40000 steps (765 resets) in 898 ms. (44 steps per ms) remains 11/41 properties
BEST_FIRST walk for 40003 steps (92 resets) in 198 ms. (201 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (245 resets) in 138 ms. (287 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (295 resets) in 104 ms. (380 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (293 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (256 resets) in 113 ms. (350 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (295 resets) in 55 ms. (714 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (201 resets) in 139 ms. (285 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (295 resets) in 39 ms. (1000 steps per ms) remains 4/7 properties
// Phase 1: matrix 257 rows 156 cols
[2024-05-29 12:14:31] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 12:14:31] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 108/121 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/124 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 236/360 variables, 124/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 22/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 35/395 variables, 21/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 31/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 13/408 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 4/412 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/413 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/413 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/413 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 213 constraints, problems are : Problem set: 0 solved, 4 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 156/156 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 108/121 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 12:14:31] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-05-29 12:14:31] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:14:31] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:14:31] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
Problem AtomicPropp33 is UNSAT
[2024-05-29 12:14:31] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 5/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 3/124 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 236/360 variables, 124/133 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 22/155 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-29 12:14:32] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 1/156 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 35/395 variables, 21/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/395 variables, 31/208 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 3/211 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 0/211 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 13/408 variables, 8/219 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 0/219 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 4/412 variables, 2/221 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/412 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 18 (OVERLAPS) 1/413 variables, 1/222 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-29 12:14:32] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-29 12:14:32] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
Problem AtomicPropp53 is UNSAT
At refinement iteration 19 (INCLUDED_ONLY) 0/413 variables, 2/224 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/413 variables, 0/224 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/413 variables, 0/224 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 224 constraints, problems are : Problem set: 3 solved, 1 unsolved in 776 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 156/156 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 8/8 constraints]
After SMT, in 1041ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 257/257 transitions.
Graph (trivial) has 121 edges and 156 vertex of which 10 / 156 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 364 edges and 151 vertex of which 149 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 149 transition count 184
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 131 place count 89 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 88 transition count 177
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 132 place count 88 transition count 172
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 142 place count 83 transition count 172
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 157 place count 68 transition count 157
Iterating global reduction 3 with 15 rules applied. Total rules applied 172 place count 68 transition count 157
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 177 place count 63 transition count 151
Iterating global reduction 3 with 5 rules applied. Total rules applied 182 place count 63 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 183 place count 63 transition count 150
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 186 place count 60 transition count 147
Iterating global reduction 4 with 3 rules applied. Total rules applied 189 place count 60 transition count 147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 190 place count 59 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 191 place count 59 transition count 146
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 4 with 12 rules applied. Total rules applied 203 place count 53 transition count 140
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 207 place count 53 transition count 136
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 218 place count 42 transition count 125
Iterating global reduction 5 with 11 rules applied. Total rules applied 229 place count 42 transition count 125
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 233 place count 38 transition count 121
Iterating global reduction 5 with 4 rules applied. Total rules applied 237 place count 38 transition count 121
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 241 place count 34 transition count 117
Iterating global reduction 5 with 4 rules applied. Total rules applied 245 place count 34 transition count 117
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 256 place count 34 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 258 place count 33 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 262 place count 33 transition count 110
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 7 with 21 rules applied. Total rules applied 283 place count 33 transition count 89
Free-agglomeration rule applied 6 times with reduction of 10 identical transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 289 place count 33 transition count 73
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 313 place count 27 transition count 55
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 314 place count 27 transition count 54
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 317 place count 26 transition count 52
Applied a total of 317 rules in 55 ms. Remains 26 /156 variables (removed 130) and now considering 52/257 (removed 205) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 26/156 places, 52/257 transitions.
RANDOM walk for 3229 steps (0 resets) in 10 ms. (293 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA StigmergyCommit-PT-03b-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 12:14:32] [INFO ] Flatten gal took : 49 ms
[2024-05-29 12:14:32] [INFO ] Flatten gal took : 50 ms
[2024-05-29 12:14:32] [INFO ] Input system was already deterministic with 1214 transitions.
Computed a total of 182 stabilizing places and 190 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 969/969 places, 1214/1214 transitions.
Graph (trivial) has 948 edges and 969 vertex of which 63 / 969 are part of one of the 11 SCC in 2 ms
Free SCC test removed 52 places
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 673 transitions
Trivial Post-agglo rules discarded 673 transitions
Performed 673 trivial Post agglomeration. Transition count delta: 673
Iterating post reduction 0 with 673 rules applied. Total rules applied 674 place count 916 transition count 481
Reduce places removed 673 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 684 rules applied. Total rules applied 1358 place count 243 transition count 470
Reduce places removed 4 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 1370 place count 239 transition count 462
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 1379 place count 231 transition count 461
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1379 place count 231 transition count 412
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1477 place count 182 transition count 412
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1493 place count 166 transition count 396
Iterating global reduction 4 with 16 rules applied. Total rules applied 1509 place count 166 transition count 396
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1509 place count 166 transition count 394
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1513 place count 164 transition count 394
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1522 place count 155 transition count 333
Iterating global reduction 4 with 9 rules applied. Total rules applied 1531 place count 155 transition count 333
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1533 place count 155 transition count 331
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1536 place count 152 transition count 328
Iterating global reduction 5 with 3 rules applied. Total rules applied 1539 place count 152 transition count 328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1540 place count 152 transition count 327
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1542 place count 150 transition count 325
Iterating global reduction 6 with 2 rules applied. Total rules applied 1544 place count 150 transition count 325
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1545 place count 150 transition count 324
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 1595 place count 125 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1599 place count 125 transition count 295
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 1617 place count 107 transition count 204
Iterating global reduction 8 with 18 rules applied. Total rules applied 1635 place count 107 transition count 204
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1643 place count 107 transition count 196
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 1654 place count 96 transition count 182
Iterating global reduction 9 with 11 rules applied. Total rules applied 1665 place count 96 transition count 182
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 1676 place count 85 transition count 168
Iterating global reduction 9 with 11 rules applied. Total rules applied 1687 place count 85 transition count 168
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1692 place count 85 transition count 163
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 1694 place count 84 transition count 162
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1695 place count 83 transition count 157
Iterating global reduction 10 with 1 rules applied. Total rules applied 1696 place count 83 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1697 place count 83 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 1702 place count 83 transition count 151
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 1712 place count 78 transition count 146
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1713 place count 77 transition count 145
Applied a total of 1713 rules in 90 ms. Remains 77 /969 variables (removed 892) and now considering 145/1214 (removed 1069) transitions.
[2024-05-29 12:14:32] [INFO ] Flow matrix only has 140 transitions (discarded 5 similar events)
// Phase 1: matrix 140 rows 77 cols
[2024-05-29 12:14:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:14:32] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 12:14:32] [INFO ] Flow matrix only has 140 transitions (discarded 5 similar events)
[2024-05-29 12:14:32] [INFO ] Invariant cache hit.
[2024-05-29 12:14:32] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 12:14:32] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-29 12:14:32] [INFO ] Redundant transitions in 3 ms returned []
Running 135 sub problems to find dead transitions.
[2024-05-29 12:14:32] [INFO ] Flow matrix only has 140 transitions (discarded 5 similar events)
[2024-05-29 12:14:32] [INFO ] Invariant cache hit.
[2024-05-29 12:14:32] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 4/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-29 12:14:33] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:14:33] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:14:33] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:14:33] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:14:33] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:14:33] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:14:33] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:14:33] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-05-29 12:14:34] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:14:34] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:14:34] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-29 12:14:34] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:14:34] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:14:34] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:14:34] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:14:34] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:14:34] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2024-05-29 12:14:35] [INFO ] Deduced a trap composed of 25 places in 976 ms of which 2 ms to minimize.
[2024-05-29 12:14:35] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-29 12:14:36] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 139/216 variables, 77/99 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 14/113 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-29 12:14:37] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-29 12:14:37] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 11 (OVERLAPS) 1/217 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 13 (OVERLAPS) 0/217 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 116 constraints, problems are : Problem set: 0 solved, 135 unsolved in 6821 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 4/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 139/216 variables, 77/101 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 14/115 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 135/250 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 1/217 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-29 12:14:42] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-29 12:14:43] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 13 (OVERLAPS) 0/217 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 253 constraints, problems are : Problem set: 0 solved, 135 unsolved in 7060 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 24/24 constraints]
After SMT, in 13950ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 13952ms
Starting structural reductions in SI_CTL mode, iteration 1 : 77/969 places, 145/1214 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14188 ms. Remains : 77/969 places, 145/1214 transitions.
[2024-05-29 12:14:46] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:14:46] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:14:46] [INFO ] Input system was already deterministic with 145 transitions.
[2024-05-29 12:14:46] [INFO ] Flatten gal took : 7 ms
[2024-05-29 12:14:46] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:14:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality7420003272588346058.gal : 4 ms
[2024-05-29 12:14:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality17270109750068079332.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/CTLCardinality7420003272588346058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17270109750068079332.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,132102,0.224715,12704,2,2993,5,31630,6,0,445,31421,0


Converting to forward existential form...Done !
original formula: AG(((EF((((p389==0)&&(p735==1)) + EF(((p97==0)&&(p122==1))))) + (p518==0)) + ((p885==1)||(p338==1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(((p885==1)||(p338==1)))) * !((p518==0))) * !(E(TRUE U (((p389==0)&&(p735==1)) + E(TRUE U...191
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t9, t12, t13, t14, t15, t20, t21, t22, t24, t27, t28, t29, t56, t58, t67, t68, t1...349
(forward)formula 0,0,4.84906,143008,1,0,299,827974,310,144,3732,478005,326
FORMULA StigmergyCommit-PT-03b-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 969/969 places, 1214/1214 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 941 transition count 1186
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 941 transition count 1186
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 77 place count 920 transition count 1165
Iterating global reduction 0 with 21 rules applied. Total rules applied 98 place count 920 transition count 1165
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 113 place count 905 transition count 1150
Iterating global reduction 0 with 15 rules applied. Total rules applied 128 place count 905 transition count 1150
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 140 place count 893 transition count 1138
Iterating global reduction 0 with 12 rules applied. Total rules applied 152 place count 893 transition count 1138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 153 place count 893 transition count 1137
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 163 place count 883 transition count 1127
Iterating global reduction 1 with 10 rules applied. Total rules applied 173 place count 883 transition count 1127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 174 place count 883 transition count 1126
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 182 place count 875 transition count 1118
Iterating global reduction 2 with 8 rules applied. Total rules applied 190 place count 875 transition count 1118
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 198 place count 867 transition count 1110
Iterating global reduction 2 with 8 rules applied. Total rules applied 206 place count 867 transition count 1110
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 214 place count 859 transition count 1102
Iterating global reduction 2 with 8 rules applied. Total rules applied 222 place count 859 transition count 1102
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 229 place count 852 transition count 1095
Iterating global reduction 2 with 7 rules applied. Total rules applied 236 place count 852 transition count 1095
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 240 place count 848 transition count 1091
Iterating global reduction 2 with 4 rules applied. Total rules applied 244 place count 848 transition count 1091
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 247 place count 845 transition count 1088
Iterating global reduction 2 with 3 rules applied. Total rules applied 250 place count 845 transition count 1088
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 253 place count 842 transition count 1085
Iterating global reduction 2 with 3 rules applied. Total rules applied 256 place count 842 transition count 1085
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 259 place count 839 transition count 1082
Iterating global reduction 2 with 3 rules applied. Total rules applied 262 place count 839 transition count 1082
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 263 place count 839 transition count 1081
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 265 place count 837 transition count 1079
Iterating global reduction 3 with 2 rules applied. Total rules applied 267 place count 837 transition count 1079
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 269 place count 835 transition count 1077
Iterating global reduction 3 with 2 rules applied. Total rules applied 271 place count 835 transition count 1077
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 272 place count 835 transition count 1076
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 273 place count 834 transition count 1075
Iterating global reduction 4 with 1 rules applied. Total rules applied 274 place count 834 transition count 1075
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 275 place count 833 transition count 1074
Iterating global reduction 4 with 1 rules applied. Total rules applied 276 place count 833 transition count 1074
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 277 place count 832 transition count 1073
Iterating global reduction 4 with 1 rules applied. Total rules applied 278 place count 832 transition count 1073
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 279 place count 832 transition count 1072
Applied a total of 279 rules in 376 ms. Remains 832 /969 variables (removed 137) and now considering 1072/1214 (removed 142) transitions.
// Phase 1: matrix 1072 rows 832 cols
[2024-05-29 12:14:52] [INFO ] Computed 5 invariants in 16 ms
[2024-05-29 12:14:52] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-29 12:14:52] [INFO ] Invariant cache hit.
[2024-05-29 12:14:53] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
Running 1071 sub problems to find dead transitions.
[2024-05-29 12:14:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/831 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
At refinement iteration 1 (OVERLAPS) 1/832 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 832/1904 variables, and 5 constraints, problems are : Problem set: 0 solved, 1071 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/832 constraints, PredecessorRefiner: 1071/1071 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1071 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/831 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
At refinement iteration 1 (OVERLAPS) 1/832 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
[2024-05-29 12:15:41] [INFO ] Deduced a trap composed of 313 places in 262 ms of which 4 ms to minimize.
[2024-05-29 12:15:42] [INFO ] Deduced a trap composed of 320 places in 203 ms of which 4 ms to minimize.
[2024-05-29 12:15:44] [INFO ] Deduced a trap composed of 321 places in 226 ms of which 4 ms to minimize.
[2024-05-29 12:15:46] [INFO ] Deduced a trap composed of 299 places in 201 ms of which 4 ms to minimize.
[2024-05-29 12:15:46] [INFO ] Deduced a trap composed of 300 places in 274 ms of which 5 ms to minimize.
[2024-05-29 12:15:47] [INFO ] Deduced a trap composed of 306 places in 243 ms of which 5 ms to minimize.
[2024-05-29 12:15:47] [INFO ] Deduced a trap composed of 313 places in 235 ms of which 5 ms to minimize.
[2024-05-29 12:15:47] [INFO ] Deduced a trap composed of 299 places in 213 ms of which 4 ms to minimize.
[2024-05-29 12:15:48] [INFO ] Deduced a trap composed of 313 places in 193 ms of which 4 ms to minimize.
[2024-05-29 12:15:51] [INFO ] Deduced a trap composed of 295 places in 200 ms of which 3 ms to minimize.
[2024-05-29 12:15:52] [INFO ] Deduced a trap composed of 295 places in 183 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/1904 variables, and 16 constraints, problems are : Problem set: 0 solved, 1071 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/832 constraints, PredecessorRefiner: 0/1071 constraints, Known Traps: 11/11 constraints]
After SMT, in 60570ms problems are : Problem set: 0 solved, 1071 unsolved
Search for dead transitions found 0 dead transitions in 60584ms
Starting structural reductions in LTL mode, iteration 1 : 832/969 places, 1072/1214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61768 ms. Remains : 832/969 places, 1072/1214 transitions.
[2024-05-29 12:15:53] [INFO ] Flatten gal took : 28 ms
[2024-05-29 12:15:53] [INFO ] Flatten gal took : 31 ms
[2024-05-29 12:15:53] [INFO ] Input system was already deterministic with 1072 transitions.
[2024-05-29 12:15:53] [INFO ] Flatten gal took : 27 ms
[2024-05-29 12:15:53] [INFO ] Flatten gal took : 27 ms
[2024-05-29 12:15:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality15423507171825197121.gal : 16 ms
[2024-05-29 12:15:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality13978657722241867160.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/CTLCardinality15423507171825197121.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13978657722241867160.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.08551e+10,18.0194,469520,2,25008,5,1.44101e+06,6,0,4402,2.06574e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:16:23] [INFO ] Flatten gal took : 27 ms
[2024-05-29 12:16:23] [INFO ] Applying decomposition
[2024-05-29 12:16:23] [INFO ] Flatten gal took : 31 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/graph12289164098780888112.txt' '-o' '/tmp/graph12289164098780888112.bin' '-w' '/tmp/graph12289164098780888112.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12289164098780888112.bin' '-l' '-1' '-v' '-w' '/tmp/graph12289164098780888112.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:16:24] [INFO ] Decomposing Gal with order
[2024-05-29 12:16:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:16:24] [INFO ] Removed a total of 873 redundant transitions.
[2024-05-29 12:16:24] [INFO ] Flatten gal took : 99 ms
[2024-05-29 12:16:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-29 12:16:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality6129771433451156117.gal : 14 ms
[2024-05-29 12:16:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality6148681402839150605.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/CTLCardinality6129771433451156117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6148681402839150605.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.08551e+10,14.0753,455880,2410,17,786165,1180,1340,2.49892e+06,53,3907,0


Converting to forward existential form...Done !
original formula: (E((EF(((i34.u320.p1092==0)||(i18.u165.p591==1))) + (i8.u88.p304==0)) U !(((AX(!(AX(((i24.i1.i0.u239.p814==0)||(i12.i1.i1.u113.p367==1)))...623
=> equivalent forward existential formula: [(((Init * E((E(TRUE U ((i34.u320.p1092==0)||(i18.u165.p591==1))) + (i8.u88.p304==0)) U !(((!(EX(!(!(!(EX(!(((i2...1031
Reverse transition relation is NOT exact ! Due to transitions t77, t102, t175, t176, t229, t232, t266, t300, t356, t412, t446, t531, t584, t587, t620, t709...614
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 969/969 places, 1214/1214 transitions.
Graph (trivial) has 957 edges and 969 vertex of which 72 / 969 are part of one of the 12 SCC in 4 ms
Free SCC test removed 60 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 679 transitions
Trivial Post-agglo rules discarded 679 transitions
Performed 679 trivial Post agglomeration. Transition count delta: 679
Iterating post reduction 0 with 679 rules applied. Total rules applied 680 place count 908 transition count 466
Reduce places removed 679 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 690 rules applied. Total rules applied 1370 place count 229 transition count 455
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 1376 place count 225 transition count 453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1378 place count 223 transition count 453
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1378 place count 223 transition count 404
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 1476 place count 174 transition count 404
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1492 place count 158 transition count 388
Iterating global reduction 4 with 16 rules applied. Total rules applied 1508 place count 158 transition count 388
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1508 place count 158 transition count 386
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1512 place count 156 transition count 386
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1521 place count 147 transition count 325
Iterating global reduction 4 with 9 rules applied. Total rules applied 1530 place count 147 transition count 325
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1532 place count 147 transition count 323
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1536 place count 143 transition count 319
Iterating global reduction 5 with 4 rules applied. Total rules applied 1540 place count 143 transition count 319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1541 place count 143 transition count 318
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1544 place count 140 transition count 315
Iterating global reduction 6 with 3 rules applied. Total rules applied 1547 place count 140 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1548 place count 140 transition count 314
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 7 with 48 rules applied. Total rules applied 1596 place count 116 transition count 290
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1600 place count 116 transition count 286
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 1619 place count 97 transition count 193
Iterating global reduction 8 with 19 rules applied. Total rules applied 1638 place count 97 transition count 193
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1648 place count 97 transition count 183
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 1659 place count 86 transition count 168
Iterating global reduction 9 with 11 rules applied. Total rules applied 1670 place count 86 transition count 168
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 1681 place count 75 transition count 153
Iterating global reduction 9 with 11 rules applied. Total rules applied 1692 place count 75 transition count 153
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1697 place count 75 transition count 148
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 1699 place count 74 transition count 147
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1700 place count 73 transition count 143
Iterating global reduction 10 with 1 rules applied. Total rules applied 1701 place count 73 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1702 place count 73 transition count 142
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 1706 place count 73 transition count 138
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 1714 place count 69 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1715 place count 68 transition count 133
Applied a total of 1715 rules in 56 ms. Remains 68 /969 variables (removed 901) and now considering 133/1214 (removed 1081) transitions.
[2024-05-29 12:16:54] [INFO ] Flow matrix only has 128 transitions (discarded 5 similar events)
// Phase 1: matrix 128 rows 68 cols
[2024-05-29 12:16:54] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 12:16:54] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 12:16:54] [INFO ] Flow matrix only has 128 transitions (discarded 5 similar events)
[2024-05-29 12:16:54] [INFO ] Invariant cache hit.
[2024-05-29 12:16:54] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 12:16:54] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-05-29 12:16:54] [INFO ] Redundant transitions in 2 ms returned []
Running 124 sub problems to find dead transitions.
[2024-05-29 12:16:54] [INFO ] Flow matrix only has 128 transitions (discarded 5 similar events)
[2024-05-29 12:16:54] [INFO ] Invariant cache hit.
[2024-05-29 12:16:54] [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, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 4/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-29 12:16:55] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:16:55] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:16:55] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:16:55] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 2 ms to minimize.
[2024-05-29 12:16:55] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:16:55] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:16:55] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:16:55] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2024-05-29 12:16:55] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:16:55] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-05-29 12:16:56] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-29 12:16:56] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:16:56] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-29 12:16:56] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 0 ms to minimize.
[2024-05-29 12:16:56] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:16:56] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:16:56] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:16:56] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2024-05-29 12:16:56] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2024-05-29 12:16:56] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:16:56] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:16:57] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-29 12:16:57] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 127/195 variables, 68/93 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (OVERLAPS) 1/196 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 12 (OVERLAPS) 0/196 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 108 constraints, problems are : Problem set: 0 solved, 124 unsolved in 5216 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 4/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-29 12:17:00] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 127/195 variables, 68/94 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 124/232 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-29 12:17:01] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (OVERLAPS) 1/196 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-29 12:17:03] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-29 12:17:04] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:17:04] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/196 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/196 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 15 (OVERLAPS) 0/196 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 237 constraints, problems are : Problem set: 0 solved, 124 unsolved in 7623 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 28/28 constraints]
After SMT, in 12897ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 12899ms
Starting structural reductions in SI_CTL mode, iteration 1 : 68/969 places, 133/1214 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13090 ms. Remains : 68/969 places, 133/1214 transitions.
[2024-05-29 12:17:07] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:17:07] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:17:07] [INFO ] Input system was already deterministic with 133 transitions.
[2024-05-29 12:17:07] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:17:07] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:17:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality13946099125155552142.gal : 1 ms
[2024-05-29 12:17:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality7296508548193425024.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/CTLCardinality13946099125155552142.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7296508548193425024.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,95940,0.17516,10128,2,2715,5,24943,6,0,397,22607,0


Converting to forward existential form...Done !
original formula: EF((EF((p830==1)) * A(((p933==0)||(p548==1)) U (p337==0))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * E(TRUE U (p830==1))) * !(EG(!((p337==0))))) * !(E(!((p337==0)) U (!(((p933==0)||(p548==1))...185
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t10, t13, t14, t15, t16, t20, t21, t22, t24, t27, t28, t29, t49, t50, t57, t58, t...333
(forward)formula 0,1,4.10959,124984,1,0,422,702418,293,188,3568,446614,475
FORMULA StigmergyCommit-PT-03b-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 969/969 places, 1214/1214 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 941 transition count 1186
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 941 transition count 1186
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 79 place count 918 transition count 1163
Iterating global reduction 0 with 23 rules applied. Total rules applied 102 place count 918 transition count 1163
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 119 place count 901 transition count 1146
Iterating global reduction 0 with 17 rules applied. Total rules applied 136 place count 901 transition count 1146
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 149 place count 888 transition count 1133
Iterating global reduction 0 with 13 rules applied. Total rules applied 162 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 163 place count 888 transition count 1132
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 173 place count 878 transition count 1122
Iterating global reduction 1 with 10 rules applied. Total rules applied 183 place count 878 transition count 1122
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 192 place count 869 transition count 1113
Iterating global reduction 1 with 9 rules applied. Total rules applied 201 place count 869 transition count 1113
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 210 place count 860 transition count 1104
Iterating global reduction 1 with 9 rules applied. Total rules applied 219 place count 860 transition count 1104
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 227 place count 852 transition count 1096
Iterating global reduction 1 with 8 rules applied. Total rules applied 235 place count 852 transition count 1096
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 242 place count 845 transition count 1089
Iterating global reduction 1 with 7 rules applied. Total rules applied 249 place count 845 transition count 1089
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 250 place count 845 transition count 1088
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 254 place count 841 transition count 1084
Iterating global reduction 2 with 4 rules applied. Total rules applied 258 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 259 place count 841 transition count 1083
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 262 place count 838 transition count 1080
Iterating global reduction 3 with 3 rules applied. Total rules applied 265 place count 838 transition count 1080
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 268 place count 835 transition count 1077
Iterating global reduction 3 with 3 rules applied. Total rules applied 271 place count 835 transition count 1077
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 274 place count 832 transition count 1074
Iterating global reduction 3 with 3 rules applied. Total rules applied 277 place count 832 transition count 1074
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 280 place count 829 transition count 1071
Iterating global reduction 3 with 3 rules applied. Total rules applied 283 place count 829 transition count 1071
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 286 place count 826 transition count 1068
Iterating global reduction 3 with 3 rules applied. Total rules applied 289 place count 826 transition count 1068
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 290 place count 826 transition count 1067
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 291 place count 825 transition count 1066
Iterating global reduction 4 with 1 rules applied. Total rules applied 292 place count 825 transition count 1066
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 293 place count 824 transition count 1065
Iterating global reduction 4 with 1 rules applied. Total rules applied 294 place count 824 transition count 1065
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 295 place count 823 transition count 1064
Iterating global reduction 4 with 1 rules applied. Total rules applied 296 place count 823 transition count 1064
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 297 place count 822 transition count 1063
Iterating global reduction 4 with 1 rules applied. Total rules applied 298 place count 822 transition count 1063
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 299 place count 821 transition count 1062
Iterating global reduction 4 with 1 rules applied. Total rules applied 300 place count 821 transition count 1062
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 301 place count 820 transition count 1061
Iterating global reduction 4 with 1 rules applied. Total rules applied 302 place count 820 transition count 1061
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 303 place count 819 transition count 1060
Iterating global reduction 4 with 1 rules applied. Total rules applied 304 place count 819 transition count 1060
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 305 place count 819 transition count 1059
Applied a total of 305 rules in 443 ms. Remains 819 /969 variables (removed 150) and now considering 1059/1214 (removed 155) transitions.
// Phase 1: matrix 1059 rows 819 cols
[2024-05-29 12:17:12] [INFO ] Computed 5 invariants in 12 ms
[2024-05-29 12:17:12] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-29 12:17:12] [INFO ] Invariant cache hit.
[2024-05-29 12:17:13] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
Running 1058 sub problems to find dead transitions.
[2024-05-29 12:17:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/818 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1058 unsolved
At refinement iteration 1 (OVERLAPS) 1/819 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1058 unsolved
[2024-05-29 12:17:38] [INFO ] Deduced a trap composed of 298 places in 200 ms of which 3 ms to minimize.
[2024-05-29 12:17:42] [INFO ] Deduced a trap composed of 291 places in 295 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 819/1878 variables, and 7 constraints, problems are : Problem set: 0 solved, 1058 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/819 constraints, PredecessorRefiner: 1058/1058 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1058 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/818 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1058 unsolved
At refinement iteration 1 (OVERLAPS) 1/819 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1058 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/819 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1058 unsolved
[2024-05-29 12:18:04] [INFO ] Deduced a trap composed of 291 places in 199 ms of which 3 ms to minimize.
[2024-05-29 12:18:05] [INFO ] Deduced a trap composed of 301 places in 259 ms of which 5 ms to minimize.
[2024-05-29 12:18:05] [INFO ] Deduced a trap composed of 291 places in 238 ms of which 4 ms to minimize.
[2024-05-29 12:18:06] [INFO ] Deduced a trap composed of 299 places in 198 ms of which 4 ms to minimize.
[2024-05-29 12:18:10] [INFO ] Deduced a trap composed of 302 places in 193 ms of which 3 ms to minimize.
[2024-05-29 12:18:10] [INFO ] Deduced a trap composed of 313 places in 191 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 Int declared 819/1878 variables, and 13 constraints, problems are : Problem set: 0 solved, 1058 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/819 constraints, PredecessorRefiner: 0/1058 constraints, Known Traps: 8/8 constraints]
After SMT, in 60446ms problems are : Problem set: 0 solved, 1058 unsolved
Search for dead transitions found 0 dead transitions in 60460ms
Starting structural reductions in LTL mode, iteration 1 : 819/969 places, 1059/1214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61673 ms. Remains : 819/969 places, 1059/1214 transitions.
[2024-05-29 12:18:13] [INFO ] Flatten gal took : 21 ms
[2024-05-29 12:18:13] [INFO ] Flatten gal took : 21 ms
[2024-05-29 12:18:13] [INFO ] Input system was already deterministic with 1059 transitions.
[2024-05-29 12:18:13] [INFO ] Flatten gal took : 21 ms
[2024-05-29 12:18:13] [INFO ] Flatten gal took : 22 ms
[2024-05-29 12:18:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality8713646186222091162.gal : 5 ms
[2024-05-29 12:18:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality14026350509398053390.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/CTLCardinality8713646186222091162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14026350509398053390.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.04246e+10,21.4235,466580,2,26754,5,1.42395e+06,6,0,4337,2.00373e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:18:43] [INFO ] Flatten gal took : 38 ms
[2024-05-29 12:18:43] [INFO ] Applying decomposition
[2024-05-29 12:18:43] [INFO ] Flatten gal took : 25 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/graph15737058669584194552.txt' '-o' '/tmp/graph15737058669584194552.bin' '-w' '/tmp/graph15737058669584194552.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15737058669584194552.bin' '-l' '-1' '-v' '-w' '/tmp/graph15737058669584194552.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:18:43] [INFO ] Decomposing Gal with order
[2024-05-29 12:18:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:18:44] [INFO ] Removed a total of 870 redundant transitions.
[2024-05-29 12:18:44] [INFO ] Flatten gal took : 43 ms
[2024-05-29 12:18:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 8 ms.
[2024-05-29 12:18:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality10287106194334825605.gal : 8 ms
[2024-05-29 12:18:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality4940791685782993873.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/CTLCardinality10287106194334825605.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4940791685782993873.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.04246e+10,5.50716,187548,2331,16,322793,1043,1373,1.016e+06,50,3205,0


Converting to forward existential form...Done !
original formula: (EF((EF((i16.u148.p551==1)) + EX(!(E(((i7.u64.p205==0)||(i33.i0.i0.u296.p1024==1)) U (i4.u28.p78==1)))))) + AG((!(E(AF(((i37.i1.i0.u140.p...335
=> equivalent forward existential formula: [(FwdU((FwdU((Init * !(E(TRUE U (E(TRUE U (i16.u148.p551==1)) + EX(!(E(((i7.u64.p205==0)||(i33.i0.i0.u296.p1024=...408
Reverse transition relation is NOT exact ! Due to transitions t24, t77, t160, t213, t216, t250, t396, t430, t523, t579, t612, t700, t701, t755, t757, t777,...614
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 969/969 places, 1214/1214 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 938 transition count 1183
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 938 transition count 1183
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 87 place count 913 transition count 1158
Iterating global reduction 0 with 25 rules applied. Total rules applied 112 place count 913 transition count 1158
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 130 place count 895 transition count 1140
Iterating global reduction 0 with 18 rules applied. Total rules applied 148 place count 895 transition count 1140
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 162 place count 881 transition count 1126
Iterating global reduction 0 with 14 rules applied. Total rules applied 176 place count 881 transition count 1126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 177 place count 881 transition count 1125
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 189 place count 869 transition count 1113
Iterating global reduction 1 with 12 rules applied. Total rules applied 201 place count 869 transition count 1113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 202 place count 869 transition count 1112
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 212 place count 859 transition count 1102
Iterating global reduction 2 with 10 rules applied. Total rules applied 222 place count 859 transition count 1102
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 232 place count 849 transition count 1092
Iterating global reduction 2 with 10 rules applied. Total rules applied 242 place count 849 transition count 1092
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 251 place count 840 transition count 1083
Iterating global reduction 2 with 9 rules applied. Total rules applied 260 place count 840 transition count 1083
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 268 place count 832 transition count 1075
Iterating global reduction 2 with 8 rules applied. Total rules applied 276 place count 832 transition count 1075
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 277 place count 832 transition count 1074
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 282 place count 827 transition count 1069
Iterating global reduction 3 with 5 rules applied. Total rules applied 287 place count 827 transition count 1069
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 288 place count 827 transition count 1068
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 292 place count 823 transition count 1064
Iterating global reduction 4 with 4 rules applied. Total rules applied 296 place count 823 transition count 1064
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 300 place count 819 transition count 1060
Iterating global reduction 4 with 4 rules applied. Total rules applied 304 place count 819 transition count 1060
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 308 place count 815 transition count 1056
Iterating global reduction 4 with 4 rules applied. Total rules applied 312 place count 815 transition count 1056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 313 place count 815 transition count 1055
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 316 place count 812 transition count 1052
Iterating global reduction 5 with 3 rules applied. Total rules applied 319 place count 812 transition count 1052
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 322 place count 809 transition count 1049
Iterating global reduction 5 with 3 rules applied. Total rules applied 325 place count 809 transition count 1049
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 326 place count 809 transition count 1048
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 328 place count 807 transition count 1046
Iterating global reduction 6 with 2 rules applied. Total rules applied 330 place count 807 transition count 1046
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 332 place count 805 transition count 1044
Iterating global reduction 6 with 2 rules applied. Total rules applied 334 place count 805 transition count 1044
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 336 place count 803 transition count 1042
Iterating global reduction 6 with 2 rules applied. Total rules applied 338 place count 803 transition count 1042
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 339 place count 803 transition count 1041
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 340 place count 802 transition count 1040
Iterating global reduction 7 with 1 rules applied. Total rules applied 341 place count 802 transition count 1040
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 342 place count 801 transition count 1039
Iterating global reduction 7 with 1 rules applied. Total rules applied 343 place count 801 transition count 1039
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 344 place count 800 transition count 1038
Iterating global reduction 7 with 1 rules applied. Total rules applied 345 place count 800 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 346 place count 799 transition count 1037
Iterating global reduction 7 with 1 rules applied. Total rules applied 347 place count 799 transition count 1037
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 348 place count 799 transition count 1036
Applied a total of 348 rules in 422 ms. Remains 799 /969 variables (removed 170) and now considering 1036/1214 (removed 178) transitions.
// Phase 1: matrix 1036 rows 799 cols
[2024-05-29 12:19:14] [INFO ] Computed 5 invariants in 12 ms
[2024-05-29 12:19:14] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-29 12:19:14] [INFO ] Invariant cache hit.
[2024-05-29 12:19:15] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
Running 1035 sub problems to find dead transitions.
[2024-05-29 12:19:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/798 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 1 (OVERLAPS) 1/799 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
[2024-05-29 12:19:39] [INFO ] Deduced a trap composed of 290 places in 242 ms of which 4 ms to minimize.
[2024-05-29 12:19:39] [INFO ] Deduced a trap composed of 297 places in 233 ms of which 3 ms to minimize.
[2024-05-29 12:19:39] [INFO ] Deduced a trap composed of 298 places in 200 ms of which 4 ms to minimize.
[2024-05-29 12:19:40] [INFO ] Deduced a trap composed of 298 places in 195 ms of which 3 ms to minimize.
[2024-05-29 12:19:41] [INFO ] Deduced a trap composed of 292 places in 222 ms of which 4 ms to minimize.
[2024-05-29 12:19:42] [INFO ] Deduced a trap composed of 292 places in 211 ms of which 4 ms to minimize.
[2024-05-29 12:19:42] [INFO ] Deduced a trap composed of 301 places in 190 ms of which 3 ms to minimize.
[2024-05-29 12:19:43] [INFO ] Deduced a trap composed of 297 places in 217 ms of which 3 ms to minimize.
[2024-05-29 12:19:44] [INFO ] Deduced a trap composed of 291 places in 178 ms of which 3 ms to minimize.
[2024-05-29 12:19:45] [INFO ] Deduced a trap composed of 297 places in 198 ms of which 4 ms to minimize.
SMT process timed out in 30366ms, After SMT, problems are : Problem set: 0 solved, 1035 unsolved
Search for dead transitions found 0 dead transitions in 30377ms
Starting structural reductions in LTL mode, iteration 1 : 799/969 places, 1036/1214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31601 ms. Remains : 799/969 places, 1036/1214 transitions.
[2024-05-29 12:19:45] [INFO ] Flatten gal took : 21 ms
[2024-05-29 12:19:45] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:19:45] [INFO ] Input system was already deterministic with 1036 transitions.
[2024-05-29 12:19:45] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:19:45] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:19:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality8057539677089085707.gal : 5 ms
[2024-05-29 12:19:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality284686256191128943.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/CTLCardinality8057539677089085707.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality284686256191128943.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 -...282
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.67734e+09,17.5366,459420,2,29984,5,1.45855e+06,6,0,4234,1.97144e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:20:16] [INFO ] Flatten gal took : 23 ms
[2024-05-29 12:20:16] [INFO ] Applying decomposition
[2024-05-29 12:20:16] [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/graph12872180021232105037.txt' '-o' '/tmp/graph12872180021232105037.bin' '-w' '/tmp/graph12872180021232105037.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12872180021232105037.bin' '-l' '-1' '-v' '-w' '/tmp/graph12872180021232105037.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:20:16] [INFO ] Decomposing Gal with order
[2024-05-29 12:20:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:20:16] [INFO ] Removed a total of 857 redundant transitions.
[2024-05-29 12:20:16] [INFO ] Flatten gal took : 40 ms
[2024-05-29 12:20:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2024-05-29 12:20:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality2922520837298569958.gal : 6 ms
[2024-05-29 12:20:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality8238099798927431870.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/CTLCardinality2922520837298569958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8238099798927431870.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.67734e+09,9.14674,308748,2263,13,559614,882,1283,1.55912e+06,50,2932,0


Converting to forward existential form...Done !
original formula: EF(AX(((i17.i0.i0.u153.p576==0)&&(i35.u327.p1210==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((i17.i0.i0.u153.p576==0)&&(i35.u327.p1210==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t77, t104, t160, t216, t250, t333, t386, t389, t429, t512, t566, t601, t628, t684, t740,...559
(forward)formula 0,1,10.8033,308748,1,0,559614,882,8469,1.55912e+06,211,2932,953899
FORMULA StigmergyCommit-PT-03b-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 969/969 places, 1214/1214 transitions.
Graph (trivial) has 948 edges and 969 vertex of which 72 / 969 are part of one of the 12 SCC in 1 ms
Free SCC test removed 60 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 670 transitions
Trivial Post-agglo rules discarded 670 transitions
Performed 670 trivial Post agglomeration. Transition count delta: 670
Iterating post reduction 0 with 670 rules applied. Total rules applied 671 place count 908 transition count 475
Reduce places removed 670 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 680 rules applied. Total rules applied 1351 place count 238 transition count 465
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 1359 place count 234 transition count 461
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1363 place count 230 transition count 461
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1363 place count 230 transition count 412
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1461 place count 181 transition count 412
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1475 place count 167 transition count 398
Iterating global reduction 4 with 14 rules applied. Total rules applied 1489 place count 167 transition count 398
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1489 place count 167 transition count 397
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1491 place count 166 transition count 397
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1499 place count 158 transition count 363
Iterating global reduction 4 with 8 rules applied. Total rules applied 1507 place count 158 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1508 place count 158 transition count 362
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1512 place count 154 transition count 358
Iterating global reduction 5 with 4 rules applied. Total rules applied 1516 place count 154 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1517 place count 154 transition count 357
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1520 place count 151 transition count 354
Iterating global reduction 6 with 3 rules applied. Total rules applied 1523 place count 151 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1524 place count 151 transition count 353
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 1574 place count 126 transition count 328
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1579 place count 126 transition count 323
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 1598 place count 107 transition count 211
Iterating global reduction 8 with 19 rules applied. Total rules applied 1617 place count 107 transition count 211
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1625 place count 107 transition count 203
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 1636 place count 96 transition count 188
Iterating global reduction 9 with 11 rules applied. Total rules applied 1647 place count 96 transition count 188
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 1658 place count 85 transition count 173
Iterating global reduction 9 with 11 rules applied. Total rules applied 1669 place count 85 transition count 173
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1673 place count 85 transition count 169
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 1675 place count 84 transition count 168
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1676 place count 83 transition count 164
Iterating global reduction 10 with 1 rules applied. Total rules applied 1677 place count 83 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1678 place count 83 transition count 163
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 1682 place count 83 transition count 159
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 1690 place count 79 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1691 place count 78 transition count 154
Applied a total of 1691 rules in 50 ms. Remains 78 /969 variables (removed 891) and now considering 154/1214 (removed 1060) transitions.
[2024-05-29 12:20:27] [INFO ] Flow matrix only has 149 transitions (discarded 5 similar events)
// Phase 1: matrix 149 rows 78 cols
[2024-05-29 12:20:27] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 12:20:27] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-29 12:20:27] [INFO ] Flow matrix only has 149 transitions (discarded 5 similar events)
[2024-05-29 12:20:27] [INFO ] Invariant cache hit.
[2024-05-29 12:20:27] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 12:20:27] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-29 12:20:27] [INFO ] Redundant transitions in 4 ms returned []
Running 144 sub problems to find dead transitions.
[2024-05-29 12:20:27] [INFO ] Flow matrix only has 149 transitions (discarded 5 similar events)
[2024-05-29 12:20:27] [INFO ] Invariant cache hit.
[2024-05-29 12:20:27] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 4/78 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 12:20:27] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 ms to minimize.
[2024-05-29 12:20:27] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:20:28] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-05-29 12:20:28] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:20:28] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:20:28] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:20:28] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-05-29 12:20:28] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:20:28] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:20:28] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:20:28] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:20:28] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:20:28] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-29 12:20:28] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:20:28] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:20:28] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:20:28] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:20:28] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-05-29 12:20:28] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 12:20:29] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:20:29] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:20:29] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:20:29] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 12:20:29] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 12:20:30] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-05-29 12:20:30] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 148/226 variables, 78/106 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 14/120 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (OVERLAPS) 1/227 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (OVERLAPS) 0/227 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 121 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6068 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 4/78 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 25/28 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 12:20:33] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 12:20:34] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 12:20:34] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 148/226 variables, 78/109 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 14/123 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 144/267 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 12:20:35] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (OVERLAPS) 1/227 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/227 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 12:20:40] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/227 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/227 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 18 (OVERLAPS) 0/227 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 270 constraints, problems are : Problem set: 0 solved, 144 unsolved in 10461 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 31/31 constraints]
After SMT, in 16593ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 16595ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/969 places, 154/1214 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16803 ms. Remains : 78/969 places, 154/1214 transitions.
[2024-05-29 12:20:43] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:20:43] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:20:43] [INFO ] Input system was already deterministic with 154 transitions.
[2024-05-29 12:20:43] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:20:43] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:20:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality15113869189830317937.gal : 2 ms
[2024-05-29 12:20:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality15361905108193130209.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/CTLCardinality15113869189830317937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15361905108193130209.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,237850,0.207874,11100,2,3309,5,27593,6,0,458,28532,0


Converting to forward existential form...Done !
original formula: EF((((EF((p1052==0)) * E((p1110==0) U ((p70==0)||(p1227==1)))) * ((p816==0)&&(p135==1))) * ((p1168==0)||(p1112==1))))
=> equivalent forward existential formula: [(FwdU((((FwdU(Init,TRUE) * ((p1168==0)||(p1112==1))) * ((p816==0)&&(p135==1))) * E(TRUE U (p1052==0))),(p1110==...194
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t10, t12, t13, t18, t22, t23, t24, t25, t27, t28, t29, t30, t33, t34, t35, t42, t70, ...363
Hit Full ! (commute/partial/dont) 152/0/2
(forward)formula 0,1,1.78969,55396,1,0,312,215873,333,144,4257,170715,321
FORMULA StigmergyCommit-PT-03b-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 969/969 places, 1214/1214 transitions.
Graph (trivial) has 957 edges and 969 vertex of which 72 / 969 are part of one of the 12 SCC in 4 ms
Free SCC test removed 60 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 679 transitions
Trivial Post-agglo rules discarded 679 transitions
Performed 679 trivial Post agglomeration. Transition count delta: 679
Iterating post reduction 0 with 679 rules applied. Total rules applied 680 place count 908 transition count 466
Reduce places removed 679 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 690 rules applied. Total rules applied 1370 place count 229 transition count 455
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 1375 place count 225 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1376 place count 224 transition count 454
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1376 place count 224 transition count 405
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1474 place count 175 transition count 405
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1489 place count 160 transition count 390
Iterating global reduction 4 with 15 rules applied. Total rules applied 1504 place count 160 transition count 390
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1504 place count 160 transition count 388
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1508 place count 158 transition count 388
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1515 place count 151 transition count 329
Iterating global reduction 4 with 7 rules applied. Total rules applied 1522 place count 151 transition count 329
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1524 place count 151 transition count 327
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1526 place count 149 transition count 325
Iterating global reduction 5 with 2 rules applied. Total rules applied 1528 place count 149 transition count 325
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1529 place count 149 transition count 324
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1530 place count 148 transition count 323
Iterating global reduction 6 with 1 rules applied. Total rules applied 1531 place count 148 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1532 place count 148 transition count 322
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 7 with 52 rules applied. Total rules applied 1584 place count 122 transition count 296
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1588 place count 122 transition count 292
Discarding 20 places :
Symmetric choice reduction at 8 with 20 rule applications. Total rules 1608 place count 102 transition count 198
Iterating global reduction 8 with 20 rules applied. Total rules applied 1628 place count 102 transition count 198
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1638 place count 102 transition count 188
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 1650 place count 90 transition count 172
Iterating global reduction 9 with 12 rules applied. Total rules applied 1662 place count 90 transition count 172
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 1674 place count 78 transition count 156
Iterating global reduction 9 with 12 rules applied. Total rules applied 1686 place count 78 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1690 place count 78 transition count 152
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 1692 place count 77 transition count 151
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1693 place count 76 transition count 147
Iterating global reduction 10 with 1 rules applied. Total rules applied 1694 place count 76 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1695 place count 76 transition count 146
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 1699 place count 76 transition count 142
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 1707 place count 72 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1708 place count 71 transition count 137
Applied a total of 1708 rules in 46 ms. Remains 71 /969 variables (removed 898) and now considering 137/1214 (removed 1077) transitions.
[2024-05-29 12:20:45] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
// Phase 1: matrix 132 rows 71 cols
[2024-05-29 12:20:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:20:45] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-29 12:20:45] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-05-29 12:20:45] [INFO ] Invariant cache hit.
[2024-05-29 12:20:45] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 12:20:45] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-29 12:20:45] [INFO ] Redundant transitions in 1 ms returned []
Running 126 sub problems to find dead transitions.
[2024-05-29 12:20:45] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-05-29 12:20:45] [INFO ] Invariant cache hit.
[2024-05-29 12:20:45] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 4/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 12:20:46] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:20:46] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:20:46] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:20:46] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:20:46] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:20:46] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:20:46] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:20:46] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:20:46] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:20:46] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:20:46] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:20:46] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:20:46] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:20:47] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 2 ms to minimize.
[2024-05-29 12:20:47] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:20:47] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:20:47] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:20:47] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 12:20:47] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 131/202 variables, 71/92 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 12:20:48] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:20:48] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 1/203 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 12 (OVERLAPS) 0/203 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 109 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5366 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 4/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 12:20:51] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-29 12:20:51] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:20:51] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:20:51] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 131/202 variables, 71/98 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 14/112 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 126/238 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 12:20:53] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (OVERLAPS) 1/203 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 13 (OVERLAPS) 0/203 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 240 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5813 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 26/26 constraints]
After SMT, in 11237ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 11239ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/969 places, 137/1214 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11421 ms. Remains : 71/969 places, 137/1214 transitions.
[2024-05-29 12:20:57] [INFO ] Flatten gal took : 7 ms
[2024-05-29 12:20:57] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:20:57] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-29 12:20:57] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:20:57] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:20:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality13162127510667435506.gal : 1 ms
[2024-05-29 12:20:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality17347781055914769428.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/CTLCardinality13162127510667435506.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17347781055914769428.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,85862,0.183927,11464,2,2582,5,27000,6,0,413,26562,0


Converting to forward existential form...Done !
original formula: EF((AF(EG(((p547==0)||(p280==1)))) + (p883==1)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG(!(EG(((p547==0)||(p280==1)))))))] != FALSE + [(FwdU(Init,TRUE) * (p883==1))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t9, t11, t12, t13, t14, t17, t18, t19, t20, t23, t24, t25, t46, t48, t57, t58, t9...342
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,5.11282,171228,1,0,559,992394,296,265,3607,780805,615
FORMULA StigmergyCommit-PT-03b-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 969/969 places, 1214/1214 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 941 transition count 1186
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 941 transition count 1186
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 78 place count 919 transition count 1164
Iterating global reduction 0 with 22 rules applied. Total rules applied 100 place count 919 transition count 1164
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 116 place count 903 transition count 1148
Iterating global reduction 0 with 16 rules applied. Total rules applied 132 place count 903 transition count 1148
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 143 place count 892 transition count 1137
Iterating global reduction 0 with 11 rules applied. Total rules applied 154 place count 892 transition count 1137
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 164 place count 882 transition count 1127
Iterating global reduction 0 with 10 rules applied. Total rules applied 174 place count 882 transition count 1127
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 183 place count 873 transition count 1118
Iterating global reduction 0 with 9 rules applied. Total rules applied 192 place count 873 transition count 1118
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 201 place count 864 transition count 1109
Iterating global reduction 0 with 9 rules applied. Total rules applied 210 place count 864 transition count 1109
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 218 place count 856 transition count 1101
Iterating global reduction 0 with 8 rules applied. Total rules applied 226 place count 856 transition count 1101
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 232 place count 850 transition count 1095
Iterating global reduction 0 with 6 rules applied. Total rules applied 238 place count 850 transition count 1095
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 239 place count 850 transition count 1094
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 243 place count 846 transition count 1090
Iterating global reduction 1 with 4 rules applied. Total rules applied 247 place count 846 transition count 1090
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 248 place count 846 transition count 1089
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 250 place count 844 transition count 1087
Iterating global reduction 2 with 2 rules applied. Total rules applied 252 place count 844 transition count 1087
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 254 place count 842 transition count 1085
Iterating global reduction 2 with 2 rules applied. Total rules applied 256 place count 842 transition count 1085
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 258 place count 840 transition count 1083
Iterating global reduction 2 with 2 rules applied. Total rules applied 260 place count 840 transition count 1083
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 261 place count 840 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 262 place count 839 transition count 1081
Iterating global reduction 3 with 1 rules applied. Total rules applied 263 place count 839 transition count 1081
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 264 place count 838 transition count 1080
Iterating global reduction 3 with 1 rules applied. Total rules applied 265 place count 838 transition count 1080
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 837 transition count 1079
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 837 transition count 1079
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 268 place count 836 transition count 1078
Iterating global reduction 3 with 1 rules applied. Total rules applied 269 place count 836 transition count 1078
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 270 place count 835 transition count 1077
Iterating global reduction 3 with 1 rules applied. Total rules applied 271 place count 835 transition count 1077
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 272 place count 834 transition count 1076
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 834 transition count 1076
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 274 place count 833 transition count 1075
Iterating global reduction 3 with 1 rules applied. Total rules applied 275 place count 833 transition count 1075
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 276 place count 832 transition count 1074
Iterating global reduction 3 with 1 rules applied. Total rules applied 277 place count 832 transition count 1074
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 278 place count 831 transition count 1073
Iterating global reduction 3 with 1 rules applied. Total rules applied 279 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 280 place count 831 transition count 1072
Applied a total of 280 rules in 424 ms. Remains 831 /969 variables (removed 138) and now considering 1072/1214 (removed 142) transitions.
// Phase 1: matrix 1072 rows 831 cols
[2024-05-29 12:21:02] [INFO ] Computed 5 invariants in 13 ms
[2024-05-29 12:21:02] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-29 12:21:02] [INFO ] Invariant cache hit.
[2024-05-29 12:21:03] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
Running 1071 sub problems to find dead transitions.
[2024-05-29 12:21:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/830 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
At refinement iteration 1 (OVERLAPS) 1/831 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
[2024-05-29 12:21:33] [INFO ] Deduced a trap composed of 295 places in 287 ms of which 6 ms to minimize.
[2024-05-29 12:21:34] [INFO ] Deduced a trap composed of 294 places in 201 ms of which 4 ms to minimize.
SMT process timed out in 30508ms, After SMT, problems are : Problem set: 0 solved, 1071 unsolved
Search for dead transitions found 0 dead transitions in 30520ms
Starting structural reductions in LTL mode, iteration 1 : 831/969 places, 1072/1214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31696 ms. Remains : 831/969 places, 1072/1214 transitions.
[2024-05-29 12:21:34] [INFO ] Flatten gal took : 21 ms
[2024-05-29 12:21:34] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:21:34] [INFO ] Input system was already deterministic with 1072 transitions.
[2024-05-29 12:21:34] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:21:34] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:21:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality12975086275235474214.gal : 4 ms
[2024-05-29 12:21:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality6407185653688553312.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/CTLCardinality12975086275235474214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6407185653688553312.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.06695e+10,19.1321,470908,2,28125,5,1.45147e+06,6,0,4398,2.02005e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:22:04] [INFO ] Flatten gal took : 19 ms
[2024-05-29 12:22:04] [INFO ] Applying decomposition
[2024-05-29 12:22:04] [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/graph2669931977573152785.txt' '-o' '/tmp/graph2669931977573152785.bin' '-w' '/tmp/graph2669931977573152785.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2669931977573152785.bin' '-l' '-1' '-v' '-w' '/tmp/graph2669931977573152785.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:22:04] [INFO ] Decomposing Gal with order
[2024-05-29 12:22:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:22:04] [INFO ] Removed a total of 870 redundant transitions.
[2024-05-29 12:22:04] [INFO ] Flatten gal took : 47 ms
[2024-05-29 12:22:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2024-05-29 12:22:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality18003535243895480315.gal : 6 ms
[2024-05-29 12:22:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality2733548904383589827.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/CTLCardinality18003535243895480315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2733548904383589827.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.06695e+10,20.0708,621292,2547,17,1.02005e+06,969,1359,3.73389e+06,50,2999,0


Converting to forward existential form...Done !
original formula: (A(((i3.u40.p109==0) * ((EF((!(((i10.u110.p352==0)||(i13.u158.p517==1))) + E((i29.u266.p924==1) U ((i1.u23.p60==0)||(i23.i0.i3.u251.p884=...383
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(!((E(!(!(((i20.u194.p655==0)||(i23.i1.i1.u242.p839==1)))) U (!(((i3.u40.p109==0) * ((E(TRUE...583
Reverse transition relation is NOT exact ! Due to transitions t76, t162, t163, t219, t256, t345, t440, t471, t585, t618, t714, t770, t790, t791, t794, t797...613
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 969/969 places, 1214/1214 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 939 transition count 1184
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 939 transition count 1184
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 83 place count 916 transition count 1161
Iterating global reduction 0 with 23 rules applied. Total rules applied 106 place count 916 transition count 1161
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 122 place count 900 transition count 1145
Iterating global reduction 0 with 16 rules applied. Total rules applied 138 place count 900 transition count 1145
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 151 place count 887 transition count 1132
Iterating global reduction 0 with 13 rules applied. Total rules applied 164 place count 887 transition count 1132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 165 place count 887 transition count 1131
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 175 place count 877 transition count 1121
Iterating global reduction 1 with 10 rules applied. Total rules applied 185 place count 877 transition count 1121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 186 place count 877 transition count 1120
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 194 place count 869 transition count 1112
Iterating global reduction 2 with 8 rules applied. Total rules applied 202 place count 869 transition count 1112
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 210 place count 861 transition count 1104
Iterating global reduction 2 with 8 rules applied. Total rules applied 218 place count 861 transition count 1104
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 225 place count 854 transition count 1097
Iterating global reduction 2 with 7 rules applied. Total rules applied 232 place count 854 transition count 1097
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 239 place count 847 transition count 1090
Iterating global reduction 2 with 7 rules applied. Total rules applied 246 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 247 place count 847 transition count 1089
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 250 place count 844 transition count 1086
Iterating global reduction 3 with 3 rules applied. Total rules applied 253 place count 844 transition count 1086
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 255 place count 842 transition count 1084
Iterating global reduction 3 with 2 rules applied. Total rules applied 257 place count 842 transition count 1084
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 259 place count 840 transition count 1082
Iterating global reduction 3 with 2 rules applied. Total rules applied 261 place count 840 transition count 1082
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 263 place count 838 transition count 1080
Iterating global reduction 3 with 2 rules applied. Total rules applied 265 place count 838 transition count 1080
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 266 place count 838 transition count 1079
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 267 place count 837 transition count 1078
Iterating global reduction 4 with 1 rules applied. Total rules applied 268 place count 837 transition count 1078
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 269 place count 836 transition count 1077
Iterating global reduction 4 with 1 rules applied. Total rules applied 270 place count 836 transition count 1077
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 271 place count 835 transition count 1076
Iterating global reduction 4 with 1 rules applied. Total rules applied 272 place count 835 transition count 1076
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 273 place count 834 transition count 1075
Iterating global reduction 4 with 1 rules applied. Total rules applied 274 place count 834 transition count 1075
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 275 place count 833 transition count 1074
Iterating global reduction 4 with 1 rules applied. Total rules applied 276 place count 833 transition count 1074
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 277 place count 832 transition count 1073
Iterating global reduction 4 with 1 rules applied. Total rules applied 278 place count 832 transition count 1073
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 279 place count 831 transition count 1072
Iterating global reduction 4 with 1 rules applied. Total rules applied 280 place count 831 transition count 1072
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 281 place count 830 transition count 1071
Iterating global reduction 4 with 1 rules applied. Total rules applied 282 place count 830 transition count 1071
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 283 place count 829 transition count 1070
Iterating global reduction 4 with 1 rules applied. Total rules applied 284 place count 829 transition count 1070
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 285 place count 829 transition count 1069
Applied a total of 285 rules in 421 ms. Remains 829 /969 variables (removed 140) and now considering 1069/1214 (removed 145) transitions.
// Phase 1: matrix 1069 rows 829 cols
[2024-05-29 12:22:34] [INFO ] Computed 5 invariants in 15 ms
[2024-05-29 12:22:35] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-29 12:22:35] [INFO ] Invariant cache hit.
[2024-05-29 12:22:35] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 877 ms to find 0 implicit places.
Running 1068 sub problems to find dead transitions.
[2024-05-29 12:22:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
At refinement iteration 1 (OVERLAPS) 1/829 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
[2024-05-29 12:23:02] [INFO ] Deduced a trap composed of 293 places in 289 ms of which 5 ms to minimize.
[2024-05-29 12:23:02] [INFO ] Deduced a trap composed of 304 places in 245 ms of which 4 ms to minimize.
[2024-05-29 12:23:02] [INFO ] Deduced a trap composed of 304 places in 228 ms of which 4 ms to minimize.
[2024-05-29 12:23:02] [INFO ] Deduced a trap composed of 294 places in 215 ms of which 4 ms to minimize.
[2024-05-29 12:23:03] [INFO ] Deduced a trap composed of 295 places in 205 ms of which 3 ms to minimize.
[2024-05-29 12:23:04] [INFO ] Deduced a trap composed of 303 places in 190 ms of which 4 ms to minimize.
[2024-05-29 12:23:04] [INFO ] Deduced a trap composed of 305 places in 225 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 Real declared 829/1898 variables, and 12 constraints, problems are : Problem set: 0 solved, 1068 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/829 constraints, PredecessorRefiner: 1068/1068 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1068 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
At refinement iteration 1 (OVERLAPS) 1/829 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/829 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
[2024-05-29 12:23:20] [INFO ] Deduced a trap composed of 299 places in 182 ms of which 4 ms to minimize.
[2024-05-29 12:23:21] [INFO ] Deduced a trap composed of 305 places in 274 ms of which 5 ms to minimize.
[2024-05-29 12:23:23] [INFO ] Deduced a trap composed of 294 places in 239 ms of which 4 ms to minimize.
[2024-05-29 12:23:23] [INFO ] Deduced a trap composed of 295 places in 260 ms of which 4 ms to minimize.
[2024-05-29 12:23:24] [INFO ] Deduced a trap composed of 297 places in 246 ms of which 4 ms to minimize.
[2024-05-29 12:23:24] [INFO ] Deduced a trap composed of 298 places in 219 ms of which 4 ms to minimize.
[2024-05-29 12:23:26] [INFO ] Deduced a trap composed of 320 places in 239 ms of which 4 ms to minimize.
[2024-05-29 12:23:27] [INFO ] Deduced a trap composed of 297 places in 205 ms of which 4 ms to minimize.
[2024-05-29 12:23:27] [INFO ] Deduced a trap composed of 294 places in 171 ms of which 3 ms to minimize.
[2024-05-29 12:23:27] [INFO ] Deduced a trap composed of 298 places in 188 ms of which 3 ms to minimize.
[2024-05-29 12:23:29] [INFO ] Deduced a trap composed of 300 places in 230 ms of which 4 ms to minimize.
[2024-05-29 12:23:29] [INFO ] Deduced a trap composed of 325 places in 221 ms of which 4 ms to minimize.
[2024-05-29 12:23:29] [INFO ] Deduced a trap composed of 297 places in 190 ms of which 4 ms to minimize.
[2024-05-29 12:23:30] [INFO ] Deduced a trap composed of 296 places in 205 ms of which 4 ms to minimize.
[2024-05-29 12:23:32] [INFO ] Deduced a trap composed of 304 places in 233 ms of which 4 ms to minimize.
[2024-05-29 12:23:34] [INFO ] Deduced a trap composed of 323 places in 245 ms of which 4 ms to minimize.
[2024-05-29 12:23:34] [INFO ] Deduced a trap composed of 297 places in 218 ms of which 4 ms to minimize.
[2024-05-29 12:23:34] [INFO ] Deduced a trap composed of 296 places in 180 ms of which 4 ms to minimize.
[2024-05-29 12:23:36] [INFO ] Deduced a trap composed of 299 places in 201 ms of which 4 ms to minimize.
[2024-05-29 12:23:36] [INFO ] Deduced a trap composed of 292 places in 184 ms of which 3 ms to minimize.
SMT process timed out in 60545ms, After SMT, problems are : Problem set: 0 solved, 1068 unsolved
Search for dead transitions found 0 dead transitions in 60571ms
Starting structural reductions in LTL mode, iteration 1 : 829/969 places, 1069/1214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61871 ms. Remains : 829/969 places, 1069/1214 transitions.
[2024-05-29 12:23:36] [INFO ] Flatten gal took : 21 ms
[2024-05-29 12:23:36] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:23:36] [INFO ] Input system was already deterministic with 1069 transitions.
[2024-05-29 12:23:36] [INFO ] Flatten gal took : 21 ms
[2024-05-29 12:23:36] [INFO ] Flatten gal took : 19 ms
[2024-05-29 12:23:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality1330060832409217951.gal : 7 ms
[2024-05-29 12:23:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality4189665244143650549.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/CTLCardinality1330060832409217951.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4189665244143650549.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.07362e+10,23.6062,513076,2,30736,5,1.62065e+06,6,0,4387,2.22811e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:24:06] [INFO ] Flatten gal took : 22 ms
[2024-05-29 12:24:06] [INFO ] Applying decomposition
[2024-05-29 12:24:06] [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/graph17788662358835500948.txt' '-o' '/tmp/graph17788662358835500948.bin' '-w' '/tmp/graph17788662358835500948.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17788662358835500948.bin' '-l' '-1' '-v' '-w' '/tmp/graph17788662358835500948.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:24:06] [INFO ] Decomposing Gal with order
[2024-05-29 12:24:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:24:06] [INFO ] Removed a total of 869 redundant transitions.
[2024-05-29 12:24:06] [INFO ] Flatten gal took : 52 ms
[2024-05-29 12:24:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 8 ms.
[2024-05-29 12:24:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality1744216270253880593.gal : 7 ms
[2024-05-29 12:24:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality15589710684380478227.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/CTLCardinality1744216270253880593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15589710684380478227.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.07362e+10,8.95976,307036,2270,16,553627,885,1381,1.44243e+06,54,2844,0


Converting to forward existential form...Done !
original formula: EX(((EF(EX(EF(((i0.i1.i1.u65.p223==0)||(i28.u260.p913==1))))) * EX((((i33.u314.p1056==0)||(i5.u72.p240==1))||(i24.i1.i0.u241.p839==0)))) ...179
=> equivalent forward existential formula: [((EY(Init) * (E(TRUE U EX(E(TRUE U ((i0.i1.i1.u65.p223==0)||(i28.u260.p913==1))))) * EX((((i33.u314.p1056==0)||...248
Reverse transition relation is NOT exact ! Due to transitions t77, t163, t164, t221, t222, t256, t345, t401, t435, t574, t607, t617, t710, t787, t790, t793...628
(forward)formula 0,0,18.8075,470416,1,0,725986,945,11192,2.84924e+06,266,3641,2423113
FORMULA StigmergyCommit-PT-03b-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 969/969 places, 1214/1214 transitions.
Graph (trivial) has 956 edges and 969 vertex of which 72 / 969 are part of one of the 12 SCC in 3 ms
Free SCC test removed 60 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 678 transitions
Trivial Post-agglo rules discarded 678 transitions
Performed 678 trivial Post agglomeration. Transition count delta: 678
Iterating post reduction 0 with 678 rules applied. Total rules applied 679 place count 908 transition count 467
Reduce places removed 678 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 689 rules applied. Total rules applied 1368 place count 230 transition count 456
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 1375 place count 226 transition count 453
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1378 place count 223 transition count 453
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 1378 place count 223 transition count 405
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1474 place count 175 transition count 405
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1491 place count 158 transition count 388
Iterating global reduction 4 with 17 rules applied. Total rules applied 1508 place count 158 transition count 388
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1508 place count 158 transition count 386
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1512 place count 156 transition count 386
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1521 place count 147 transition count 325
Iterating global reduction 4 with 9 rules applied. Total rules applied 1530 place count 147 transition count 325
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1532 place count 147 transition count 323
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1535 place count 144 transition count 320
Iterating global reduction 5 with 3 rules applied. Total rules applied 1538 place count 144 transition count 320
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1541 place count 141 transition count 317
Iterating global reduction 5 with 3 rules applied. Total rules applied 1544 place count 141 transition count 317
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1545 place count 141 transition count 316
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 1593 place count 117 transition count 292
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1598 place count 117 transition count 287
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 1616 place count 99 transition count 196
Iterating global reduction 7 with 18 rules applied. Total rules applied 1634 place count 99 transition count 196
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1644 place count 99 transition count 186
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1655 place count 88 transition count 172
Iterating global reduction 8 with 11 rules applied. Total rules applied 1666 place count 88 transition count 172
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1677 place count 77 transition count 158
Iterating global reduction 8 with 11 rules applied. Total rules applied 1688 place count 77 transition count 158
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1693 place count 77 transition count 153
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 1695 place count 76 transition count 152
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1696 place count 75 transition count 147
Iterating global reduction 9 with 1 rules applied. Total rules applied 1697 place count 75 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1698 place count 75 transition count 146
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 1702 place count 75 transition count 142
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 1710 place count 71 transition count 138
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1713 place count 71 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1714 place count 70 transition count 137
Applied a total of 1714 rules in 60 ms. Remains 70 /969 variables (removed 899) and now considering 137/1214 (removed 1077) transitions.
[2024-05-29 12:24:25] [INFO ] Flow matrix only has 131 transitions (discarded 6 similar events)
// Phase 1: matrix 131 rows 70 cols
[2024-05-29 12:24:25] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 12:24:25] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 12:24:25] [INFO ] Flow matrix only has 131 transitions (discarded 6 similar events)
[2024-05-29 12:24:25] [INFO ] Invariant cache hit.
[2024-05-29 12:24:25] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 12:24:25] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-29 12:24:25] [INFO ] Redundant transitions in 1 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-29 12:24:25] [INFO ] Flow matrix only has 131 transitions (discarded 6 similar events)
[2024-05-29 12:24:25] [INFO ] Invariant cache hit.
[2024-05-29 12:24:25] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 4/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-29 12:24:26] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:24:26] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-29 12:24:26] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:24:26] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:24:26] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:24:26] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:24:26] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:24:26] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-05-29 12:24:26] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:24:26] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:24:26] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:24:26] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-29 12:24:27] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:24:27] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:24:27] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:24:27] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:24:27] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-29 12:24:27] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:24:27] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:24:27] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:24:27] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:24:27] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-29 12:24:28] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 130/200 variables, 70/95 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 14/109 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 1/201 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 12 (OVERLAPS) 0/201 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 110 constraints, problems are : Problem set: 0 solved, 128 unsolved in 5036 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 4/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 130/200 variables, 70/95 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 14/109 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 128/237 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 1/201 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-29 12:24:33] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:24:33] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 12 (OVERLAPS) 0/201 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 240 constraints, problems are : Problem set: 0 solved, 128 unsolved in 5245 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 25/25 constraints]
After SMT, in 10323ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 10324ms
Starting structural reductions in SI_CTL mode, iteration 1 : 70/969 places, 137/1214 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10509 ms. Remains : 70/969 places, 137/1214 transitions.
[2024-05-29 12:24:36] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:24:36] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:24:36] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-29 12:24:36] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:24:36] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:24:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality1548673322799594933.gal : 1 ms
[2024-05-29 12:24:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality10662626682162639594.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/CTLCardinality1548673322799594933.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10662626682162639594.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,82398,0.153423,10140,2,3159,5,23982,6,0,408,22592,0


Converting to forward existential form...Done !
original formula: AG((!(A(AG((p499==1)) U (p1143==1))) + ((p1113==0)&&(p681==1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(((p1113==0)&&(p681==1)))) * !(EG(!((p1143==1))))) * !(E(!((p1143==1)) U (!(!(E(TRUE U !(...197
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t11, t12, t13, t14, t17, t19, t21, t22, t23, t26, t27, t28, t49, t50, t51, t52, t53, ...348
(forward)formula 0,0,3.51477,118528,1,0,481,633146,299,221,3675,516232,531
FORMULA StigmergyCommit-PT-03b-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 969/969 places, 1214/1214 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 938 transition count 1183
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 938 transition count 1183
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 87 place count 913 transition count 1158
Iterating global reduction 0 with 25 rules applied. Total rules applied 112 place count 913 transition count 1158
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 130 place count 895 transition count 1140
Iterating global reduction 0 with 18 rules applied. Total rules applied 148 place count 895 transition count 1140
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 161 place count 882 transition count 1127
Iterating global reduction 0 with 13 rules applied. Total rules applied 174 place count 882 transition count 1127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 175 place count 882 transition count 1126
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 186 place count 871 transition count 1115
Iterating global reduction 1 with 11 rules applied. Total rules applied 197 place count 871 transition count 1115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 198 place count 871 transition count 1114
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 208 place count 861 transition count 1104
Iterating global reduction 2 with 10 rules applied. Total rules applied 218 place count 861 transition count 1104
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 228 place count 851 transition count 1094
Iterating global reduction 2 with 10 rules applied. Total rules applied 238 place count 851 transition count 1094
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 247 place count 842 transition count 1085
Iterating global reduction 2 with 9 rules applied. Total rules applied 256 place count 842 transition count 1085
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 263 place count 835 transition count 1078
Iterating global reduction 2 with 7 rules applied. Total rules applied 270 place count 835 transition count 1078
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 275 place count 830 transition count 1073
Iterating global reduction 2 with 5 rules applied. Total rules applied 280 place count 830 transition count 1073
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 281 place count 830 transition count 1072
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 285 place count 826 transition count 1068
Iterating global reduction 3 with 4 rules applied. Total rules applied 289 place count 826 transition count 1068
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 293 place count 822 transition count 1064
Iterating global reduction 3 with 4 rules applied. Total rules applied 297 place count 822 transition count 1064
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 301 place count 818 transition count 1060
Iterating global reduction 3 with 4 rules applied. Total rules applied 305 place count 818 transition count 1060
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 306 place count 818 transition count 1059
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 309 place count 815 transition count 1056
Iterating global reduction 4 with 3 rules applied. Total rules applied 312 place count 815 transition count 1056
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 315 place count 812 transition count 1053
Iterating global reduction 4 with 3 rules applied. Total rules applied 318 place count 812 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 319 place count 812 transition count 1052
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 321 place count 810 transition count 1050
Iterating global reduction 5 with 2 rules applied. Total rules applied 323 place count 810 transition count 1050
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 325 place count 808 transition count 1048
Iterating global reduction 5 with 2 rules applied. Total rules applied 327 place count 808 transition count 1048
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 329 place count 806 transition count 1046
Iterating global reduction 5 with 2 rules applied. Total rules applied 331 place count 806 transition count 1046
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 332 place count 806 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 333 place count 805 transition count 1044
Iterating global reduction 6 with 1 rules applied. Total rules applied 334 place count 805 transition count 1044
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 335 place count 804 transition count 1043
Iterating global reduction 6 with 1 rules applied. Total rules applied 336 place count 804 transition count 1043
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 337 place count 803 transition count 1042
Iterating global reduction 6 with 1 rules applied. Total rules applied 338 place count 803 transition count 1042
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 339 place count 802 transition count 1041
Iterating global reduction 6 with 1 rules applied. Total rules applied 340 place count 802 transition count 1041
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 341 place count 802 transition count 1040
Applied a total of 341 rules in 443 ms. Remains 802 /969 variables (removed 167) and now considering 1040/1214 (removed 174) transitions.
// Phase 1: matrix 1040 rows 802 cols
[2024-05-29 12:24:40] [INFO ] Computed 5 invariants in 6 ms
[2024-05-29 12:24:40] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-29 12:24:40] [INFO ] Invariant cache hit.
[2024-05-29 12:24:41] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
Running 1039 sub problems to find dead transitions.
[2024-05-29 12:24:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/801 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 1 (OVERLAPS) 1/802 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
[2024-05-29 12:25:09] [INFO ] Deduced a trap composed of 291 places in 258 ms of which 5 ms to minimize.
[2024-05-29 12:25:10] [INFO ] Deduced a trap composed of 298 places in 190 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 802/1842 variables, and 7 constraints, problems are : Problem set: 0 solved, 1039 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/802 constraints, PredecessorRefiner: 1039/1039 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1039 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/801 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 1 (OVERLAPS) 1/802 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/802 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
[2024-05-29 12:25:29] [INFO ] Deduced a trap composed of 290 places in 179 ms of which 4 ms to minimize.
[2024-05-29 12:25:30] [INFO ] Deduced a trap composed of 291 places in 207 ms of which 3 ms to minimize.
[2024-05-29 12:25:31] [INFO ] Deduced a trap composed of 298 places in 200 ms of which 4 ms to minimize.
[2024-05-29 12:25:31] [INFO ] Deduced a trap composed of 303 places in 191 ms of which 4 ms to minimize.
[2024-05-29 12:25:31] [INFO ] Deduced a trap composed of 303 places in 216 ms of which 4 ms to minimize.
[2024-05-29 12:25:32] [INFO ] Deduced a trap composed of 291 places in 210 ms of which 4 ms to minimize.
[2024-05-29 12:25:32] [INFO ] Deduced a trap composed of 297 places in 181 ms of which 4 ms to minimize.
[2024-05-29 12:25:33] [INFO ] Deduced a trap composed of 299 places in 182 ms of which 3 ms to minimize.
[2024-05-29 12:25:33] [INFO ] Deduced a trap composed of 291 places in 179 ms of which 3 ms to minimize.
[2024-05-29 12:25:35] [INFO ] Deduced a trap composed of 297 places in 187 ms of which 4 ms to minimize.
[2024-05-29 12:25:35] [INFO ] Deduced a trap composed of 296 places in 201 ms of which 4 ms to minimize.
[2024-05-29 12:25:35] [INFO ] Deduced a trap composed of 299 places in 242 ms of which 4 ms to minimize.
[2024-05-29 12:25:36] [INFO ] Deduced a trap composed of 290 places in 193 ms of which 3 ms to minimize.
[2024-05-29 12:25:36] [INFO ] Deduced a trap composed of 293 places in 218 ms of which 4 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 290 places in 275 ms of which 5 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 293 places in 238 ms of which 5 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 305 places in 236 ms of which 4 ms to minimize.
[2024-05-29 12:25:39] [INFO ] Deduced a trap composed of 299 places in 214 ms of which 4 ms to minimize.
[2024-05-29 12:25:39] [INFO ] Deduced a trap composed of 304 places in 175 ms of which 4 ms to minimize.
[2024-05-29 12:25:39] [INFO ] Deduced a trap composed of 305 places in 170 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/802 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
[2024-05-29 12:25:40] [INFO ] Deduced a trap composed of 305 places in 195 ms of which 3 ms to minimize.
[2024-05-29 12:25:41] [INFO ] Deduced a trap composed of 399 places in 217 ms of which 4 ms to minimize.
[2024-05-29 12:25:41] [INFO ] Deduced a trap composed of 303 places in 184 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 802/1842 variables, and 30 constraints, problems are : Problem set: 0 solved, 1039 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/802 constraints, PredecessorRefiner: 0/1039 constraints, Known Traps: 25/25 constraints]
After SMT, in 60371ms problems are : Problem set: 0 solved, 1039 unsolved
Search for dead transitions found 0 dead transitions in 60383ms
Starting structural reductions in LTL mode, iteration 1 : 802/969 places, 1040/1214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61504 ms. Remains : 802/969 places, 1040/1214 transitions.
[2024-05-29 12:25:41] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:25:41] [INFO ] Flatten gal took : 19 ms
[2024-05-29 12:25:41] [INFO ] Input system was already deterministic with 1040 transitions.
[2024-05-29 12:25:41] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:25:41] [INFO ] Flatten gal took : 19 ms
[2024-05-29 12:25:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality15638974018056168327.gal : 6 ms
[2024-05-29 12:25:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality1167694113771619027.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/CTLCardinality15638974018056168327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1167694113771619027.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.79208e+09,19.4934,475984,2,29814,5,1.52556e+06,6,0,4250,2.05038e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:26:11] [INFO ] Flatten gal took : 25 ms
[2024-05-29 12:26:11] [INFO ] Applying decomposition
[2024-05-29 12:26:11] [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/graph17616447098686336507.txt' '-o' '/tmp/graph17616447098686336507.bin' '-w' '/tmp/graph17616447098686336507.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17616447098686336507.bin' '-l' '-1' '-v' '-w' '/tmp/graph17616447098686336507.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:26:11] [INFO ] Decomposing Gal with order
[2024-05-29 12:26:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:26:11] [INFO ] Removed a total of 862 redundant transitions.
[2024-05-29 12:26:11] [INFO ] Flatten gal took : 41 ms
[2024-05-29 12:26:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 10 ms.
[2024-05-29 12:26:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality3390205661707198824.gal : 7 ms
[2024-05-29 12:26:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality17842743536951398068.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/CTLCardinality3390205661707198824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17842743536951398068.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.79208e+09,7.82214,279212,2455,20,549403,1202,1308,1.19291e+06,56,3474,0


Converting to forward existential form...Done !
original formula: A(EF(EX((i25.i1.i1.u228.p816==0))) U EG(EF(AX(AG((i25.i1.i3.u239.p881==0))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG(E(TRUE U !(EX(!(!(E(TRUE U !((i25.i1.i3.u239.p881==0))))))))))))) * !(E(!(EG(E(TRUE U !(EX(!...331
Reverse transition relation is NOT exact ! Due to transitions t76, t159, t215, t254, t343, t396, t399, t433, t516, t569, t572, t605, t744, t764, t765, t768...612
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 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 : 969/969 places, 1214/1214 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 937 transition count 1182
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 937 transition count 1182
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 90 place count 911 transition count 1156
Iterating global reduction 0 with 26 rules applied. Total rules applied 116 place count 911 transition count 1156
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 135 place count 892 transition count 1137
Iterating global reduction 0 with 19 rules applied. Total rules applied 154 place count 892 transition count 1137
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 169 place count 877 transition count 1122
Iterating global reduction 0 with 15 rules applied. Total rules applied 184 place count 877 transition count 1122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 185 place count 877 transition count 1121
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 198 place count 864 transition count 1108
Iterating global reduction 1 with 13 rules applied. Total rules applied 211 place count 864 transition count 1108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 212 place count 864 transition count 1107
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 223 place count 853 transition count 1096
Iterating global reduction 2 with 11 rules applied. Total rules applied 234 place count 853 transition count 1096
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 245 place count 842 transition count 1085
Iterating global reduction 2 with 11 rules applied. Total rules applied 256 place count 842 transition count 1085
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 266 place count 832 transition count 1075
Iterating global reduction 2 with 10 rules applied. Total rules applied 276 place count 832 transition count 1075
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 285 place count 823 transition count 1066
Iterating global reduction 2 with 9 rules applied. Total rules applied 294 place count 823 transition count 1066
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 295 place count 823 transition count 1065
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 300 place count 818 transition count 1060
Iterating global reduction 3 with 5 rules applied. Total rules applied 305 place count 818 transition count 1060
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 306 place count 818 transition count 1059
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 310 place count 814 transition count 1055
Iterating global reduction 4 with 4 rules applied. Total rules applied 314 place count 814 transition count 1055
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 318 place count 810 transition count 1051
Iterating global reduction 4 with 4 rules applied. Total rules applied 322 place count 810 transition count 1051
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 325 place count 807 transition count 1048
Iterating global reduction 4 with 3 rules applied. Total rules applied 328 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 329 place count 807 transition count 1047
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 331 place count 805 transition count 1045
Iterating global reduction 5 with 2 rules applied. Total rules applied 333 place count 805 transition count 1045
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 335 place count 803 transition count 1043
Iterating global reduction 5 with 2 rules applied. Total rules applied 337 place count 803 transition count 1043
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 339 place count 801 transition count 1041
Iterating global reduction 5 with 2 rules applied. Total rules applied 341 place count 801 transition count 1041
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 343 place count 799 transition count 1039
Iterating global reduction 5 with 2 rules applied. Total rules applied 345 place count 799 transition count 1039
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 347 place count 797 transition count 1037
Iterating global reduction 5 with 2 rules applied. Total rules applied 349 place count 797 transition count 1037
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 350 place count 797 transition count 1036
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 351 place count 796 transition count 1035
Iterating global reduction 6 with 1 rules applied. Total rules applied 352 place count 796 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 353 place count 795 transition count 1034
Iterating global reduction 6 with 1 rules applied. Total rules applied 354 place count 795 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 355 place count 794 transition count 1033
Iterating global reduction 6 with 1 rules applied. Total rules applied 356 place count 794 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 357 place count 793 transition count 1032
Iterating global reduction 6 with 1 rules applied. Total rules applied 358 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 359 place count 793 transition count 1031
Applied a total of 359 rules in 436 ms. Remains 793 /969 variables (removed 176) and now considering 1031/1214 (removed 183) transitions.
// Phase 1: matrix 1031 rows 793 cols
[2024-05-29 12:26:42] [INFO ] Computed 5 invariants in 13 ms
[2024-05-29 12:26:42] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-29 12:26:42] [INFO ] Invariant cache hit.
[2024-05-29 12:26:43] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
Running 1030 sub problems to find dead transitions.
[2024-05-29 12:26:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/792 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 1 (OVERLAPS) 1/793 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
[2024-05-29 12:27:11] [INFO ] Deduced a trap composed of 300 places in 263 ms of which 5 ms to minimize.
[2024-05-29 12:27:12] [INFO ] Deduced a trap composed of 291 places in 202 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 793/1824 variables, and 7 constraints, problems are : Problem set: 0 solved, 1030 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/793 constraints, PredecessorRefiner: 1030/1030 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1030 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/792 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 1 (OVERLAPS) 1/793 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/793 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
[2024-05-29 12:27:30] [INFO ] Deduced a trap composed of 300 places in 211 ms of which 4 ms to minimize.
[2024-05-29 12:27:32] [INFO ] Deduced a trap composed of 300 places in 213 ms of which 3 ms to minimize.
[2024-05-29 12:27:32] [INFO ] Deduced a trap composed of 294 places in 263 ms of which 5 ms to minimize.
[2024-05-29 12:27:32] [INFO ] Deduced a trap composed of 298 places in 259 ms of which 5 ms to minimize.
[2024-05-29 12:27:33] [INFO ] Deduced a trap composed of 294 places in 237 ms of which 4 ms to minimize.
[2024-05-29 12:27:34] [INFO ] Deduced a trap composed of 298 places in 231 ms of which 4 ms to minimize.
[2024-05-29 12:27:37] [INFO ] Deduced a trap composed of 292 places in 219 ms of which 4 ms to minimize.
[2024-05-29 12:27:37] [INFO ] Deduced a trap composed of 292 places in 202 ms of which 3 ms to minimize.
[2024-05-29 12:27:37] [INFO ] Deduced a trap composed of 299 places in 183 ms of which 4 ms to minimize.
[2024-05-29 12:27:38] [INFO ] Deduced a trap composed of 298 places in 193 ms of which 4 ms to minimize.
[2024-05-29 12:27:39] [INFO ] Deduced a trap composed of 293 places in 188 ms of which 3 ms to minimize.
[2024-05-29 12:27:42] [INFO ] Deduced a trap composed of 292 places in 220 ms of which 4 ms to minimize.
[2024-05-29 12:27:42] [INFO ] Deduced a trap composed of 293 places in 226 ms of which 5 ms to minimize.
[2024-05-29 12:27:42] [INFO ] Deduced a trap composed of 299 places in 186 ms of which 3 ms to minimize.
[2024-05-29 12:27:43] [INFO ] Deduced a trap composed of 297 places in 281 ms of which 4 ms to minimize.
SMT process timed out in 60471ms, After SMT, problems are : Problem set: 0 solved, 1030 unsolved
Search for dead transitions found 0 dead transitions in 60485ms
Starting structural reductions in LTL mode, iteration 1 : 793/969 places, 1031/1214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61674 ms. Remains : 793/969 places, 1031/1214 transitions.
[2024-05-29 12:27:43] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:27:43] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:27:43] [INFO ] Input system was already deterministic with 1031 transitions.
[2024-05-29 12:27:43] [INFO ] Flatten gal took : 18 ms
[2024-05-29 12:27:43] [INFO ] Flatten gal took : 19 ms
[2024-05-29 12:27:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality1915131568485450025.gal : 4 ms
[2024-05-29 12:27:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality15236034336842130373.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/CTLCardinality1915131568485450025.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15236034336842130373.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.61067e+09,20.4189,455808,2,27373,5,1.38128e+06,6,0,4205,1.94145e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:28:13] [INFO ] Flatten gal took : 21 ms
[2024-05-29 12:28:13] [INFO ] Applying decomposition
[2024-05-29 12:28:13] [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/graph15393977567513703047.txt' '-o' '/tmp/graph15393977567513703047.bin' '-w' '/tmp/graph15393977567513703047.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15393977567513703047.bin' '-l' '-1' '-v' '-w' '/tmp/graph15393977567513703047.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:28:13] [INFO ] Decomposing Gal with order
[2024-05-29 12:28:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:28:13] [INFO ] Removed a total of 856 redundant transitions.
[2024-05-29 12:28:13] [INFO ] Flatten gal took : 41 ms
[2024-05-29 12:28:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-29 12:28:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality12878160220313719264.gal : 7 ms
[2024-05-29 12:28:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality15644291982500360989.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/CTLCardinality12878160220313719264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15644291982500360989.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,9.61067e+09,4.7405,162404,2165,14,282996,885,1257,831063,47,2535,0


Converting to forward existential form...Done !
original formula: EX(AF(!(A(!(((i4.u38.p112==1)||(i24.u222.p841==1))) U ((i31.u288.p1032==0)||(i19.u173.p644==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(!((E(!(((i31.u288.p1032==0)||(i19.u173.p644==1))) U (!(!(((i4.u38.p112==1)||(i24.u222.p841...279
Reverse transition relation is NOT exact ! Due to transitions t76, t103, t159, t249, t280, t336, t392, t426, t508, t509, t565, t598, t681, t757, t758, t761...579
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 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 LTL mode, iteration 0 : 969/969 places, 1214/1214 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 940 transition count 1185
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 940 transition count 1185
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 83 place count 915 transition count 1160
Iterating global reduction 0 with 25 rules applied. Total rules applied 108 place count 915 transition count 1160
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 124 place count 899 transition count 1144
Iterating global reduction 0 with 16 rules applied. Total rules applied 140 place count 899 transition count 1144
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 153 place count 886 transition count 1131
Iterating global reduction 0 with 13 rules applied. Total rules applied 166 place count 886 transition count 1131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 167 place count 886 transition count 1130
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 178 place count 875 transition count 1119
Iterating global reduction 1 with 11 rules applied. Total rules applied 189 place count 875 transition count 1119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 190 place count 875 transition count 1118
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 200 place count 865 transition count 1108
Iterating global reduction 2 with 10 rules applied. Total rules applied 210 place count 865 transition count 1108
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 220 place count 855 transition count 1098
Iterating global reduction 2 with 10 rules applied. Total rules applied 230 place count 855 transition count 1098
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 239 place count 846 transition count 1089
Iterating global reduction 2 with 9 rules applied. Total rules applied 248 place count 846 transition count 1089
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 255 place count 839 transition count 1082
Iterating global reduction 2 with 7 rules applied. Total rules applied 262 place count 839 transition count 1082
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 267 place count 834 transition count 1077
Iterating global reduction 2 with 5 rules applied. Total rules applied 272 place count 834 transition count 1077
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 273 place count 834 transition count 1076
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 277 place count 830 transition count 1072
Iterating global reduction 3 with 4 rules applied. Total rules applied 281 place count 830 transition count 1072
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 285 place count 826 transition count 1068
Iterating global reduction 3 with 4 rules applied. Total rules applied 289 place count 826 transition count 1068
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 293 place count 822 transition count 1064
Iterating global reduction 3 with 4 rules applied. Total rules applied 297 place count 822 transition count 1064
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 298 place count 822 transition count 1063
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 301 place count 819 transition count 1060
Iterating global reduction 4 with 3 rules applied. Total rules applied 304 place count 819 transition count 1060
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 307 place count 816 transition count 1057
Iterating global reduction 4 with 3 rules applied. Total rules applied 310 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 311 place count 816 transition count 1056
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 313 place count 814 transition count 1054
Iterating global reduction 5 with 2 rules applied. Total rules applied 315 place count 814 transition count 1054
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 317 place count 812 transition count 1052
Iterating global reduction 5 with 2 rules applied. Total rules applied 319 place count 812 transition count 1052
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 321 place count 810 transition count 1050
Iterating global reduction 5 with 2 rules applied. Total rules applied 323 place count 810 transition count 1050
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 324 place count 810 transition count 1049
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 325 place count 809 transition count 1048
Iterating global reduction 6 with 1 rules applied. Total rules applied 326 place count 809 transition count 1048
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 327 place count 808 transition count 1047
Iterating global reduction 6 with 1 rules applied. Total rules applied 328 place count 808 transition count 1047
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 329 place count 807 transition count 1046
Iterating global reduction 6 with 1 rules applied. Total rules applied 330 place count 807 transition count 1046
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 331 place count 806 transition count 1045
Iterating global reduction 6 with 1 rules applied. Total rules applied 332 place count 806 transition count 1045
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 333 place count 806 transition count 1044
Applied a total of 333 rules in 484 ms. Remains 806 /969 variables (removed 163) and now considering 1044/1214 (removed 170) transitions.
// Phase 1: matrix 1044 rows 806 cols
[2024-05-29 12:28:44] [INFO ] Computed 5 invariants in 13 ms
[2024-05-29 12:28:44] [INFO ] Implicit Places using invariants in 201 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 550 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
Running 1043 sub problems to find dead transitions.
[2024-05-29 12:28:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/805 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
At refinement iteration 1 (OVERLAPS) 1/806 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
[2024-05-29 12:29:10] [INFO ] Deduced a trap composed of 291 places in 205 ms of which 4 ms to minimize.
[2024-05-29 12:29:10] [INFO ] Deduced a trap composed of 299 places in 198 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 806/1850 variables, and 7 constraints, problems are : Problem set: 0 solved, 1043 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/806 constraints, PredecessorRefiner: 1043/1043 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1043 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/805 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
At refinement iteration 1 (OVERLAPS) 1/806 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/806 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
[2024-05-29 12:29:34] [INFO ] Deduced a trap composed of 306 places in 191 ms of which 4 ms to minimize.
[2024-05-29 12:29:36] [INFO ] Deduced a trap composed of 307 places in 201 ms of which 4 ms to minimize.
[2024-05-29 12:29:36] [INFO ] Deduced a trap composed of 298 places in 242 ms of which 5 ms to minimize.
[2024-05-29 12:29:36] [INFO ] Deduced a trap composed of 298 places in 241 ms of which 5 ms to minimize.
[2024-05-29 12:29:37] [INFO ] Deduced a trap composed of 305 places in 201 ms of which 4 ms to minimize.
[2024-05-29 12:29:37] [INFO ] Deduced a trap composed of 298 places in 220 ms of which 5 ms to minimize.
[2024-05-29 12:29:40] [INFO ] Deduced a trap composed of 305 places in 257 ms of which 4 ms to minimize.
[2024-05-29 12:29:41] [INFO ] Deduced a trap composed of 294 places in 210 ms of which 3 ms to minimize.
[2024-05-29 12:29:42] [INFO ] Deduced a trap composed of 300 places in 223 ms of which 4 ms to minimize.
[2024-05-29 12:29:42] [INFO ] Deduced a trap composed of 292 places in 224 ms of which 4 ms to minimize.
[2024-05-29 12:29:43] [INFO ] Deduced a trap composed of 298 places in 217 ms of which 4 ms to minimize.
[2024-05-29 12:29:43] [INFO ] Deduced a trap composed of 293 places in 205 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/1850 variables, and 19 constraints, problems are : Problem set: 0 solved, 1043 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/806 constraints, PredecessorRefiner: 0/1043 constraints, Known Traps: 14/14 constraints]
After SMT, in 60417ms problems are : Problem set: 0 solved, 1043 unsolved
Search for dead transitions found 0 dead transitions in 60429ms
Starting structural reductions in LTL mode, iteration 1 : 806/969 places, 1044/1214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61669 ms. Remains : 806/969 places, 1044/1214 transitions.
[2024-05-29 12:29:45] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:29:45] [INFO ] Flatten gal took : 22 ms
[2024-05-29 12:29:45] [INFO ] Input system was already deterministic with 1044 transitions.
[2024-05-29 12:29:45] [INFO ] Flatten gal took : 18 ms
[2024-05-29 12:29:45] [INFO ] Flatten gal took : 19 ms
[2024-05-29 12:29:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality15130941998833330468.gal : 4 ms
[2024-05-29 12:29:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality307891862756756325.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/CTLCardinality15130941998833330468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality307891862756756325.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,9.91621e+09,21.7851,498268,2,28736,5,1.53084e+06,6,0,4270,2.20633e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:30:15] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:30:15] [INFO ] Applying decomposition
[2024-05-29 12:30:15] [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/graph2881983344189553646.txt' '-o' '/tmp/graph2881983344189553646.bin' '-w' '/tmp/graph2881983344189553646.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2881983344189553646.bin' '-l' '-1' '-v' '-w' '/tmp/graph2881983344189553646.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 865 redundant transitions.
[2024-05-29 12:30:16] [INFO ] Flatten gal took : 49 ms
[2024-05-29 12:30:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 12:30:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality5508748950791929419.gal : 19 ms
[2024-05-29 12:30:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality6710296720652072115.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/CTLCardinality5508748950791929419.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6710296720652072115.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.91621e+09,6.05132,204496,2429,15,351534,1107,1267,1.13466e+06,47,3313,0


Converting to forward existential form...Done !
original formula: ((AG(EF(((i7.i1.i1.u336.p1229!=0)&&(i29.u280.p974!=1)))) + EF(!(E(((i15.u115.p388==0)||(i12.i1.i1.u110.p369==1)) U AG((i23.u233.p813==1))...330
=> equivalent forward existential formula: [FwdG(((Init * !((!(E(TRUE U !(E(TRUE U ((i7.i1.i1.u336.p1229!=0)&&(i29.u280.p974!=1)))))) + E(TRUE U !(E(((i15....447
Reverse transition relation is NOT exact ! Due to transitions t24, t77, t161, t162, t216, t218, t255, t345, t401, t435, t518, t571, t574, t607, t634, t691,...590
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found a local SCC at level 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.
[2024-05-29 12:30:46] [INFO ] Flatten gal took : 27 ms
[2024-05-29 12:30:46] [INFO ] Flatten gal took : 24 ms
[2024-05-29 12:30:46] [INFO ] Applying decomposition
[2024-05-29 12:30:46] [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/graph6048772888500982952.txt' '-o' '/tmp/graph6048772888500982952.bin' '-w' '/tmp/graph6048772888500982952.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6048772888500982952.bin' '-l' '-1' '-v' '-w' '/tmp/graph6048772888500982952.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:30:46] [INFO ] Decomposing Gal with order
[2024-05-29 12:30:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:30:46] [INFO ] Removed a total of 884 redundant transitions.
[2024-05-29 12:30:46] [INFO ] Flatten gal took : 60 ms
[2024-05-29 12:30:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 18 ms.
[2024-05-29 12:30:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality12537871858827005408.gal : 46 ms
[2024-05-29 12:30:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality10729819096313915852.ctl : 112 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/CTLCardinality12537871858827005408.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10729819096313915852.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 6 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.74873e+10,11.9688,411016,3498,20,593401,1399,1513,2.748e+06,57,4911,0


Converting to forward existential form...Done !
original formula: (E((EF(((i34.i2.i0.u361.p1092==0)||(i19.i1.i1.u190.p591==1))) + (i9.u101.p304==0)) U !(((AX(!(AX(((i25.i0.i0.u265.p814==0)||(i12.u127.p36...642
=> equivalent forward existential formula: [(((Init * E((E(TRUE U ((i34.i2.i0.u361.p1092==0)||(i19.i1.i1.u190.p591==1))) + (i9.u101.p304==0)) U !(((!(EX(!(...1062
Reverse transition relation is NOT exact ! Due to transitions t17, t26, t27, t85, t195, t196, t254, t293, t409, t464, t466, t506, t607, t609, t610, t666, t...742
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-29 12:33:10] [INFO ] Applying decomposition
[2024-05-29 12:33:10] [INFO ] Flatten gal took : 24 ms
[2024-05-29 12:33:10] [INFO ] Decomposing Gal with order
[2024-05-29 12:33:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:33:10] [INFO ] Removed a total of 754 redundant transitions.
[2024-05-29 12:33:10] [INFO ] Flatten gal took : 44 ms
[2024-05-29 12:33:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 272 labels/synchronizations in 7 ms.
[2024-05-29 12:33:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality7729754245644240152.gal : 3 ms
[2024-05-29 12:33:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality10091559160068918776.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/CTLCardinality7729754245644240152.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10091559160068918776.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 6 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.74873e+10,2.98306,98640,230,11855,10668,213450,140,38426,1924,1.33766e+06,0


Converting to forward existential form...Done !
original formula: (E((EF(((i0.u7.p1092==0)||(i0.i0.i0.u5.p591==1))) + (i0.i0.i0.u4.p304==0)) U !(((AX(!(AX(((i0.i0.u6.p814==0)||(i0.i0.i0.u5.p367==1))))) +...616
=> equivalent forward existential formula: [(((Init * E((E(TRUE U ((i0.u7.p1092==0)||(i0.i0.i0.u5.p591==1))) + (i0.i0.i0.u4.p304==0)) U !(((!(EX(!(!(!(EX(!...1016
Reverse transition relation is NOT exact ! Due to transitions t908, u8.t42, u8.t54, i0.u7.t85, i0.u7.t86, i0.u7.t89, i0.u7.t97, i0.u7.t116, i0.u7.t124, i0....1007
ITS-tools command line returned an error code 137
[2024-05-29 12:42:04] [INFO ] Flatten gal took : 27 ms
[2024-05-29 12:42:04] [INFO ] Input system was already deterministic with 1214 transitions.
[2024-05-29 12:42:04] [INFO ] Transformed 969 places.
[2024-05-29 12:42:04] [INFO ] Transformed 1214 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 12:42:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality4908941437659673914.gal : 4 ms
[2024-05-29 12:42:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality9822218802067356971.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/CTLCardinality4908941437659673914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9822218802067356971.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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 6 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.74873e+10,28.9269,586008,2,80267,5,2.00899e+06,6,0,5092,1.54397e+06,0


Converting to forward existential form...Done !
original formula: (E((EF(((p1092==0)||(p591==1))) + (p304==0)) U !(((AX(!(AX(((p814==0)||(p367==1))))) + !(((p425==0)||(p390==1)))) + (AG((p469==1)) * AF((...388
=> equivalent forward existential formula: [(((Init * E((E(TRUE U ((p1092==0)||(p591==1))) + (p304==0)) U !(((!(EX(!(!(!(EX(!(((p814==0)||(p367==1)))))))))...716
Reverse transition relation is NOT exact ! Due to transitions t17, t26, t27, t28, t42, t54, t85, t86, t89, t97, t116, t124, t129, t139, t194, t195, t196, t...520
Detected timeout of ITS tools.
Total runtime 3232398 ms.

BK_STOP 1716988062802

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-03b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-03b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690531600113"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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