fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r400-tall-171690531800185
Last Updated
July 7, 2024

About the Execution of ITS-Tools for StigmergyCommit-PT-08a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5564.464 1574797.00 1720554.00 3200.30 TTTFFTTTTFTFFTTT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 11 17:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 17:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 17:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 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 17M 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-08a-CTLCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-08a-CTLCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-08a-CTLCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-08a-CTLCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-08a-CTLCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-08a-CTLCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-08a-CTLCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-08a-CTLCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-08a-CTLCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-08a-CTLCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-08a-CTLCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-08a-CTLCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-08a-CTLCardinality-2023-12
FORMULA_NAME StigmergyCommit-PT-08a-CTLCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-08a-CTLCardinality-2023-14
FORMULA_NAME StigmergyCommit-PT-08a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716991631358

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-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 14:07:12] [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 14:07:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:07:13] [INFO ] Load time of PNML (sax parser for PT used): 859 ms
[2024-05-29 14:07:13] [INFO ] Transformed 328 places.
[2024-05-29 14:07:13] [INFO ] Transformed 18744 transitions.
[2024-05-29 14:07:13] [INFO ] Found NUPN structural information;
[2024-05-29 14:07:13] [INFO ] Parsed PT model containing 328 places and 18744 transitions and 330279 arcs in 1075 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
Support contains 111 out of 328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 328/328 places, 1449/1449 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 288 transition count 1407
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 288 transition count 1407
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 83 place count 288 transition count 1404
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 90 place count 281 transition count 1396
Iterating global reduction 1 with 7 rules applied. Total rules applied 97 place count 281 transition count 1396
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 99 place count 281 transition count 1394
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 280 transition count 1393
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 280 transition count 1393
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 279 transition count 1392
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 279 transition count 1392
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 278 transition count 1391
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 278 transition count 1391
Applied a total of 105 rules in 105 ms. Remains 278 /328 variables (removed 50) and now considering 1391/1449 (removed 58) transitions.
[2024-05-29 14:07:13] [INFO ] Flow matrix only has 1371 transitions (discarded 20 similar events)
// Phase 1: matrix 1371 rows 278 cols
[2024-05-29 14:07:14] [INFO ] Computed 5 invariants in 28 ms
[2024-05-29 14:07:14] [INFO ] Implicit Places using invariants in 577 ms returned []
[2024-05-29 14:07:14] [INFO ] Flow matrix only has 1371 transitions (discarded 20 similar events)
[2024-05-29 14:07:14] [INFO ] Invariant cache hit.
[2024-05-29 14:07:14] [INFO ] State equation strengthened by 1140 read => feed constraints.
[2024-05-29 14:07:18] [INFO ] Implicit Places using invariants and state equation in 3738 ms returned [277]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4403 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 277/328 places, 1391/1449 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 269 transition count 1383
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 269 transition count 1383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 269 transition count 1382
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 266 transition count 1379
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 266 transition count 1379
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 264 transition count 1377
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 264 transition count 1377
Applied a total of 27 rules in 38 ms. Remains 264 /277 variables (removed 13) and now considering 1377/1391 (removed 14) transitions.
[2024-05-29 14:07:18] [INFO ] Flow matrix only has 1357 transitions (discarded 20 similar events)
// Phase 1: matrix 1357 rows 264 cols
[2024-05-29 14:07:18] [INFO ] Computed 4 invariants in 15 ms
[2024-05-29 14:07:18] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-29 14:07:18] [INFO ] Flow matrix only has 1357 transitions (discarded 20 similar events)
[2024-05-29 14:07:18] [INFO ] Invariant cache hit.
[2024-05-29 14:07:19] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:07:19] [INFO ] Implicit Places using invariants and state equation in 830 ms returned []
Implicit Place search using SMT with State Equation took 1031 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 264/328 places, 1377/1449 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5606 ms. Remains : 264/328 places, 1377/1449 transitions.
Support contains 111 out of 264 places after structural reductions.
[2024-05-29 14:07:19] [INFO ] Flatten gal took : 207 ms
[2024-05-29 14:07:19] [INFO ] Flatten gal took : 110 ms
[2024-05-29 14:07:20] [INFO ] Input system was already deterministic with 1377 transitions.
Support contains 109 out of 264 places (down from 111) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 3880 ms. (10 steps per ms) remains 33/71 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 33/33 properties
[2024-05-29 14:07:21] [INFO ] Flow matrix only has 1357 transitions (discarded 20 similar events)
[2024-05-29 14:07:21] [INFO ] Invariant cache hit.
[2024-05-29 14:07:21] [INFO ] State equation strengthened by 1030 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 206/264 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 1356/1620 variables, 264/268 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1620 variables, 1029/1297 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1620 variables, 0/1297 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 1/1621 variables, 1/1298 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1621 variables, 0/1298 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/1621 variables, 0/1298 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1621/1621 variables, and 1298 constraints, problems are : Problem set: 0 solved, 33 unsolved in 4778 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 264/264 constraints, ReadFeed: 1030/1030 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 206/264 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 32 unsolved
[2024-05-29 14:07:26] [INFO ] Deduced a trap composed of 16 places in 414 ms of which 19 ms to minimize.
[2024-05-29 14:07:27] [INFO ] Deduced a trap composed of 17 places in 323 ms of which 2 ms to minimize.
[2024-05-29 14:07:27] [INFO ] Deduced a trap composed of 17 places in 291 ms of which 2 ms to minimize.
[2024-05-29 14:07:27] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 1 ms to minimize.
[2024-05-29 14:07:28] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 1 ms to minimize.
[2024-05-29 14:07:28] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 1 ms to minimize.
[2024-05-29 14:07:28] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 2 ms to minimize.
[2024-05-29 14:07:28] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 2 ms to minimize.
[2024-05-29 14:07:28] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 6 ms to minimize.
[2024-05-29 14:07:29] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 2 ms to minimize.
[2024-05-29 14:07:29] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 2 ms to minimize.
[2024-05-29 14:07:29] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 1 ms to minimize.
[2024-05-29 14:07:29] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 1 ms to minimize.
[2024-05-29 14:07:29] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 1 ms to minimize.
[2024-05-29 14:07:29] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:07:30] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2024-05-29 14:07:30] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:07:30] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2024-05-29 14:07:30] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-29 14:07:30] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/24 constraints. Problems are: Problem set: 3 solved, 30 unsolved
[2024-05-29 14:07:30] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 1 ms to minimize.
[2024-05-29 14:07:30] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-05-29 14:07:30] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 2 ms to minimize.
[2024-05-29 14:07:31] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 1 ms to minimize.
[2024-05-29 14:07:31] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 1 ms to minimize.
SMT process timed out in 9995ms, After SMT, problems are : Problem set: 3 solved, 30 unsolved
Fused 30 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 47 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 1377/1377 transitions.
Graph (complete) has 576 edges and 264 vertex of which 263 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 137 rules applied. Total rules applied 138 place count 263 transition count 1239
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 143 rules applied. Total rules applied 281 place count 152 transition count 1207
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 23 rules applied. Total rules applied 304 place count 142 transition count 1194
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 317 place count 131 transition count 1192
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 317 place count 131 transition count 1182
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 337 place count 121 transition count 1182
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 351 place count 107 transition count 1167
Iterating global reduction 4 with 14 rules applied. Total rules applied 365 place count 107 transition count 1167
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 372 place count 107 transition count 1160
Performed 17 Post agglomeration using F-continuation condition with reduction of 804 identical transitions.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 406 place count 90 transition count 339
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 175 transitions
Reduce isomorphic transitions removed 182 transitions.
Iterating post reduction 5 with 182 rules applied. Total rules applied 588 place count 90 transition count 157
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 6 with 2 rules applied. Total rules applied 590 place count 89 transition count 156
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 606 place count 89 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 7 with 23 rules applied. Total rules applied 629 place count 89 transition count 117
Free-agglomeration rule applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 639 place count 89 transition count 107
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 649 place count 79 transition count 107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 650 place count 78 transition count 106
Applied a total of 650 rules in 146 ms. Remains 78 /264 variables (removed 186) and now considering 106/1377 (removed 1271) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 78/264 places, 106/1377 transitions.
RANDOM walk for 40000 steps (323 resets) in 310 ms. (128 steps per ms) remains 4/30 properties
BEST_FIRST walk for 40003 steps (44 resets) in 35 ms. (1111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (37 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (50 resets) in 41 ms. (952 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (43 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
// Phase 1: matrix 106 rows 78 cols
[2024-05-29 14:07:31] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 14:07:31] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 55/71 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 97/168 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 19/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 8/176 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 5/181 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 3/184 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/184 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 107 constraints, problems are : Problem set: 0 solved, 4 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 78/78 constraints, ReadFeed: 20/20 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 55/71 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:07:32] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-29 14:07:32] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-29 14:07:32] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-29 14:07:32] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-29 14:07:32] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
[2024-05-29 14:07:32] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-29 14:07:32] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:07:32] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-29 14:07:32] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
[2024-05-29 14:07:32] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-29 14:07:32] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:07:32] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem AtomicPropp51 is UNSAT
[2024-05-29 14:07:32] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:07:32] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem AtomicPropp69 is UNSAT
After SMT solving in domain Int declared 71/184 variables, and 22 constraints, problems are : Problem set: 4 solved, 0 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 8/9 constraints, State Equation: 0/78 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 14/14 constraints]
After SMT, in 605ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA StigmergyCommit-PT-08a-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 14:07:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 14:07:32] [INFO ] Flatten gal took : 73 ms
FORMULA StigmergyCommit-PT-08a-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 14:07:32] [INFO ] Flatten gal took : 75 ms
[2024-05-29 14:07:32] [INFO ] Input system was already deterministic with 1377 transitions.
Support contains 84 out of 264 places (down from 89) after GAL structural reductions.
Computed a total of 47 stabilizing places and 47 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 1377/1377 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 217 transition count 1323
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 217 transition count 1323
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 107 place count 217 transition count 1310
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 133 place count 191 transition count 1279
Iterating global reduction 1 with 26 rules applied. Total rules applied 159 place count 191 transition count 1279
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 164 place count 191 transition count 1274
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 180 place count 175 transition count 1258
Iterating global reduction 2 with 16 rules applied. Total rules applied 196 place count 175 transition count 1258
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 205 place count 166 transition count 1249
Iterating global reduction 2 with 9 rules applied. Total rules applied 214 place count 166 transition count 1249
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 219 place count 161 transition count 1244
Iterating global reduction 2 with 5 rules applied. Total rules applied 224 place count 161 transition count 1244
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 229 place count 156 transition count 1239
Iterating global reduction 2 with 5 rules applied. Total rules applied 234 place count 156 transition count 1239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 235 place count 156 transition count 1238
Applied a total of 235 rules in 36 ms. Remains 156 /264 variables (removed 108) and now considering 1238/1377 (removed 139) transitions.
[2024-05-29 14:07:32] [INFO ] Flow matrix only has 1226 transitions (discarded 12 similar events)
// Phase 1: matrix 1226 rows 156 cols
[2024-05-29 14:07:32] [INFO ] Computed 2 invariants in 9 ms
[2024-05-29 14:07:33] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-29 14:07:33] [INFO ] Flow matrix only has 1226 transitions (discarded 12 similar events)
[2024-05-29 14:07:33] [INFO ] Invariant cache hit.
[2024-05-29 14:07:33] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:07:34] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1232 ms to find 0 implicit places.
Running 1237 sub problems to find dead transitions.
[2024-05-29 14:07:34] [INFO ] Flow matrix only has 1226 transitions (discarded 12 similar events)
[2024-05-29 14:07:34] [INFO ] Invariant cache hit.
[2024-05-29 14:07:34] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
[2024-05-29 14:07:59] [INFO ] Deduced a trap composed of 15 places in 247 ms of which 3 ms to minimize.
[2024-05-29 14:07:59] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 1 ms to minimize.
[2024-05-29 14:07:59] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 1 ms to minimize.
[2024-05-29 14:08:00] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 0 ms to minimize.
[2024-05-29 14:08:00] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 1 ms to minimize.
[2024-05-29 14:08:00] [INFO ] Deduced a trap composed of 16 places in 270 ms of which 1 ms to minimize.
[2024-05-29 14:08:00] [INFO ] Deduced a trap composed of 18 places in 244 ms of which 1 ms to minimize.
[2024-05-29 14:08:01] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 1 ms to minimize.
[2024-05-29 14:08:01] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 1 ms to minimize.
[2024-05-29 14:08:01] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 1 ms to minimize.
[2024-05-29 14:08:01] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 1 ms to minimize.
[2024-05-29 14:08:01] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 2 ms to minimize.
[2024-05-29 14:08:01] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2024-05-29 14:08:02] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:08:02] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2024-05-29 14:08:02] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:08:02] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-05-29 14:08:02] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 2 ms to minimize.
[2024-05-29 14:08:02] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 1 ms to minimize.
[2024-05-29 14:08:03] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
[2024-05-29 14:08:03] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 1 ms to minimize.
[2024-05-29 14:08:03] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 1 ms to minimize.
[2024-05-29 14:08:04] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 1 ms to minimize.
[2024-05-29 14:08:04] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 1 ms to minimize.
[2024-05-29 14:08:04] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 14 ms to minimize.
[2024-05-29 14:08:04] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 1 ms to minimize.
[2024-05-29 14:08:04] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:08:04] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 14:08:05] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:08:05] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:08:05] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:08:05] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 0 ms to minimize.
[2024-05-29 14:08:05] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:08:05] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 1 ms to minimize.
[2024-05-29 14:08:05] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 0 ms to minimize.
[2024-05-29 14:08:06] [INFO ] Deduced a trap composed of 16 places in 288 ms of which 1 ms to minimize.
[2024-05-29 14:08:06] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 1 ms to minimize.
[2024-05-29 14:08:06] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2024-05-29 14:08:06] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:08:06] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
[2024-05-29 14:08:10] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 1 ms to minimize.
[2024-05-29 14:08:10] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2024-05-29 14:08:10] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-29 14:08:10] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 14:08:11] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:08:11] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 1 ms to minimize.
[2024-05-29 14:08:11] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 1 ms to minimize.
[2024-05-29 14:08:11] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 1 ms to minimize.
[2024-05-29 14:08:11] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 1 ms to minimize.
[2024-05-29 14:08:12] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 1 ms to minimize.
[2024-05-29 14:08:12] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 1 ms to minimize.
[2024-05-29 14:08:12] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 0 ms to minimize.
[2024-05-29 14:08:12] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
[2024-05-29 14:08:12] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 1 ms to minimize.
[2024-05-29 14:08:13] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 0 ms to minimize.
[2024-05-29 14:08:13] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 1 ms to minimize.
[2024-05-29 14:08:13] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 1 ms to minimize.
[2024-05-29 14:08:13] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 1 ms to minimize.
[2024-05-29 14:08:13] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 1 ms to minimize.
[2024-05-29 14:08:14] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
[2024-05-29 14:08:14] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2024-05-29 14:08:14] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2024-05-29 14:08:14] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 14:08:14] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-29 14:08:14] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:08:14] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-29 14:08:15] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:08:15] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-29 14:08:15] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 1 ms to minimize.
[2024-05-29 14:08:15] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 1 ms to minimize.
[2024-05-29 14:08:15] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2024-05-29 14:08:15] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2024-05-29 14:08:15] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-29 14:08:16] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-29 14:08:16] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:08:16] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:08:16] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 1 ms to minimize.
[2024-05-29 14:08:16] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2024-05-29 14:08:16] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-05-29 14:08:16] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
[2024-05-29 14:08:17] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2024-05-29 14:08:17] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2024-05-29 14:08:17] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:08:18] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-29 14:08:18] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:08:18] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 0 ms to minimize.
[2024-05-29 14:08:18] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-05-29 14:08:18] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-29 14:08:18] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:08:18] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2024-05-29 14:08:18] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 4 ms to minimize.
[2024-05-29 14:08:19] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:08:19] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2024-05-29 14:08:19] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:08:19] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2024-05-29 14:08:19] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 156/1382 variables, and 98 constraints, problems are : Problem set: 0 solved, 1237 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/156 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1237/205 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
[2024-05-29 14:08:28] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:08:28] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2024-05-29 14:08:28] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-29 14:08:28] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:08:28] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:08:28] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:08:28] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-05-29 14:08:28] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-29 14:08:29] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-29 14:08:29] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:08:29] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-29 14:08:29] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-29 14:08:29] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-29 14:08:29] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 14:08:29] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2024-05-29 14:08:30] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 14:08:30] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-29 14:08:30] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-29 14:08:30] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2024-05-29 14:08:30] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
[2024-05-29 14:08:33] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-29 14:08:33] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 0 ms to minimize.
[2024-05-29 14:08:34] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
[2024-05-29 14:08:43] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-29 14:08:50] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 0 ms to minimize.
[2024-05-29 14:08:50] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 156/1382 variables, and 124 constraints, problems are : Problem set: 0 solved, 1237 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/156 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/205 constraints, Known Traps: 122/122 constraints]
After SMT, in 78042ms problems are : Problem set: 0 solved, 1237 unsolved
Search for dead transitions found 0 dead transitions in 78067ms
Starting structural reductions in LTL mode, iteration 1 : 156/264 places, 1238/1377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79349 ms. Remains : 156/264 places, 1238/1377 transitions.
[2024-05-29 14:08:52] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:08:52] [INFO ] Flatten gal took : 58 ms
[2024-05-29 14:08:52] [INFO ] Input system was already deterministic with 1238 transitions.
[2024-05-29 14:08:52] [INFO ] Flatten gal took : 59 ms
[2024-05-29 14:08:52] [INFO ] Flatten gal took : 57 ms
[2024-05-29 14:08:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality10887455828234597825.gal : 44 ms
[2024-05-29 14:08:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality2064322757933349511.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/CTLCardinality10887455828234597825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2064322757933349511.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,5.40658e+07,10.3673,232032,2,10085,5,191035,6,0,1848,113228,0


Converting to forward existential form...Done !
original formula: (AG((EF(((p222==1) * E((p219==1) U (p20==1)))) + ((p125==1) * AX((p48==0))))) + EF(((EG((p265==0)) * ((AX((p37==0)) + ((p56==0)&&(p27==1)...300
=> equivalent forward existential formula: ([((FwdU((Init * !(E(TRUE U ((EG((p265==0)) * ((!(EX(!((p37==0)))) + ((p56==0)&&(p27==1))) + (((p203==0)&&(p249=...699
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t12, t13, t14, t15, t16, t18, t20, t21, t23, t25, t26, t28, t30, t31,...631
Detected timeout of ITS tools.
[2024-05-29 14:09:22] [INFO ] Flatten gal took : 57 ms
[2024-05-29 14:09:22] [INFO ] Applying decomposition
[2024-05-29 14:09:22] [INFO ] Flatten gal took : 56 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/graph4030349438703780026.txt' '-o' '/tmp/graph4030349438703780026.bin' '-w' '/tmp/graph4030349438703780026.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4030349438703780026.bin' '-l' '-1' '-v' '-w' '/tmp/graph4030349438703780026.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:09:23] [INFO ] Decomposing Gal with order
[2024-05-29 14:09:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:09:23] [INFO ] Removed a total of 9284 redundant transitions.
[2024-05-29 14:09:23] [INFO ] Flatten gal took : 396 ms
[2024-05-29 14:09:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 117 ms.
[2024-05-29 14:09:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality13295155751476671850.gal : 21 ms
[2024-05-29 14:09:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality8183075414036131952.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/CTLCardinality13295155751476671850.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8183075414036131952.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,5.40658e+07,2.74554,121092,5906,29,203952,378,1516,457523,59,1172,0


Converting to forward existential form...Done !
original formula: (AG((EF(((i10.u33.p222==1) * E((i10.u34.p219==1) U (i1.u5.p20==1)))) + ((i5.u18.p125==1) * AX((i7.i0.u8.p48==0))))) + EF(((EG((i13.i0.u43...462
=> equivalent forward existential formula: ([((FwdU((Init * !(E(TRUE U ((EG((i13.i0.u43.p265==0)) * ((!(EX(!((u6.p37==0)))) + ((i7.i0.u11.p56==0)&&(i1.u5.p...1007
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t6, t8, t16, t20, t25, t28, t31, t35, t40, t43, t46, t49, t1216, t1219, t1220, t1222,...890
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,20.0029,614316,1,0,311406,378,22932,1.3656e+06,282,1172,10300490
FORMULA StigmergyCommit-PT-08a-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 1377/1377 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 210 transition count 1316
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 210 transition count 1316
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 122 place count 210 transition count 1302
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 153 place count 179 transition count 1265
Iterating global reduction 1 with 31 rules applied. Total rules applied 184 place count 179 transition count 1265
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 192 place count 179 transition count 1257
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 213 place count 158 transition count 1236
Iterating global reduction 2 with 21 rules applied. Total rules applied 234 place count 158 transition count 1236
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 247 place count 145 transition count 1223
Iterating global reduction 2 with 13 rules applied. Total rules applied 260 place count 145 transition count 1223
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 145 transition count 1222
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 272 place count 134 transition count 1211
Iterating global reduction 3 with 11 rules applied. Total rules applied 283 place count 134 transition count 1211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 285 place count 134 transition count 1209
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 292 place count 127 transition count 1202
Iterating global reduction 4 with 7 rules applied. Total rules applied 299 place count 127 transition count 1202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 302 place count 127 transition count 1199
Applied a total of 302 rules in 40 ms. Remains 127 /264 variables (removed 137) and now considering 1199/1377 (removed 178) transitions.
[2024-05-29 14:09:44] [INFO ] Flow matrix only has 1188 transitions (discarded 11 similar events)
// Phase 1: matrix 1188 rows 127 cols
[2024-05-29 14:09:44] [INFO ] Computed 1 invariants in 13 ms
[2024-05-29 14:09:44] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-29 14:09:44] [INFO ] Flow matrix only has 1188 transitions (discarded 11 similar events)
[2024-05-29 14:09:44] [INFO ] Invariant cache hit.
[2024-05-29 14:09:44] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:09:45] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
Running 1198 sub problems to find dead transitions.
[2024-05-29 14:09:45] [INFO ] Flow matrix only has 1188 transitions (discarded 11 similar events)
[2024-05-29 14:09:45] [INFO ] Invariant cache hit.
[2024-05-29 14:09:45] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-29 14:10:09] [INFO ] Deduced a trap composed of 17 places in 277 ms of which 1 ms to minimize.
[2024-05-29 14:10:09] [INFO ] Deduced a trap composed of 13 places in 278 ms of which 1 ms to minimize.
[2024-05-29 14:10:09] [INFO ] Deduced a trap composed of 13 places in 286 ms of which 0 ms to minimize.
[2024-05-29 14:10:09] [INFO ] Deduced a trap composed of 13 places in 276 ms of which 1 ms to minimize.
[2024-05-29 14:10:10] [INFO ] Deduced a trap composed of 14 places in 277 ms of which 1 ms to minimize.
[2024-05-29 14:10:10] [INFO ] Deduced a trap composed of 13 places in 286 ms of which 1 ms to minimize.
[2024-05-29 14:10:10] [INFO ] Deduced a trap composed of 13 places in 278 ms of which 1 ms to minimize.
[2024-05-29 14:10:11] [INFO ] Deduced a trap composed of 13 places in 273 ms of which 1 ms to minimize.
[2024-05-29 14:10:11] [INFO ] Deduced a trap composed of 13 places in 276 ms of which 1 ms to minimize.
[2024-05-29 14:10:11] [INFO ] Deduced a trap composed of 13 places in 290 ms of which 1 ms to minimize.
[2024-05-29 14:10:11] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 0 ms to minimize.
[2024-05-29 14:10:12] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 1 ms to minimize.
[2024-05-29 14:10:12] [INFO ] Deduced a trap composed of 13 places in 283 ms of which 1 ms to minimize.
[2024-05-29 14:10:12] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 1 ms to minimize.
[2024-05-29 14:10:12] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 1 ms to minimize.
[2024-05-29 14:10:13] [INFO ] Deduced a trap composed of 16 places in 231 ms of which 1 ms to minimize.
[2024-05-29 14:10:13] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 0 ms to minimize.
[2024-05-29 14:10:13] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 1 ms to minimize.
[2024-05-29 14:10:13] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 1 ms to minimize.
[2024-05-29 14:10:14] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-29 14:10:14] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 0 ms to minimize.
[2024-05-29 14:10:14] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:10:14] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:10:14] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 0 ms to minimize.
[2024-05-29 14:10:15] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2024-05-29 14:10:15] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 0 ms to minimize.
[2024-05-29 14:10:15] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:10:15] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 1 ms to minimize.
[2024-05-29 14:10:15] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 0 ms to minimize.
[2024-05-29 14:10:15] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-05-29 14:10:15] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2024-05-29 14:10:15] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 14:10:16] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2024-05-29 14:10:16] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 0 ms to minimize.
[2024-05-29 14:10:16] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 0 ms to minimize.
[2024-05-29 14:10:16] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 0 ms to minimize.
[2024-05-29 14:10:16] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 1 ms to minimize.
[2024-05-29 14:10:17] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2024-05-29 14:10:17] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2024-05-29 14:10:17] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-29 14:10:20] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:10:20] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 0 ms to minimize.
[2024-05-29 14:10:20] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-29 14:10:21] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 1 ms to minimize.
[2024-05-29 14:10:21] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2024-05-29 14:10:21] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2024-05-29 14:10:21] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:10:21] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2024-05-29 14:10:21] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 0 ms to minimize.
[2024-05-29 14:10:22] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:10:22] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 1 ms to minimize.
[2024-05-29 14:10:22] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 0 ms to minimize.
[2024-05-29 14:10:22] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 14:10:22] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:10:22] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 0 ms to minimize.
[2024-05-29 14:10:23] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 1 ms to minimize.
[2024-05-29 14:10:23] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:10:23] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2024-05-29 14:10:23] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:10:23] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-29 14:10:24] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2024-05-29 14:10:24] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 0 ms to minimize.
[2024-05-29 14:10:24] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 14:10:24] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-29 14:10:24] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-29 14:10:24] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2024-05-29 14:10:24] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2024-05-29 14:10:24] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:10:24] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-05-29 14:10:25] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-29 14:10:25] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-29 14:10:25] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 1 ms to minimize.
[2024-05-29 14:10:25] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:10:25] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:10:25] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2024-05-29 14:10:25] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-05-29 14:10:26] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 1 ms to minimize.
[2024-05-29 14:10:26] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:10:26] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:10:26] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-29 14:10:26] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 0 ms to minimize.
[2024-05-29 14:10:27] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 0 ms to minimize.
[2024-05-29 14:10:27] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:10:31] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-29 14:10:31] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 127/1315 variables, and 86 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/127 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1198/166 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 85/86 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-29 14:10:37] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2024-05-29 14:10:37] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-29 14:10:37] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
[2024-05-29 14:10:37] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-29 14:10:37] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 1 ms to minimize.
[2024-05-29 14:10:37] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-29 14:10:37] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 14:10:37] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-05-29 14:10:37] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
[2024-05-29 14:10:38] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 4 ms to minimize.
[2024-05-29 14:10:38] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 1 ms to minimize.
[2024-05-29 14:10:38] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
[2024-05-29 14:10:38] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 14:10:38] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-29 14:10:38] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:10:39] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-29 14:10:39] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 0 ms to minimize.
[2024-05-29 14:10:39] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-29 14:10:39] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:10:39] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-29 14:10:42] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-29 14:10:42] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 14:10:42] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:10:43] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-29 14:10:43] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 14:10:43] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:10:43] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:10:44] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-29 14:10:49] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 9/115 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-29 14:10:51] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 14:10:51] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-29 14:10:59] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:11:00] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 127/1315 variables, and 119 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/127 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/166 constraints, Known Traps: 118/118 constraints]
After SMT, in 77712ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 77727ms
Starting structural reductions in LTL mode, iteration 1 : 127/264 places, 1199/1377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78828 ms. Remains : 127/264 places, 1199/1377 transitions.
[2024-05-29 14:11:02] [INFO ] Flatten gal took : 71 ms
[2024-05-29 14:11:03] [INFO ] Flatten gal took : 62 ms
[2024-05-29 14:11:03] [INFO ] Input system was already deterministic with 1199 transitions.
[2024-05-29 14:11:03] [INFO ] Flatten gal took : 61 ms
[2024-05-29 14:11:03] [INFO ] Flatten gal took : 62 ms
[2024-05-29 14:11:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality10582385827988537781.gal : 12 ms
[2024-05-29 14:11:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality394298081687684960.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/CTLCardinality10582385827988537781.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality394298081687684960.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,5.4033e+07,9.57948,219592,2,8071,5,170529,6,0,1696,101927,0


Converting to forward existential form...Done !
original formula: (EG((p281==0)) + A(AX(((p195==0)||(p293==1))) U (p274!=0)))
=> equivalent forward existential formula: ([FwdG(Init,(p281==0))] != FALSE + [((Init * !(EG(!((p274!=0))))) * !(E(!((p274!=0)) U (!(!(EX(!(((p195==0)||(p2...196
Hit Full ! (commute/partial/dont) 1193/0/6
Detected timeout of ITS tools.
[2024-05-29 14:11:33] [INFO ] Flatten gal took : 60 ms
[2024-05-29 14:11:33] [INFO ] Applying decomposition
[2024-05-29 14:11:33] [INFO ] Flatten gal took : 68 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/graph7622680051589279807.txt' '-o' '/tmp/graph7622680051589279807.bin' '-w' '/tmp/graph7622680051589279807.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7622680051589279807.bin' '-l' '-1' '-v' '-w' '/tmp/graph7622680051589279807.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:11:33] [INFO ] Decomposing Gal with order
[2024-05-29 14:11:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:11:33] [INFO ] Removed a total of 9275 redundant transitions.
[2024-05-29 14:11:33] [INFO ] Flatten gal took : 188 ms
[2024-05-29 14:11:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 35 ms.
[2024-05-29 14:11:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality2318700681501033983.gal : 7 ms
[2024-05-29 14:11:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality6351838255569629858.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/CTLCardinality2318700681501033983.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6351838255569629858.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,5.4033e+07,7.49408,186812,4030,32,133600,388,1310,1.50472e+06,63,1318,0


Converting to forward existential form...Done !
original formula: (EG((i5.i0.u35.p281==0)) + A(AX(((i3.i0.u24.p195==0)||(u43.p293==1))) U (i5.i1.u38.p274!=0)))
=> equivalent forward existential formula: ([FwdG(Init,(i5.i0.u35.p281==0))] != FALSE + [((Init * !(EG(!((i5.i1.u38.p274!=0))))) * !(E(!((i5.i1.u38.p274!=0...250
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found 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 a local 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 1377/1377 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 208 transition count 1313
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 208 transition count 1313
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 125 place count 208 transition count 1300
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 157 place count 176 transition count 1262
Iterating global reduction 1 with 32 rules applied. Total rules applied 189 place count 176 transition count 1262
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 197 place count 176 transition count 1254
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 219 place count 154 transition count 1232
Iterating global reduction 2 with 22 rules applied. Total rules applied 241 place count 154 transition count 1232
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 255 place count 140 transition count 1218
Iterating global reduction 2 with 14 rules applied. Total rules applied 269 place count 140 transition count 1218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 270 place count 140 transition count 1217
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 281 place count 129 transition count 1206
Iterating global reduction 3 with 11 rules applied. Total rules applied 292 place count 129 transition count 1206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 293 place count 129 transition count 1205
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 301 place count 121 transition count 1197
Iterating global reduction 4 with 8 rules applied. Total rules applied 309 place count 121 transition count 1197
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 313 place count 121 transition count 1193
Applied a total of 313 rules in 29 ms. Remains 121 /264 variables (removed 143) and now considering 1193/1377 (removed 184) transitions.
[2024-05-29 14:12:04] [INFO ] Flow matrix only has 1183 transitions (discarded 10 similar events)
// Phase 1: matrix 1183 rows 121 cols
[2024-05-29 14:12:04] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 14:12:04] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-29 14:12:04] [INFO ] Flow matrix only has 1183 transitions (discarded 10 similar events)
[2024-05-29 14:12:04] [INFO ] Invariant cache hit.
[2024-05-29 14:12:04] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:12:05] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 915 ms to find 0 implicit places.
Running 1192 sub problems to find dead transitions.
[2024-05-29 14:12:05] [INFO ] Flow matrix only has 1183 transitions (discarded 10 similar events)
[2024-05-29 14:12:05] [INFO ] Invariant cache hit.
[2024-05-29 14:12:05] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-05-29 14:12:26] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 1 ms to minimize.
[2024-05-29 14:12:26] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 1 ms to minimize.
[2024-05-29 14:12:27] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 1 ms to minimize.
[2024-05-29 14:12:27] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 1 ms to minimize.
[2024-05-29 14:12:27] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
[2024-05-29 14:12:27] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 1 ms to minimize.
[2024-05-29 14:12:28] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 0 ms to minimize.
[2024-05-29 14:12:28] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 1 ms to minimize.
[2024-05-29 14:12:28] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
[2024-05-29 14:12:28] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 1 ms to minimize.
[2024-05-29 14:12:28] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 1 ms to minimize.
[2024-05-29 14:12:28] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2024-05-29 14:12:29] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 0 ms to minimize.
[2024-05-29 14:12:29] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:12:29] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 1 ms to minimize.
[2024-05-29 14:12:29] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2024-05-29 14:12:29] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 0 ms to minimize.
[2024-05-29 14:12:29] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2024-05-29 14:12:30] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:12:30] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-05-29 14:12:30] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 0 ms to minimize.
[2024-05-29 14:12:30] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 1 ms to minimize.
[2024-05-29 14:12:31] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 1 ms to minimize.
[2024-05-29 14:12:31] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 1 ms to minimize.
[2024-05-29 14:12:31] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2024-05-29 14:12:31] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 0 ms to minimize.
[2024-05-29 14:12:31] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-05-29 14:12:31] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:12:32] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 1 ms to minimize.
[2024-05-29 14:12:32] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2024-05-29 14:12:32] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 0 ms to minimize.
[2024-05-29 14:12:32] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 0 ms to minimize.
[2024-05-29 14:12:32] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 0 ms to minimize.
[2024-05-29 14:12:32] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:12:33] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2024-05-29 14:12:33] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 14:12:33] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2024-05-29 14:12:33] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2024-05-29 14:12:33] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-29 14:12:33] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-05-29 14:12:36] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 1 ms to minimize.
[2024-05-29 14:12:37] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 0 ms to minimize.
[2024-05-29 14:12:37] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 0 ms to minimize.
[2024-05-29 14:12:37] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 0 ms to minimize.
[2024-05-29 14:12:37] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:12:37] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-29 14:12:37] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 14:12:37] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 0 ms to minimize.
[2024-05-29 14:12:38] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 0 ms to minimize.
[2024-05-29 14:12:38] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2024-05-29 14:12:38] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 0 ms to minimize.
[2024-05-29 14:12:38] [INFO ] Deduced a trap composed of 16 places in 226 ms of which 0 ms to minimize.
[2024-05-29 14:12:38] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 1 ms to minimize.
[2024-05-29 14:12:39] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:12:39] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-29 14:12:39] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:12:43] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:12:43] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 14:12:43] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 14:12:43] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-05-29 14:12:44] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-05-29 14:12:44] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2024-05-29 14:12:44] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-29 14:12:44] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:12:44] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 14:12:44] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-29 14:12:44] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-29 14:12:44] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:12:45] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2024-05-29 14:12:45] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-05-29 14:12:45] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2024-05-29 14:12:45] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2024-05-29 14:12:45] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 14:12:45] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 0 ms to minimize.
[2024-05-29 14:12:45] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2024-05-29 14:12:45] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 0 ms to minimize.
[2024-05-29 14:12:45] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2024-05-29 14:12:46] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-05-29 14:12:46] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 14:12:46] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-05-29 14:12:47] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2024-05-29 14:12:47] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:12:47] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 14:12:47] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:12:47] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:12:47] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-29 14:12:47] [INFO ] Deduced a trap composed of 17 places in 261 ms of which 1 ms to minimize.
[2024-05-29 14:12:48] [INFO ] Deduced a trap composed of 16 places in 257 ms of which 1 ms to minimize.
[2024-05-29 14:12:48] [INFO ] Deduced a trap composed of 16 places in 267 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1304 variables, and 90 constraints, problems are : Problem set: 0 solved, 1192 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1192/160 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-05-29 14:12:55] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-29 14:12:55] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-29 14:12:55] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:12:55] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-29 14:12:55] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 14:12:55] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 14:12:55] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-29 14:12:56] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 14:12:56] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 1 ms to minimize.
[2024-05-29 14:12:56] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 14:12:56] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:12:56] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2024-05-29 14:12:56] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 14:12:56] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-29 14:12:57] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:12:58] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:12:58] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-29 14:12:58] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:12:58] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-29 14:12:59] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-05-29 14:13:01] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-29 14:13:01] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 0 ms to minimize.
[2024-05-29 14:13:02] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-05-29 14:13:16] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-05-29 14:13:19] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/1304 variables, and 115 constraints, problems are : Problem set: 0 solved, 1192 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/160 constraints, Known Traps: 114/114 constraints]
After SMT, in 75884ms problems are : Problem set: 0 solved, 1192 unsolved
Search for dead transitions found 0 dead transitions in 75898ms
Starting structural reductions in LTL mode, iteration 1 : 121/264 places, 1193/1377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76848 ms. Remains : 121/264 places, 1193/1377 transitions.
[2024-05-29 14:13:20] [INFO ] Flatten gal took : 51 ms
[2024-05-29 14:13:21] [INFO ] Flatten gal took : 53 ms
[2024-05-29 14:13:21] [INFO ] Input system was already deterministic with 1193 transitions.
[2024-05-29 14:13:21] [INFO ] Flatten gal took : 54 ms
[2024-05-29 14:13:21] [INFO ] Flatten gal took : 54 ms
[2024-05-29 14:13:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality14225535830534693378.gal : 12 ms
[2024-05-29 14:13:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality13851711751789213144.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/CTLCardinality14225535830534693378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13851711751789213144.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,5.39674e+07,9.55767,219032,2,7900,5,169406,6,0,1667,100642,0


Converting to forward existential form...Done !
original formula: (EG((p228==0)) + !(E(AX(((p182==0)||(p24==1))) U (p242==0))))
=> equivalent forward existential formula: [(FwdU((Init * !(EG((p228==0)))),!(EX(!(((p182==0)||(p24==1)))))) * (p242==0))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t17, t18, t20, t21, t23, t25, t26, t28, t30, t31,...580
Detected timeout of ITS tools.
[2024-05-29 14:13:51] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:13:51] [INFO ] Applying decomposition
[2024-05-29 14:13:51] [INFO ] Flatten gal took : 55 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/graph4769266352392352087.txt' '-o' '/tmp/graph4769266352392352087.bin' '-w' '/tmp/graph4769266352392352087.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4769266352392352087.bin' '-l' '-1' '-v' '-w' '/tmp/graph4769266352392352087.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:13:51] [INFO ] Decomposing Gal with order
[2024-05-29 14:13:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:13:51] [INFO ] Removed a total of 9280 redundant transitions.
[2024-05-29 14:13:51] [INFO ] Flatten gal took : 144 ms
[2024-05-29 14:13:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 56 ms.
[2024-05-29 14:13:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality3624422401189995242.gal : 9 ms
[2024-05-29 14:13:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality6422319915061827592.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/CTLCardinality3624422401189995242.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6422319915061827592.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,5.39674e+07,11.9862,230384,6308,28,157218,374,1422,2.15669e+06,48,1286,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 1377/1377 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 208 transition count 1313
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 208 transition count 1313
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 125 place count 208 transition count 1300
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 158 place count 175 transition count 1261
Iterating global reduction 1 with 33 rules applied. Total rules applied 191 place count 175 transition count 1261
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 199 place count 175 transition count 1253
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 222 place count 152 transition count 1230
Iterating global reduction 2 with 23 rules applied. Total rules applied 245 place count 152 transition count 1230
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 260 place count 137 transition count 1215
Iterating global reduction 2 with 15 rules applied. Total rules applied 275 place count 137 transition count 1215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 276 place count 137 transition count 1214
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 289 place count 124 transition count 1201
Iterating global reduction 3 with 13 rules applied. Total rules applied 302 place count 124 transition count 1201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 304 place count 124 transition count 1199
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 313 place count 115 transition count 1190
Iterating global reduction 4 with 9 rules applied. Total rules applied 322 place count 115 transition count 1190
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 327 place count 115 transition count 1185
Applied a total of 327 rules in 35 ms. Remains 115 /264 variables (removed 149) and now considering 1185/1377 (removed 192) transitions.
[2024-05-29 14:14:22] [INFO ] Flow matrix only has 1175 transitions (discarded 10 similar events)
// Phase 1: matrix 1175 rows 115 cols
[2024-05-29 14:14:22] [INFO ] Computed 1 invariants in 15 ms
[2024-05-29 14:14:22] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-29 14:14:22] [INFO ] Flow matrix only has 1175 transitions (discarded 10 similar events)
[2024-05-29 14:14:22] [INFO ] Invariant cache hit.
[2024-05-29 14:14:22] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:14:23] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
Running 1184 sub problems to find dead transitions.
[2024-05-29 14:14:23] [INFO ] Flow matrix only has 1175 transitions (discarded 10 similar events)
[2024-05-29 14:14:23] [INFO ] Invariant cache hit.
[2024-05-29 14:14:23] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
[2024-05-29 14:14:43] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 0 ms to minimize.
[2024-05-29 14:14:44] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 0 ms to minimize.
[2024-05-29 14:14:44] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 1 ms to minimize.
[2024-05-29 14:14:44] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 1 ms to minimize.
[2024-05-29 14:14:44] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 1 ms to minimize.
[2024-05-29 14:14:45] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 1 ms to minimize.
[2024-05-29 14:14:45] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 1 ms to minimize.
[2024-05-29 14:14:45] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 1 ms to minimize.
[2024-05-29 14:14:45] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 1 ms to minimize.
[2024-05-29 14:14:45] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 0 ms to minimize.
[2024-05-29 14:14:46] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 1 ms to minimize.
[2024-05-29 14:14:46] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 1 ms to minimize.
[2024-05-29 14:14:46] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:14:46] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 0 ms to minimize.
[2024-05-29 14:14:47] [INFO ] Deduced a trap composed of 13 places in 273 ms of which 1 ms to minimize.
[2024-05-29 14:14:47] [INFO ] Deduced a trap composed of 13 places in 275 ms of which 1 ms to minimize.
[2024-05-29 14:14:47] [INFO ] Deduced a trap composed of 13 places in 266 ms of which 1 ms to minimize.
[2024-05-29 14:14:47] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 1 ms to minimize.
[2024-05-29 14:14:48] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 1 ms to minimize.
[2024-05-29 14:14:48] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
[2024-05-29 14:14:48] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 0 ms to minimize.
[2024-05-29 14:14:48] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:14:49] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2024-05-29 14:14:49] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 0 ms to minimize.
[2024-05-29 14:14:49] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:14:49] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:14:49] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:14:49] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 0 ms to minimize.
[2024-05-29 14:14:49] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2024-05-29 14:14:50] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 0 ms to minimize.
[2024-05-29 14:14:50] [INFO ] Deduced a trap composed of 17 places in 259 ms of which 1 ms to minimize.
[2024-05-29 14:14:50] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 1 ms to minimize.
[2024-05-29 14:14:50] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 0 ms to minimize.
[2024-05-29 14:14:50] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 0 ms to minimize.
[2024-05-29 14:14:51] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:14:51] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2024-05-29 14:14:51] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 1 ms to minimize.
[2024-05-29 14:14:51] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 0 ms to minimize.
[2024-05-29 14:14:51] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2024-05-29 14:14:51] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
[2024-05-29 14:14:54] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 1 ms to minimize.
[2024-05-29 14:14:55] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 0 ms to minimize.
[2024-05-29 14:14:55] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2024-05-29 14:14:55] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 1 ms to minimize.
[2024-05-29 14:14:55] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 1 ms to minimize.
[2024-05-29 14:14:55] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 1 ms to minimize.
[2024-05-29 14:14:56] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 1 ms to minimize.
[2024-05-29 14:14:56] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:14:56] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-29 14:14:56] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2024-05-29 14:14:56] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2024-05-29 14:14:56] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-05-29 14:14:56] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-05-29 14:14:57] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-29 14:14:57] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:14:57] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 14:14:57] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2024-05-29 14:14:57] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-29 14:14:57] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2024-05-29 14:14:57] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-05-29 14:15:00] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 1 ms to minimize.
[2024-05-29 14:15:00] [INFO ] Deduced a trap composed of 16 places in 303 ms of which 1 ms to minimize.
[2024-05-29 14:15:00] [INFO ] Deduced a trap composed of 17 places in 305 ms of which 1 ms to minimize.
[2024-05-29 14:15:01] [INFO ] Deduced a trap composed of 17 places in 298 ms of which 1 ms to minimize.
[2024-05-29 14:15:01] [INFO ] Deduced a trap composed of 16 places in 270 ms of which 1 ms to minimize.
[2024-05-29 14:15:01] [INFO ] Deduced a trap composed of 17 places in 298 ms of which 1 ms to minimize.
[2024-05-29 14:15:01] [INFO ] Deduced a trap composed of 17 places in 290 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
[2024-05-29 14:15:02] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 14:15:02] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:15:02] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-05-29 14:15:02] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:15:02] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2024-05-29 14:15:03] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2024-05-29 14:15:03] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:15:03] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 0 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 0 ms to minimize.
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 115/1290 variables, and 97 constraints, problems are : Problem set: 0 solved, 1184 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/115 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1184/152 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 96/97 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2024-05-29 14:15:13] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 1 ms to minimize.
[2024-05-29 14:15:13] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-05-29 14:15:14] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-05-29 14:15:14] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 14:15:14] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2024-05-29 14:15:14] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 0 ms to minimize.
[2024-05-29 14:15:14] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 0 ms to minimize.
[2024-05-29 14:15:15] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
[2024-05-29 14:15:16] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:15:17] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 14:15:18] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
[2024-05-29 14:15:26] [INFO ] Deduced a trap composed of 17 places in 276 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 115/1290 variables, and 121 constraints, problems are : Problem set: 0 solved, 1184 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/115 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/152 constraints, Known Traps: 120/120 constraints]
After SMT, in 75292ms problems are : Problem set: 0 solved, 1184 unsolved
Search for dead transitions found 0 dead transitions in 75308ms
Starting structural reductions in LTL mode, iteration 1 : 115/264 places, 1185/1377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76289 ms. Remains : 115/264 places, 1185/1377 transitions.
[2024-05-29 14:15:38] [INFO ] Flatten gal took : 51 ms
[2024-05-29 14:15:38] [INFO ] Flatten gal took : 54 ms
[2024-05-29 14:15:38] [INFO ] Input system was already deterministic with 1185 transitions.
[2024-05-29 14:15:38] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:15:38] [INFO ] Flatten gal took : 70 ms
[2024-05-29 14:15:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality15528738153191802562.gal : 11 ms
[2024-05-29 14:15:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality3800488598231370220.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/CTLCardinality15528738153191802562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3800488598231370220.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,5.39674e+07,9.84057,219328,2,7888,5,169372,6,0,1635,100770,0


Converting to forward existential form...Done !
original formula: EX(AF(E((p316==1) U (p258==1))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(E((p316==1) U (p258==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t8, t10, t11, t13, t15, t16, t18, t20, t21, t23, t25, t26, t28, t30, t31,...568
Detected timeout of ITS tools.
[2024-05-29 14:16:08] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:16:08] [INFO ] Applying decomposition
[2024-05-29 14:16:08] [INFO ] Flatten gal took : 55 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/graph11134695637590400199.txt' '-o' '/tmp/graph11134695637590400199.bin' '-w' '/tmp/graph11134695637590400199.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11134695637590400199.bin' '-l' '-1' '-v' '-w' '/tmp/graph11134695637590400199.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:16:09] [INFO ] Decomposing Gal with order
[2024-05-29 14:16:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:16:09] [INFO ] Removed a total of 9279 redundant transitions.
[2024-05-29 14:16:09] [INFO ] Flatten gal took : 122 ms
[2024-05-29 14:16:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 55 ms.
[2024-05-29 14:16:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality13054184708095562324.gal : 8 ms
[2024-05-29 14:16:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality10669452148529334159.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/CTLCardinality13054184708095562324.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10669452148529334159.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,5.39674e+07,6.13275,132392,2995,33,48241,388,1402,1.38495e+06,58,1583,0


Converting to forward existential form...Done !
original formula: EX(AF(E((i3.i6.u38.p316==1) U (i2.u33.p258==1))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(E((i3.i6.u38.p316==1) U (i2.u33.p258==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t11, t13, t16, t20, t25, t31, t35, t1166, t1169, t1171, t1173, t1175, t1177, t1179, t...856
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,20.3046,441060,1,0,176978,388,21179,3.6129e+06,286,1583,3265374
FORMULA StigmergyCommit-PT-08a-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 1377/1377 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 263 transition count 1239
Reduce places removed 137 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 164 rules applied. Total rules applied 301 place count 126 transition count 1212
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 305 place count 124 transition count 1210
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 309 place count 123 transition count 1207
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 311 place count 121 transition count 1207
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 311 place count 121 transition count 1187
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 351 place count 101 transition count 1187
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 366 place count 86 transition count 1166
Iterating global reduction 5 with 15 rules applied. Total rules applied 381 place count 86 transition count 1166
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 386 place count 86 transition count 1161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 386 place count 86 transition count 1160
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 388 place count 85 transition count 1160
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 393 place count 80 transition count 1150
Iterating global reduction 6 with 5 rules applied. Total rules applied 398 place count 80 transition count 1150
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 6 with 62 rules applied. Total rules applied 460 place count 80 transition count 1088
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 484 place count 68 transition count 1076
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 495 place count 68 transition count 1065
Drop transitions (Redundant composition of simpler transitions.) removed 947 transitions
Redundant transition composition rules discarded 947 transitions
Iterating global reduction 8 with 947 rules applied. Total rules applied 1442 place count 68 transition count 118
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1460 place count 59 transition count 109
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1462 place count 59 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1463 place count 59 transition count 108
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1467 place count 55 transition count 104
Applied a total of 1467 rules in 357 ms. Remains 55 /264 variables (removed 209) and now considering 104/1377 (removed 1273) transitions.
[2024-05-29 14:16:30] [INFO ] Flow matrix only has 94 transitions (discarded 10 similar events)
// Phase 1: matrix 94 rows 55 cols
[2024-05-29 14:16:30] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 14:16:30] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-29 14:16:30] [INFO ] Flow matrix only has 94 transitions (discarded 10 similar events)
[2024-05-29 14:16:30] [INFO ] Invariant cache hit.
[2024-05-29 14:16:30] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-29 14:16:30] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-29 14:16:30] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-29 14:16:30] [INFO ] Flow matrix only has 94 transitions (discarded 10 similar events)
[2024-05-29 14:16:30] [INFO ] Invariant cache hit.
[2024-05-29 14:16:30] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 5/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-29 14:16:30] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:16:30] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:16:30] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:16:30] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:16:30] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:16:30] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:16:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 14:16:30] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 14:16:30] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:16:30] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:16:30] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-29 14:16:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 14:16:33] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:16:33] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-29 14:16:33] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-29 14:16:33] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:16:33] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-29 14:16:33] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 93/148 variables, 55/128 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 28/156 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-29 14:16:34] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 14:16:34] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (OVERLAPS) 1/149 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/149 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-29 14:16:36] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/149 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 16 (OVERLAPS) 0/149 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 160 constraints, problems are : Problem set: 0 solved, 99 unsolved in 7092 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 75/75 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 5/55 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 33/76 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-29 14:16:38] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 14:16:38] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 14:16:38] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 14:16:38] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-29 14:16:38] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 14:16:38] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:16:38] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:16:38] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:16:39] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 14:16:39] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 14:16:39] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:16:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 12/88 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 93/148 variables, 55/143 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 28/171 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 99/270 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 1/149 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (OVERLAPS) 0/149 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 271 constraints, problems are : Problem set: 0 solved, 99 unsolved in 5943 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 87/87 constraints]
After SMT, in 13083ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 13086ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/264 places, 104/1377 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13629 ms. Remains : 55/264 places, 104/1377 transitions.
[2024-05-29 14:16:43] [INFO ] Flatten gal took : 22 ms
[2024-05-29 14:16:43] [INFO ] Flatten gal took : 4 ms
[2024-05-29 14:16:43] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-29 14:16:43] [INFO ] Flatten gal took : 20 ms
[2024-05-29 14:16:43] [INFO ] Flatten gal took : 4 ms
[2024-05-29 14:16:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality198191834050670128.gal : 1 ms
[2024-05-29 14:16:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality16960850489596951872.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/CTLCardinality198191834050670128.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16960850489596951872.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,2495,0.049882,4984,2,832,5,3981,6,0,310,3069,0


Converting to forward existential form...Done !
original formula: (AF(AG(E(((p52==0)||(p69==1)) U A(((p262==0)||(p5==1)) U ((p318==0)||(p241==1)))))) + (EG(((p126==0)||(p297==1))) * AG(E(((p141==1) * (EF...242
=> equivalent forward existential formula: ([((Init * !(!(EG(!(!(E(TRUE U !(E(((p52==0)||(p69==1)) U !((E(!(((p318==0)||(p241==1))) U (!(((p262==0)||(p5==1...611
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t23...351
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.461497,20852,1,0,370,79397,250,201,3451,77606,496
FORMULA StigmergyCommit-PT-08a-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 1377/1377 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 263 transition count 1227
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 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 183 rules applied. Total rules applied 332 place count 114 transition count 1193
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 342 place count 109 transition count 1188
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 3 with 8 rules applied. Total rules applied 350 place count 108 transition count 1181
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 360 place count 102 transition count 1177
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 19 Pre rules applied. Total rules applied 360 place count 102 transition count 1158
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 398 place count 83 transition count 1158
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 410 place count 71 transition count 1138
Iterating global reduction 5 with 12 rules applied. Total rules applied 422 place count 71 transition count 1138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 423 place count 71 transition count 1137
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 423 place count 71 transition count 1136
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 425 place count 70 transition count 1136
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 431 place count 64 transition count 1124
Iterating global reduction 6 with 6 rules applied. Total rules applied 437 place count 64 transition count 1124
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 6 with 126 rules applied. Total rules applied 563 place count 64 transition count 998
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 583 place count 54 transition count 988
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 593 place count 54 transition count 978
Drop transitions (Redundant composition of simpler transitions.) removed 886 transitions
Redundant transition composition rules discarded 886 transitions
Iterating global reduction 8 with 886 rules applied. Total rules applied 1479 place count 54 transition count 92
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1497 place count 45 transition count 83
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 8 with 5 rules applied. Total rules applied 1502 place count 40 transition count 78
Applied a total of 1502 rules in 140 ms. Remains 40 /264 variables (removed 224) and now considering 78/1377 (removed 1299) transitions.
[2024-05-29 14:16:44] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 40 cols
[2024-05-29 14:16:44] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 14:16:44] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 14:16:44] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2024-05-29 14:16:44] [INFO ] Invariant cache hit.
[2024-05-29 14:16:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-29 14:16:44] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-29 14:16:44] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-29 14:16:44] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2024-05-29 14:16:44] [INFO ] Invariant cache hit.
[2024-05-29 14:16:44] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 4/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:16:44] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 1 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:16:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:16:46] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 14/81 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-29 14:16:47] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-05-29 14:16:47] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-29 14:16:47] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:16:47] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:16:47] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-29 14:16:47] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-29 14:16:47] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:16:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:16:47] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:16:47] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (OVERLAPS) 68/108 variables, 40/131 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/108 variables, 21/152 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/108 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 15 (OVERLAPS) 1/109 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/109 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 17 (OVERLAPS) 0/109 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 153 constraints, problems are : Problem set: 0 solved, 74 unsolved in 5048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 90/90 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 4/40 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 33/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 68/108 variables, 40/131 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 21/152 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 74/226 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 1/109 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (OVERLAPS) 0/109 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 227 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2749 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 90/90 constraints]
After SMT, in 7835ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 7836ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/264 places, 78/1377 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8065 ms. Remains : 40/264 places, 78/1377 transitions.
[2024-05-29 14:16:51] [INFO ] Flatten gal took : 10 ms
[2024-05-29 14:16:51] [INFO ] Flatten gal took : 4 ms
[2024-05-29 14:16:51] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-29 14:16:51] [INFO ] Flatten gal took : 3 ms
[2024-05-29 14:16:51] [INFO ] Flatten gal took : 2 ms
[2024-05-29 14:16:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality2411034363747103664.gal : 0 ms
[2024-05-29 14:16:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality18393356454534169745.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/CTLCardinality2411034363747103664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18393356454534169745.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,2146,0.034719,4416,2,383,5,2856,6,0,225,1755,0


Converting to forward existential form...Done !
original formula: (AF(AG(((((p147==0)||(p142==1))&&(p38==0)) + EF((p209==1))))) * EG(A(EG((p247==0)) U ((p286==0)||(p67==1)))))
=> equivalent forward existential formula: ([FwdG(Init,!(!(E(TRUE U !(((((p147==0)||(p142==1))&&(p38==0)) + E(TRUE U (p209==1))))))))] = FALSE * [(Init * !...283
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t17, t18, t20, t21, t22...305
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.17107,9488,1,0,250,24449,191,108,2753,22612,305
FORMULA StigmergyCommit-PT-08a-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 1377/1377 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 215 transition count 1323
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 215 transition count 1323
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 111 place count 215 transition count 1310
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 139 place count 187 transition count 1279
Iterating global reduction 1 with 28 rules applied. Total rules applied 167 place count 187 transition count 1279
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 174 place count 187 transition count 1272
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 191 place count 170 transition count 1255
Iterating global reduction 2 with 17 rules applied. Total rules applied 208 place count 170 transition count 1255
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 220 place count 158 transition count 1243
Iterating global reduction 2 with 12 rules applied. Total rules applied 232 place count 158 transition count 1243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 233 place count 158 transition count 1242
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 243 place count 148 transition count 1232
Iterating global reduction 3 with 10 rules applied. Total rules applied 253 place count 148 transition count 1232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 255 place count 148 transition count 1230
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 262 place count 141 transition count 1223
Iterating global reduction 4 with 7 rules applied. Total rules applied 269 place count 141 transition count 1223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 272 place count 141 transition count 1220
Applied a total of 272 rules in 36 ms. Remains 141 /264 variables (removed 123) and now considering 1220/1377 (removed 157) transitions.
[2024-05-29 14:16:52] [INFO ] Flow matrix only has 1206 transitions (discarded 14 similar events)
// Phase 1: matrix 1206 rows 141 cols
[2024-05-29 14:16:52] [INFO ] Computed 2 invariants in 10 ms
[2024-05-29 14:16:52] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-29 14:16:52] [INFO ] Flow matrix only has 1206 transitions (discarded 14 similar events)
[2024-05-29 14:16:52] [INFO ] Invariant cache hit.
[2024-05-29 14:16:52] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:16:53] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
Running 1219 sub problems to find dead transitions.
[2024-05-29 14:16:53] [INFO ] Flow matrix only has 1206 transitions (discarded 14 similar events)
[2024-05-29 14:16:53] [INFO ] Invariant cache hit.
[2024-05-29 14:16:53] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
[2024-05-29 14:17:16] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 1 ms to minimize.
[2024-05-29 14:17:16] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 1 ms to minimize.
[2024-05-29 14:17:16] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 1 ms to minimize.
[2024-05-29 14:17:17] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 1 ms to minimize.
[2024-05-29 14:17:17] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 1 ms to minimize.
[2024-05-29 14:17:17] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 1 ms to minimize.
[2024-05-29 14:17:17] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 1 ms to minimize.
[2024-05-29 14:17:17] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 1 ms to minimize.
[2024-05-29 14:17:17] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 0 ms to minimize.
[2024-05-29 14:17:18] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 1 ms to minimize.
[2024-05-29 14:17:18] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
[2024-05-29 14:17:18] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2024-05-29 14:17:18] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-29 14:17:18] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 1 ms to minimize.
[2024-05-29 14:17:18] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 1 ms to minimize.
[2024-05-29 14:17:19] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2024-05-29 14:17:19] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 0 ms to minimize.
[2024-05-29 14:17:19] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2024-05-29 14:17:19] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-05-29 14:17:19] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
[2024-05-29 14:17:20] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 1 ms to minimize.
[2024-05-29 14:17:20] [INFO ] Deduced a trap composed of 16 places in 250 ms of which 1 ms to minimize.
[2024-05-29 14:17:20] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 0 ms to minimize.
[2024-05-29 14:17:20] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 1 ms to minimize.
[2024-05-29 14:17:21] [INFO ] Deduced a trap composed of 13 places in 274 ms of which 1 ms to minimize.
[2024-05-29 14:17:21] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 1 ms to minimize.
[2024-05-29 14:17:21] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 1 ms to minimize.
[2024-05-29 14:17:21] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 1 ms to minimize.
[2024-05-29 14:17:22] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 1 ms to minimize.
[2024-05-29 14:17:22] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 0 ms to minimize.
[2024-05-29 14:17:22] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
[2024-05-29 14:17:22] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 1 ms to minimize.
[2024-05-29 14:17:22] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 0 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 0 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 1 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 0 ms to minimize.
[2024-05-29 14:17:24] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
[2024-05-29 14:17:27] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 1 ms to minimize.
[2024-05-29 14:17:28] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:17:28] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2024-05-29 14:17:28] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:17:28] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2024-05-29 14:17:28] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2024-05-29 14:17:28] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 1 ms to minimize.
[2024-05-29 14:17:28] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 0 ms to minimize.
[2024-05-29 14:17:29] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:17:29] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-05-29 14:17:29] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2024-05-29 14:17:29] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2024-05-29 14:17:29] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2024-05-29 14:17:29] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-29 14:17:29] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 0 ms to minimize.
[2024-05-29 14:17:30] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 0 ms to minimize.
[2024-05-29 14:17:30] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 1 ms to minimize.
[2024-05-29 14:17:30] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 1 ms to minimize.
[2024-05-29 14:17:30] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 0 ms to minimize.
[2024-05-29 14:17:30] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
[2024-05-29 14:17:31] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
[2024-05-29 14:17:31] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 0 ms to minimize.
[2024-05-29 14:17:31] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:17:31] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-29 14:17:31] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 1 ms to minimize.
[2024-05-29 14:17:31] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 0 ms to minimize.
[2024-05-29 14:17:31] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2024-05-29 14:17:32] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2024-05-29 14:17:32] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-29 14:17:32] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 14:17:32] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 1 ms to minimize.
[2024-05-29 14:17:32] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:17:32] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 1 ms to minimize.
[2024-05-29 14:17:32] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-05-29 14:17:33] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 1 ms to minimize.
[2024-05-29 14:17:33] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:17:33] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:17:33] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2024-05-29 14:17:33] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2024-05-29 14:17:33] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
[2024-05-29 14:17:34] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 1 ms to minimize.
[2024-05-29 14:17:34] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:17:34] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 0 ms to minimize.
[2024-05-29 14:17:34] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-29 14:17:34] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:17:35] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2024-05-29 14:17:35] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:17:35] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:17:35] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:17:35] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 0 ms to minimize.
[2024-05-29 14:17:36] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 1 ms to minimize.
[2024-05-29 14:17:36] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:17:36] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2024-05-29 14:17:36] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 1 ms to minimize.
[2024-05-29 14:17:37] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 1 ms to minimize.
[2024-05-29 14:17:37] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 0 ms to minimize.
[2024-05-29 14:17:37] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 1 ms to minimize.
[2024-05-29 14:17:37] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:17:37] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 0 ms to minimize.
[2024-05-29 14:17:37] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 141/1347 variables, and 102 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/141 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1219/187 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
[2024-05-29 14:17:47] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-29 14:17:47] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2024-05-29 14:17:48] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-29 14:17:48] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-29 14:17:48] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-29 14:17:48] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-05-29 14:17:48] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-29 14:17:48] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-29 14:17:48] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2024-05-29 14:17:48] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-29 14:17:48] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 0 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 0 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
[2024-05-29 14:17:52] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-29 14:17:52] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-29 14:17:52] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2024-05-29 14:17:53] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2024-05-29 14:17:53] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:17:54] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 0 ms to minimize.
[2024-05-29 14:17:54] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-29 14:18:01] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 1 ms to minimize.
[2024-05-29 14:18:01] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 9/131 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
[2024-05-29 14:18:04] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:18:04] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-29 14:18:06] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 141/1347 variables, and 134 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/141 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/187 constraints, Known Traps: 132/132 constraints]
After SMT, in 76749ms problems are : Problem set: 0 solved, 1219 unsolved
Search for dead transitions found 0 dead transitions in 76763ms
Starting structural reductions in LTL mode, iteration 1 : 141/264 places, 1220/1377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77706 ms. Remains : 141/264 places, 1220/1377 transitions.
[2024-05-29 14:18:09] [INFO ] Flatten gal took : 52 ms
[2024-05-29 14:18:09] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:18:10] [INFO ] Input system was already deterministic with 1220 transitions.
[2024-05-29 14:18:10] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:18:10] [INFO ] Flatten gal took : 54 ms
[2024-05-29 14:18:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality13848497052447792941.gal : 10 ms
[2024-05-29 14:18:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality9860558406378381189.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/CTLCardinality13848497052447792941.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9860558406378381189.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,5.40965e+07,8.27884,205040,2,9171,5,235438,6,0,1768,125717,0


Converting to forward existential form...Done !
original formula: E(!(((EF(!(((p28==0)||(p8==1)))) * !((EX((p209==1)) + (AX((p34==1)) * EX(((p221==0)||(p77==1))))))) + EX(!(EF((p257==0)))))) U A(EF(((p6=...249
=> equivalent forward existential formula: [((FwdU(Init,!(((E(TRUE U !(((p28==0)||(p8==1)))) * !((EX((p209==1)) + (!(EX(!((p34==1)))) * EX(((p221==0)||(p77...533
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t12, t14, t16, t17, t19, t20, t22, t24, t25, t27, t29, t30, t32,...608
Detected timeout of ITS tools.
[2024-05-29 14:18:40] [INFO ] Flatten gal took : 54 ms
[2024-05-29 14:18:40] [INFO ] Applying decomposition
[2024-05-29 14:18:40] [INFO ] Flatten gal took : 55 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/graph6536526382344097107.txt' '-o' '/tmp/graph6536526382344097107.bin' '-w' '/tmp/graph6536526382344097107.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6536526382344097107.bin' '-l' '-1' '-v' '-w' '/tmp/graph6536526382344097107.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:18:40] [INFO ] Decomposing Gal with order
[2024-05-29 14:18:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:18:40] [INFO ] Removed a total of 9289 redundant transitions.
[2024-05-29 14:18:40] [INFO ] Flatten gal took : 128 ms
[2024-05-29 14:18:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 38 ms.
[2024-05-29 14:18:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality18413666821768505136.gal : 8 ms
[2024-05-29 14:18:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality17860954833921406642.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/CTLCardinality18413666821768505136.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17860954833921406642.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,5.40965e+07,3.30388,61520,4899,33,83409,248,1322,214679,59,707,0


Converting to forward existential form...Done !
original formula: E(!(((EF(!(((i1.u2.p28==0)||(i1.u2.p8==1)))) * !((EX((i8.i4.u27.p209==1)) + (AX((i1.u4.p34==1)) * EX(((i9.u33.p221==0)||(i2.u11.p77==1)))...350
=> equivalent forward existential formula: [((FwdU(Init,!(((E(TRUE U !(((i1.u2.p28==0)||(i1.u2.p8==1)))) * !((EX((i8.i4.u27.p209==1)) + (!(EX(!((i1.u4.p34=...704
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t9, t20, t25, t30, t35, t40, t47, t54, t55, t1197, t1198, t1200, t1203, t1206, t1208,...815
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 1377/1377 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 208 transition count 1313
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 208 transition count 1313
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 125 place count 208 transition count 1300
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 158 place count 175 transition count 1261
Iterating global reduction 1 with 33 rules applied. Total rules applied 191 place count 175 transition count 1261
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 199 place count 175 transition count 1253
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 221 place count 153 transition count 1231
Iterating global reduction 2 with 22 rules applied. Total rules applied 243 place count 153 transition count 1231
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 258 place count 138 transition count 1216
Iterating global reduction 2 with 15 rules applied. Total rules applied 273 place count 138 transition count 1216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 274 place count 138 transition count 1215
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 287 place count 125 transition count 1202
Iterating global reduction 3 with 13 rules applied. Total rules applied 300 place count 125 transition count 1202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 302 place count 125 transition count 1200
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 311 place count 116 transition count 1191
Iterating global reduction 4 with 9 rules applied. Total rules applied 320 place count 116 transition count 1191
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 325 place count 116 transition count 1186
Applied a total of 325 rules in 30 ms. Remains 116 /264 variables (removed 148) and now considering 1186/1377 (removed 191) transitions.
[2024-05-29 14:19:10] [INFO ] Flow matrix only has 1176 transitions (discarded 10 similar events)
// Phase 1: matrix 1176 rows 116 cols
[2024-05-29 14:19:10] [INFO ] Computed 1 invariants in 7 ms
[2024-05-29 14:19:11] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-29 14:19:11] [INFO ] Flow matrix only has 1176 transitions (discarded 10 similar events)
[2024-05-29 14:19:11] [INFO ] Invariant cache hit.
[2024-05-29 14:19:11] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:19:11] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
Running 1185 sub problems to find dead transitions.
[2024-05-29 14:19:11] [INFO ] Flow matrix only has 1176 transitions (discarded 10 similar events)
[2024-05-29 14:19:11] [INFO ] Invariant cache hit.
[2024-05-29 14:19:11] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
[2024-05-29 14:19:36] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 1 ms to minimize.
[2024-05-29 14:19:36] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 1 ms to minimize.
[2024-05-29 14:19:36] [INFO ] Deduced a trap composed of 16 places in 228 ms of which 0 ms to minimize.
[2024-05-29 14:19:36] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 0 ms to minimize.
[2024-05-29 14:19:37] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 0 ms to minimize.
[2024-05-29 14:19:37] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 1 ms to minimize.
[2024-05-29 14:19:37] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 1 ms to minimize.
[2024-05-29 14:19:37] [INFO ] Deduced a trap composed of 17 places in 249 ms of which 1 ms to minimize.
[2024-05-29 14:19:38] [INFO ] Deduced a trap composed of 16 places in 234 ms of which 1 ms to minimize.
[2024-05-29 14:19:38] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 0 ms to minimize.
[2024-05-29 14:19:38] [INFO ] Deduced a trap composed of 16 places in 235 ms of which 1 ms to minimize.
[2024-05-29 14:19:38] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 1 ms to minimize.
[2024-05-29 14:19:39] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 1 ms to minimize.
[2024-05-29 14:19:39] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 1 ms to minimize.
[2024-05-29 14:19:39] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 0 ms to minimize.
[2024-05-29 14:19:39] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 0 ms to minimize.
[2024-05-29 14:19:39] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 1 ms to minimize.
[2024-05-29 14:19:39] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:19:40] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:19:40] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
[2024-05-29 14:19:40] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 14:19:40] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-29 14:19:40] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-29 14:19:40] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 14:19:40] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 0 ms to minimize.
[2024-05-29 14:19:41] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:19:41] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
[2024-05-29 14:19:41] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:19:41] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2024-05-29 14:19:41] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2024-05-29 14:19:41] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:19:41] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 0 ms to minimize.
[2024-05-29 14:19:42] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-29 14:19:42] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:19:42] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-05-29 14:19:42] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2024-05-29 14:19:42] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 0 ms to minimize.
[2024-05-29 14:19:42] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 1 ms to minimize.
[2024-05-29 14:19:43] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 0 ms to minimize.
[2024-05-29 14:19:43] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
[2024-05-29 14:19:46] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 0 ms to minimize.
[2024-05-29 14:19:46] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 0 ms to minimize.
[2024-05-29 14:19:46] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:19:46] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 0 ms to minimize.
[2024-05-29 14:19:46] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2024-05-29 14:19:46] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:19:47] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2024-05-29 14:19:47] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2024-05-29 14:19:47] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-29 14:19:47] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-05-29 14:19:47] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:19:47] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 14:19:47] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-29 14:19:47] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 0 ms to minimize.
[2024-05-29 14:19:47] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:19:47] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 0 ms to minimize.
[2024-05-29 14:19:48] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-05-29 14:19:48] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-05-29 14:19:48] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:19:48] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
[2024-05-29 14:19:49] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 0 ms to minimize.
[2024-05-29 14:19:49] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 0 ms to minimize.
[2024-05-29 14:19:49] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-29 14:19:49] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 1 ms to minimize.
[2024-05-29 14:19:49] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 1 ms to minimize.
[2024-05-29 14:19:50] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 3 ms to minimize.
[2024-05-29 14:19:50] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 0 ms to minimize.
[2024-05-29 14:19:50] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 0 ms to minimize.
[2024-05-29 14:19:50] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 1 ms to minimize.
[2024-05-29 14:19:50] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:19:50] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:19:50] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2024-05-29 14:19:50] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-05-29 14:19:51] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-29 14:19:51] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-29 14:19:51] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2024-05-29 14:19:51] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2024-05-29 14:19:51] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:19:51] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-29 14:19:51] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
[2024-05-29 14:19:52] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 14:19:52] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-29 14:19:52] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 1 ms to minimize.
[2024-05-29 14:19:52] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:19:52] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 1 ms to minimize.
[2024-05-29 14:19:52] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 1 ms to minimize.
[2024-05-29 14:19:53] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 0 ms to minimize.
[2024-05-29 14:19:53] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:19:53] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 0 ms to minimize.
[2024-05-29 14:19:53] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:19:53] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:19:53] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2024-05-29 14:19:53] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2024-05-29 14:19:54] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2024-05-29 14:19:54] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 14:19:58] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2024-05-29 14:19:58] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-29 14:19:58] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:19:58] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-29 14:19:58] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 116/1292 variables, and 101 constraints, problems are : Problem set: 0 solved, 1185 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/116 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1185/153 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
[2024-05-29 14:20:05] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2024-05-29 14:20:05] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 14:20:05] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:20:05] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-29 14:20:05] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2024-05-29 14:20:05] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 0 ms to minimize.
[2024-05-29 14:20:05] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
[2024-05-29 14:20:10] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-29 14:20:10] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:20:11] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 1 ms to minimize.
[2024-05-29 14:20:11] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 1 ms to minimize.
[2024-05-29 14:20:11] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:20:11] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 1 ms to minimize.
[2024-05-29 14:20:12] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:20:12] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 116/1292 variables, and 130 constraints, problems are : Problem set: 0 solved, 1185 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/116 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/153 constraints, Known Traps: 129/129 constraints]
After SMT, in 78680ms problems are : Problem set: 0 solved, 1185 unsolved
Search for dead transitions found 0 dead transitions in 78695ms
Starting structural reductions in LTL mode, iteration 1 : 116/264 places, 1186/1377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79717 ms. Remains : 116/264 places, 1186/1377 transitions.
[2024-05-29 14:20:30] [INFO ] Flatten gal took : 51 ms
[2024-05-29 14:20:30] [INFO ] Flatten gal took : 54 ms
[2024-05-29 14:20:30] [INFO ] Input system was already deterministic with 1186 transitions.
[2024-05-29 14:20:30] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:20:30] [INFO ] Flatten gal took : 54 ms
[2024-05-29 14:20:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality16474545212102777110.gal : 11 ms
[2024-05-29 14:20:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality3037832601353102990.ctl : 5 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/CTLCardinality16474545212102777110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3037832601353102990.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,5.40002e+07,10.2012,227180,2,9141,5,193584,6,0,1640,114163,0


Converting to forward existential form...Done !
original formula: AF(AX(EG((((p255==0)||(p174==1))||((p38==0)||(p122==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(EG((((p255==0)||(p174==1))||((p38==0)||(p122==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t10, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31,...576
Detected timeout of ITS tools.
[2024-05-29 14:21:01] [INFO ] Flatten gal took : 53 ms
[2024-05-29 14:21:01] [INFO ] Applying decomposition
[2024-05-29 14:21:01] [INFO ] Flatten gal took : 53 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/graph14191646229978043246.txt' '-o' '/tmp/graph14191646229978043246.bin' '-w' '/tmp/graph14191646229978043246.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14191646229978043246.bin' '-l' '-1' '-v' '-w' '/tmp/graph14191646229978043246.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:21:01] [INFO ] Decomposing Gal with order
[2024-05-29 14:21:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:21:01] [INFO ] Removed a total of 9275 redundant transitions.
[2024-05-29 14:21:01] [INFO ] Flatten gal took : 116 ms
[2024-05-29 14:21:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 30 ms.
[2024-05-29 14:21:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality10089992787170381086.gal : 6 ms
[2024-05-29 14:21:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality4139089528556158815.ctl : 62 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/CTLCardinality10089992787170381086.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4139089528556158815.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,5.40002e+07,3.49109,131372,3681,38,54065,515,1071,1.37446e+06,72,2020,0


Converting to forward existential form...Done !
original formula: AF(AX(EG((((u31.p255==0)||(i8.u22.p174==1))||((i1.u6.p38==0)||(i0.i2.u14.p122==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(EG((((u31.p255==0)||(i8.u22.p174==1))||((i1.u6.p38==0)||(i0.i2.u14.p122==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t8, t18, t23, t31, t38, t45, t57, t1168, t1170, t1172, t1174, t1176, t1178, t1180, t1...865
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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
(forward)formula 0,1,15.2356,396448,1,0,173593,515,17379,3.49689e+06,302,2020,2495133
FORMULA StigmergyCommit-PT-08a-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 1377/1377 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 263 transition count 1215
Reduce places removed 161 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 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 198 rules applied. Total rules applied 359 place count 102 transition count 1178
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 369 place count 97 transition count 1173
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 371 place count 96 transition count 1172
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 371 place count 96 transition count 1155
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 405 place count 79 transition count 1155
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 417 place count 67 transition count 1135
Iterating global reduction 4 with 12 rules applied. Total rules applied 429 place count 67 transition count 1135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 432 place count 67 transition count 1132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 432 place count 67 transition count 1131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 434 place count 66 transition count 1131
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 441 place count 59 transition count 1117
Iterating global reduction 5 with 7 rules applied. Total rules applied 448 place count 59 transition count 1117
Ensure Unique test removed 508 transitions
Reduce isomorphic transitions removed 508 transitions.
Iterating post reduction 5 with 508 rules applied. Total rules applied 956 place count 59 transition count 609
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 976 place count 49 transition count 599
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 986 place count 49 transition count 589
Drop transitions (Redundant composition of simpler transitions.) removed 513 transitions
Redundant transition composition rules discarded 513 transitions
Iterating global reduction 7 with 513 rules applied. Total rules applied 1499 place count 49 transition count 76
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1517 place count 40 transition count 67
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1525 place count 32 transition count 59
Applied a total of 1525 rules in 80 ms. Remains 32 /264 variables (removed 232) and now considering 59/1377 (removed 1318) transitions.
[2024-05-29 14:21:16] [INFO ] Flow matrix only has 50 transitions (discarded 9 similar events)
// Phase 1: matrix 50 rows 32 cols
[2024-05-29 14:21:16] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 14:21:17] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-29 14:21:17] [INFO ] Flow matrix only has 50 transitions (discarded 9 similar events)
[2024-05-29 14:21:17] [INFO ] Invariant cache hit.
[2024-05-29 14:21:17] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 14:21:17] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-05-29 14:21:17] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-29 14:21:17] [INFO ] Flow matrix only has 50 transitions (discarded 9 similar events)
[2024-05-29 14:21:17] [INFO ] Invariant cache hit.
[2024-05-29 14:21:17] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:21:19] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:21:19] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 49/81 variables, 32/105 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 14:21:19] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:21:19] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:21:19] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-29 14:21:19] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:21:19] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 5/118 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/81 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (OVERLAPS) 1/82 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/82 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 14 (OVERLAPS) 0/82 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 119 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2975 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 14:21:20] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:21:20] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:21:20] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:21:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 49/81 variables, 32/114 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 58/180 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 14:21:21] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (OVERLAPS) 1/82 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/82 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (OVERLAPS) 0/82 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 182 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1979 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 82/82 constraints]
After SMT, in 4983ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 4984ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/264 places, 59/1377 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5271 ms. Remains : 32/264 places, 59/1377 transitions.
[2024-05-29 14:21:22] [INFO ] Flatten gal took : 5 ms
[2024-05-29 14:21:22] [INFO ] Flatten gal took : 4 ms
[2024-05-29 14:21:22] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-29 14:21:22] [INFO ] Flatten gal took : 1 ms
[2024-05-29 14:21:22] [INFO ] Flatten gal took : 1 ms
[2024-05-29 14:21:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality5365876933331618270.gal : 0 ms
[2024-05-29 14:21:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality7486127956637877209.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/CTLCardinality5365876933331618270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7486127956637877209.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,534,0.01802,4052,2,191,5,1483,6,0,177,949,0


Converting to forward existential form...Done !
original formula: (EF((p141==1)) * AF((p23==1)))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (p141==1))))] = FALSE * [FwdG(Init,!((p23==1)))] = FALSE)
Hit Full ! (commute/partial/dont) 57/0/2
(forward)formula 0,0,0.036932,4636,1,0,10,4171,20,2,1300,2654,10
FORMULA StigmergyCommit-PT-08a-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 1377/1377 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 213 transition count 1320
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 213 transition count 1320
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 114 place count 213 transition count 1308
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 142 place count 185 transition count 1277
Iterating global reduction 1 with 28 rules applied. Total rules applied 170 place count 185 transition count 1277
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 177 place count 185 transition count 1270
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 195 place count 167 transition count 1252
Iterating global reduction 2 with 18 rules applied. Total rules applied 213 place count 167 transition count 1252
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 225 place count 155 transition count 1240
Iterating global reduction 2 with 12 rules applied. Total rules applied 237 place count 155 transition count 1240
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 248 place count 144 transition count 1229
Iterating global reduction 2 with 11 rules applied. Total rules applied 259 place count 144 transition count 1229
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 261 place count 144 transition count 1227
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 267 place count 138 transition count 1221
Iterating global reduction 3 with 6 rules applied. Total rules applied 273 place count 138 transition count 1221
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 277 place count 138 transition count 1217
Applied a total of 277 rules in 33 ms. Remains 138 /264 variables (removed 126) and now considering 1217/1377 (removed 160) transitions.
[2024-05-29 14:21:22] [INFO ] Flow matrix only has 1205 transitions (discarded 12 similar events)
// Phase 1: matrix 1205 rows 138 cols
[2024-05-29 14:21:22] [INFO ] Computed 1 invariants in 9 ms
[2024-05-29 14:21:22] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-29 14:21:22] [INFO ] Flow matrix only has 1205 transitions (discarded 12 similar events)
[2024-05-29 14:21:22] [INFO ] Invariant cache hit.
[2024-05-29 14:21:22] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:21:23] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
Running 1216 sub problems to find dead transitions.
[2024-05-29 14:21:23] [INFO ] Flow matrix only has 1205 transitions (discarded 12 similar events)
[2024-05-29 14:21:23] [INFO ] Invariant cache hit.
[2024-05-29 14:21:23] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-29 14:21:44] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 1 ms to minimize.
[2024-05-29 14:21:45] [INFO ] Deduced a trap composed of 17 places in 244 ms of which 0 ms to minimize.
[2024-05-29 14:21:45] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 1 ms to minimize.
[2024-05-29 14:21:45] [INFO ] Deduced a trap composed of 14 places in 279 ms of which 1 ms to minimize.
[2024-05-29 14:21:45] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 1 ms to minimize.
[2024-05-29 14:21:46] [INFO ] Deduced a trap composed of 16 places in 238 ms of which 1 ms to minimize.
[2024-05-29 14:21:46] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 0 ms to minimize.
[2024-05-29 14:21:46] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 0 ms to minimize.
[2024-05-29 14:21:46] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 0 ms to minimize.
[2024-05-29 14:21:47] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 1 ms to minimize.
[2024-05-29 14:21:47] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 0 ms to minimize.
[2024-05-29 14:21:47] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 1 ms to minimize.
[2024-05-29 14:21:47] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 0 ms to minimize.
[2024-05-29 14:21:47] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 0 ms to minimize.
[2024-05-29 14:21:48] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 1 ms to minimize.
[2024-05-29 14:21:48] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 1 ms to minimize.
[2024-05-29 14:21:48] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 1 ms to minimize.
[2024-05-29 14:21:48] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 1 ms to minimize.
[2024-05-29 14:21:48] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 0 ms to minimize.
[2024-05-29 14:21:48] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-29 14:21:49] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 1 ms to minimize.
[2024-05-29 14:21:49] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 0 ms to minimize.
[2024-05-29 14:21:49] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 0 ms to minimize.
[2024-05-29 14:21:49] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-05-29 14:21:49] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:21:50] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 0 ms to minimize.
[2024-05-29 14:21:50] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2024-05-29 14:21:50] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:21:50] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2024-05-29 14:21:50] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 14:21:50] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2024-05-29 14:21:50] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-29 14:21:50] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 0 ms to minimize.
[2024-05-29 14:21:50] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-29 14:21:51] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 1 ms to minimize.
[2024-05-29 14:21:51] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:21:51] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:21:51] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:21:51] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 1 ms to minimize.
[2024-05-29 14:21:51] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-29 14:21:55] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
[2024-05-29 14:21:55] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2024-05-29 14:21:55] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2024-05-29 14:21:55] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-29 14:21:55] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-29 14:21:55] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2024-05-29 14:21:55] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 1 ms to minimize.
[2024-05-29 14:21:56] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 0 ms to minimize.
[2024-05-29 14:21:56] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2024-05-29 14:21:56] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:21:56] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-29 14:21:56] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 14:21:56] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-29 14:21:56] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:21:56] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 0 ms to minimize.
[2024-05-29 14:21:57] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 0 ms to minimize.
[2024-05-29 14:21:57] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2024-05-29 14:21:57] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:21:57] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-29 14:21:57] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-29 14:21:57] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 1 ms to minimize.
[2024-05-29 14:21:58] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 0 ms to minimize.
[2024-05-29 14:21:58] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:21:58] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:21:58] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2024-05-29 14:21:58] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:21:58] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:21:58] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2024-05-29 14:21:59] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2024-05-29 14:21:59] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:21:59] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:21:59] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2024-05-29 14:21:59] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2024-05-29 14:21:59] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 0 ms to minimize.
[2024-05-29 14:21:59] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2024-05-29 14:21:59] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2024-05-29 14:22:00] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2024-05-29 14:22:00] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 1 ms to minimize.
[2024-05-29 14:22:00] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:22:00] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-29 14:22:00] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:22:01] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2024-05-29 14:22:01] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:22:01] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-29 14:22:01] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2024-05-29 14:22:01] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:22:01] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2024-05-29 14:22:01] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-29 14:22:01] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:22:01] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:22:02] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 0 ms to minimize.
[2024-05-29 14:22:02] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 0 ms to minimize.
[2024-05-29 14:22:02] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-05-29 14:22:02] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2024-05-29 14:22:02] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:22:02] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-29 14:22:02] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2024-05-29 14:22:02] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:22:02] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 0 ms to minimize.
[2024-05-29 14:22:02] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-29 14:22:07] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-29 14:22:07] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:22:07] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
[2024-05-29 14:22:07] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:22:07] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 1 ms to minimize.
[2024-05-29 14:22:08] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:22:08] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 0 ms to minimize.
[2024-05-29 14:22:08] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 14:22:08] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 0 ms to minimize.
[2024-05-29 14:22:08] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
SMT process timed out in 45420ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 45434ms
Starting structural reductions in LTL mode, iteration 1 : 138/264 places, 1217/1377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46382 ms. Remains : 138/264 places, 1217/1377 transitions.
[2024-05-29 14:22:08] [INFO ] Flatten gal took : 50 ms
[2024-05-29 14:22:08] [INFO ] Flatten gal took : 54 ms
[2024-05-29 14:22:08] [INFO ] Input system was already deterministic with 1217 transitions.
[2024-05-29 14:22:08] [INFO ] Flatten gal took : 54 ms
[2024-05-29 14:22:08] [INFO ] Flatten gal took : 54 ms
[2024-05-29 14:22:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality3357070186398447096.gal : 10 ms
[2024-05-29 14:22:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality761537364015811323.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/CTLCardinality3357070186398447096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality761537364015811323.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,5.40954e+07,8.5773,214796,2,9659,5,237496,6,0,1757,127765,0


Converting to forward existential form...Done !
original formula: E((AX((!(((p72==1)&&((p185==0)||(p102==1)))) + A((p134==1) U (p167==1)))) * (AG((p252==0)) + !(((EG(((p181==0)||(p273==1))) + (p191==0)) ...250
=> equivalent forward existential formula: [(EY(FwdU(FwdU(Init,(!(EX(!((!(((p72==1)&&((p185==0)||(p102==1)))) + !((E(!((p167==1)) U (!((p134==1)) * !((p167...386
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t9, t10, t11, t12, t13, t15, t17, t18, t20, t22, t23, t25, t26, t...624
Detected timeout of ITS tools.
[2024-05-29 14:22:39] [INFO ] Flatten gal took : 56 ms
[2024-05-29 14:22:39] [INFO ] Applying decomposition
[2024-05-29 14:22:39] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15031773983601982603.txt' '-o' '/tmp/graph15031773983601982603.bin' '-w' '/tmp/graph15031773983601982603.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15031773983601982603.bin' '-l' '-1' '-v' '-w' '/tmp/graph15031773983601982603.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:22:39] [INFO ] Decomposing Gal with order
[2024-05-29 14:22:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:22:39] [INFO ] Removed a total of 9278 redundant transitions.
[2024-05-29 14:22:39] [INFO ] Flatten gal took : 118 ms
[2024-05-29 14:22:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 43 ms.
[2024-05-29 14:22:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality11263778635266090056.gal : 7 ms
[2024-05-29 14:22:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality13405017169477359329.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/CTLCardinality11263778635266090056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13405017169477359329.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,5.40954e+07,4.86947,185076,5812,33,155334,353,1369,1.49915e+06,67,1398,0


Converting to forward existential form...Done !
original formula: E((AX((!(((i0.i1.u9.p72==1)&&((i4.u25.p185==0)||(i8.u31.p102==1)))) + A((i0.i3.u16.p134==1) U (i2.i1.u21.p167==1)))) * (AG((i5.u33.p252==...375
=> equivalent forward existential formula: [(EY(FwdU(FwdU(Init,(!(EX(!((!(((i0.i1.u9.p72==1)&&((i4.u25.p185==0)||(i8.u31.p102==1)))) + !((E(!((i2.i1.u21.p1...531
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t6, t10, t15, t17, t22, t28, t31, t35, t46, t49, t54, t64, t1195, t1198, t1200, t1202...871
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 1377/1377 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 158 rules applied. Total rules applied 158 place count 263 transition count 1218
Reduce places removed 158 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 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 194 rules applied. Total rules applied 352 place count 105 transition count 1182
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 359 place count 101 transition count 1179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 360 place count 100 transition count 1179
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 360 place count 100 transition count 1164
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 390 place count 85 transition count 1164
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 403 place count 72 transition count 1143
Iterating global reduction 4 with 13 rules applied. Total rules applied 416 place count 72 transition count 1143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 419 place count 72 transition count 1140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 419 place count 72 transition count 1139
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 421 place count 71 transition count 1139
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 428 place count 64 transition count 1125
Iterating global reduction 5 with 7 rules applied. Total rules applied 435 place count 64 transition count 1125
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Iterating post reduction 5 with 252 rules applied. Total rules applied 687 place count 64 transition count 873
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 709 place count 53 transition count 862
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 719 place count 53 transition count 852
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 721 place count 52 transition count 851
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 722 place count 52 transition count 850
Drop transitions (Redundant composition of simpler transitions.) removed 761 transitions
Redundant transition composition rules discarded 761 transitions
Iterating global reduction 8 with 761 rules applied. Total rules applied 1483 place count 52 transition count 89
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1501 place count 43 transition count 80
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1503 place count 43 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1504 place count 43 transition count 79
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1512 place count 35 transition count 71
Applied a total of 1512 rules in 121 ms. Remains 35 /264 variables (removed 229) and now considering 71/1377 (removed 1306) transitions.
[2024-05-29 14:23:09] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
// Phase 1: matrix 62 rows 35 cols
[2024-05-29 14:23:09] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 14:23:09] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 14:23:09] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
[2024-05-29 14:23:09] [INFO ] Invariant cache hit.
[2024-05-29 14:23:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 14:23:09] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-29 14:23:09] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
[2024-05-29 14:23:09] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
[2024-05-29 14:23:09] [INFO ] Invariant cache hit.
[2024-05-29 14:23:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 9/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 14:23:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 14:23:09] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:23:09] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:23:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 14:23:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:23:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:23:10] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 61/96 variables, 35/109 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:23:11] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:23:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:23:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:23:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:23:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 8/117 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 14:23:12] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/96 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/96 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (OVERLAPS) 1/97 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/97 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 14 (OVERLAPS) 0/97 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 119 constraints, problems are : Problem set: 0 solved, 45 unsolved in 3537 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 9/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 61/96 variables, 35/118 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 45/163 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 1/97 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/97 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 164 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1259 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 82/82 constraints]
After SMT, in 4802ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 4803ms
Starting structural reductions in SI_CTL mode, iteration 1 : 35/264 places, 71/1377 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5021 ms. Remains : 35/264 places, 71/1377 transitions.
[2024-05-29 14:23:14] [INFO ] Flatten gal took : 7 ms
[2024-05-29 14:23:14] [INFO ] Flatten gal took : 2 ms
[2024-05-29 14:23:14] [INFO ] Input system was already deterministic with 71 transitions.
[2024-05-29 14:23:14] [INFO ] Flatten gal took : 2 ms
[2024-05-29 14:23:14] [INFO ] Flatten gal took : 2 ms
[2024-05-29 14:23:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality18183588954846230458.gal : 1 ms
[2024-05-29 14:23:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality15357676086929852432.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/CTLCardinality18183588954846230458.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15357676086929852432.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,1047,0.026087,4296,2,224,5,1914,6,0,202,1216,0


Converting to forward existential form...Done !
original formula: EG(AF(E(A((p232==0) U (p136==1)) U ((p161==1)||(p3==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(E(!((E(!((p136==1)) U (!((p232==0)) * !((p136==1)))) + EG(!((p136==1))))) U ((p161==1)||(p3==1...172
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t19, t22, t25, t41...290
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.117173,7256,1,0,206,17818,173,104,2338,16804,258
FORMULA StigmergyCommit-PT-08a-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 1377/1377 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 210 transition count 1316
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 210 transition count 1316
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 121 place count 210 transition count 1303
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 153 place count 178 transition count 1265
Iterating global reduction 1 with 32 rules applied. Total rules applied 185 place count 178 transition count 1265
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 193 place count 178 transition count 1257
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 214 place count 157 transition count 1236
Iterating global reduction 2 with 21 rules applied. Total rules applied 235 place count 157 transition count 1236
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 249 place count 143 transition count 1222
Iterating global reduction 2 with 14 rules applied. Total rules applied 263 place count 143 transition count 1222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 143 transition count 1221
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 276 place count 131 transition count 1209
Iterating global reduction 3 with 12 rules applied. Total rules applied 288 place count 131 transition count 1209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 290 place count 131 transition count 1207
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 298 place count 123 transition count 1199
Iterating global reduction 4 with 8 rules applied. Total rules applied 306 place count 123 transition count 1199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 310 place count 123 transition count 1195
Applied a total of 310 rules in 34 ms. Remains 123 /264 variables (removed 141) and now considering 1195/1377 (removed 182) transitions.
[2024-05-29 14:23:14] [INFO ] Flow matrix only has 1184 transitions (discarded 11 similar events)
// Phase 1: matrix 1184 rows 123 cols
[2024-05-29 14:23:14] [INFO ] Computed 1 invariants in 7 ms
[2024-05-29 14:23:15] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-29 14:23:15] [INFO ] Flow matrix only has 1184 transitions (discarded 11 similar events)
[2024-05-29 14:23:15] [INFO ] Invariant cache hit.
[2024-05-29 14:23:15] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:23:15] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 967 ms to find 0 implicit places.
Running 1194 sub problems to find dead transitions.
[2024-05-29 14:23:15] [INFO ] Flow matrix only has 1184 transitions (discarded 11 similar events)
[2024-05-29 14:23:15] [INFO ] Invariant cache hit.
[2024-05-29 14:23:15] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-29 14:23:37] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 0 ms to minimize.
[2024-05-29 14:23:37] [INFO ] Deduced a trap composed of 13 places in 251 ms of which 0 ms to minimize.
[2024-05-29 14:23:37] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 1 ms to minimize.
[2024-05-29 14:23:37] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 0 ms to minimize.
[2024-05-29 14:23:37] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 0 ms to minimize.
[2024-05-29 14:23:38] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 1 ms to minimize.
[2024-05-29 14:23:38] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 0 ms to minimize.
[2024-05-29 14:23:38] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 1 ms to minimize.
[2024-05-29 14:23:38] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:23:38] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 0 ms to minimize.
[2024-05-29 14:23:38] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:23:39] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 1 ms to minimize.
[2024-05-29 14:23:39] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 1 ms to minimize.
[2024-05-29 14:23:39] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 0 ms to minimize.
[2024-05-29 14:23:39] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 1 ms to minimize.
[2024-05-29 14:23:39] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 0 ms to minimize.
[2024-05-29 14:23:40] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:23:40] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 0 ms to minimize.
[2024-05-29 14:23:40] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:23:40] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-29 14:23:40] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2024-05-29 14:23:41] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 1 ms to minimize.
[2024-05-29 14:23:41] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:23:41] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2024-05-29 14:23:41] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2024-05-29 14:23:41] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-05-29 14:23:41] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2024-05-29 14:23:41] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-29 14:23:41] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 14:23:42] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-05-29 14:23:42] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 14:23:42] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 0 ms to minimize.
[2024-05-29 14:23:42] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:23:42] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:23:42] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
[2024-05-29 14:23:42] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 14:23:42] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2024-05-29 14:23:42] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2024-05-29 14:23:42] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 14:23:43] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-29 14:23:46] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:23:46] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:23:46] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2024-05-29 14:23:46] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2024-05-29 14:23:46] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 0 ms to minimize.
[2024-05-29 14:23:47] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 0 ms to minimize.
[2024-05-29 14:23:47] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 0 ms to minimize.
[2024-05-29 14:23:47] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 0 ms to minimize.
[2024-05-29 14:23:47] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 1 ms to minimize.
[2024-05-29 14:23:47] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 1 ms to minimize.
[2024-05-29 14:23:47] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2024-05-29 14:23:48] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2024-05-29 14:23:48] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-29 14:23:48] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:23:48] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2024-05-29 14:23:48] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-29 14:23:48] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 14:23:48] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 14:23:48] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 0 ms to minimize.
[2024-05-29 14:23:48] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-29 14:23:49] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2024-05-29 14:23:49] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-29 14:23:49] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:23:49] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 14:23:49] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 1 ms to minimize.
[2024-05-29 14:23:49] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 14:23:50] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 1 ms to minimize.
[2024-05-29 14:23:50] [INFO ] Deduced a trap composed of 17 places in 269 ms of which 1 ms to minimize.
[2024-05-29 14:23:50] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 1 ms to minimize.
[2024-05-29 14:23:50] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 1 ms to minimize.
[2024-05-29 14:23:51] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 0 ms to minimize.
[2024-05-29 14:23:51] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 0 ms to minimize.
[2024-05-29 14:23:51] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 1 ms to minimize.
[2024-05-29 14:23:51] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 1 ms to minimize.
[2024-05-29 14:23:51] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 0 ms to minimize.
[2024-05-29 14:23:51] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:23:52] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 0 ms to minimize.
[2024-05-29 14:23:52] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:23:52] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-05-29 14:23:52] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-29 14:23:53] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:23:53] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-29 14:23:53] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:23:53] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2024-05-29 14:23:53] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2024-05-29 14:23:53] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-29 14:23:53] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2024-05-29 14:23:53] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 0 ms to minimize.
[2024-05-29 14:23:53] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-29 14:23:54] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 0 ms to minimize.
[2024-05-29 14:23:54] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2024-05-29 14:23:54] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 14:23:54] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-29 14:23:54] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2024-05-29 14:23:54] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-29 14:23:54] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:23:54] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:23:55] [INFO ] Deduced a trap composed of 17 places in 265 ms of which 1 ms to minimize.
[2024-05-29 14:23:55] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-05-29 14:23:55] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-29 14:23:58] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:23:58] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-29 14:23:58] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2024-05-29 14:23:58] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 14:23:59] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 0 ms to minimize.
[2024-05-29 14:23:59] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-05-29 14:23:59] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2024-05-29 14:23:59] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:23:59] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-29 14:23:59] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 14:23:59] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/1307 variables, and 112 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/123 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1194/162 constraints, Known Traps: 111/111 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 111/112 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-29 14:24:04] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-29 14:24:04] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2024-05-29 14:24:06] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-29 14:24:06] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-29 14:24:06] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:24:06] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-29 14:24:07] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:24:07] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 14:24:12] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 16/128 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-29 14:24:15] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-29 14:24:24] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 123/1307 variables, and 130 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/123 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/162 constraints, Known Traps: 129/129 constraints]
After SMT, in 75316ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 75330ms
Starting structural reductions in LTL mode, iteration 1 : 123/264 places, 1195/1377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76337 ms. Remains : 123/264 places, 1195/1377 transitions.
[2024-05-29 14:24:31] [INFO ] Flatten gal took : 51 ms
[2024-05-29 14:24:31] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:24:31] [INFO ] Input system was already deterministic with 1195 transitions.
[2024-05-29 14:24:31] [INFO ] Flatten gal took : 57 ms
[2024-05-29 14:24:31] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:24:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality695209478190991129.gal : 11 ms
[2024-05-29 14:24:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality4142930183072948797.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/CTLCardinality695209478190991129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4142930183072948797.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,5.4033e+07,11.454,269992,2,11021,5,216542,6,0,1676,130155,0


Converting to forward existential form...Done !
original formula: !(A(AG(EX(AX(((p305==0)||(p77==1))))) U AG(!(EG(((p106==0)||(p100==1)))))))
=> equivalent forward existential formula: ([FwdG(FwdU((FwdU(Init,!(!(E(TRUE U !(!(EG(((p106==0)||(p100==1))))))))) * !(!(E(TRUE U !(EX(!(EX(!(((p305==0)||...287
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...575
Detected timeout of ITS tools.
[2024-05-29 14:25:01] [INFO ] Flatten gal took : 56 ms
[2024-05-29 14:25:01] [INFO ] Applying decomposition
[2024-05-29 14:25:01] [INFO ] Flatten gal took : 56 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/graph3364491995779660947.txt' '-o' '/tmp/graph3364491995779660947.bin' '-w' '/tmp/graph3364491995779660947.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3364491995779660947.bin' '-l' '-1' '-v' '-w' '/tmp/graph3364491995779660947.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:25:01] [INFO ] Decomposing Gal with order
[2024-05-29 14:25:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:25:01] [INFO ] Removed a total of 9276 redundant transitions.
[2024-05-29 14:25:01] [INFO ] Flatten gal took : 119 ms
[2024-05-29 14:25:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 50 ms.
[2024-05-29 14:25:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality15197946381291485895.gal : 8 ms
[2024-05-29 14:25:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality12255727321332217834.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/CTLCardinality15197946381291485895.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12255727321332217834.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,5.4033e+07,7.29361,274516,5388,26,147038,259,1443,2.47591e+06,54,1138,0


Converting to forward existential form...Done !
original formula: !(A(AG(EX(AX(((i8.i0.u41.p305==0)||(i3.u10.p77==1))))) U AG(!(EG(((i0.i1.u12.p106==0)||(i0.i1.u11.p100==1)))))))
=> equivalent forward existential formula: ([FwdG(FwdU((FwdU(Init,!(!(E(TRUE U !(!(EG(((i0.i1.u12.p106==0)||(i0.i1.u11.p100==1))))))))) * !(!(E(TRUE U !(EX...364
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t14, t18, t28, t36, t39, t46, t1175, t1177, t1179, t1181, t1183, t1185, t1187, t1191,...818
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 1377/1377 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 208 transition count 1313
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 208 transition count 1313
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 126 place count 208 transition count 1299
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 158 place count 176 transition count 1260
Iterating global reduction 1 with 32 rules applied. Total rules applied 190 place count 176 transition count 1260
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 197 place count 176 transition count 1253
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 220 place count 153 transition count 1230
Iterating global reduction 2 with 23 rules applied. Total rules applied 243 place count 153 transition count 1230
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 257 place count 139 transition count 1216
Iterating global reduction 2 with 14 rules applied. Total rules applied 271 place count 139 transition count 1216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 272 place count 139 transition count 1215
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 284 place count 127 transition count 1203
Iterating global reduction 3 with 12 rules applied. Total rules applied 296 place count 127 transition count 1203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 298 place count 127 transition count 1201
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 307 place count 118 transition count 1192
Iterating global reduction 4 with 9 rules applied. Total rules applied 316 place count 118 transition count 1192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 320 place count 118 transition count 1188
Applied a total of 320 rules in 36 ms. Remains 118 /264 variables (removed 146) and now considering 1188/1377 (removed 189) transitions.
[2024-05-29 14:25:32] [INFO ] Flow matrix only has 1178 transitions (discarded 10 similar events)
// Phase 1: matrix 1178 rows 118 cols
[2024-05-29 14:25:32] [INFO ] Computed 1 invariants in 10 ms
[2024-05-29 14:25:32] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-29 14:25:32] [INFO ] Flow matrix only has 1178 transitions (discarded 10 similar events)
[2024-05-29 14:25:32] [INFO ] Invariant cache hit.
[2024-05-29 14:25:32] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:25:32] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 893 ms to find 0 implicit places.
Running 1187 sub problems to find dead transitions.
[2024-05-29 14:25:32] [INFO ] Flow matrix only has 1178 transitions (discarded 10 similar events)
[2024-05-29 14:25:32] [INFO ] Invariant cache hit.
[2024-05-29 14:25:32] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1187 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1187 unsolved
[2024-05-29 14:25:54] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 1 ms to minimize.
[2024-05-29 14:25:54] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 1 ms to minimize.
[2024-05-29 14:25:54] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 1 ms to minimize.
[2024-05-29 14:25:54] [INFO ] Deduced a trap composed of 13 places in 251 ms of which 0 ms to minimize.
[2024-05-29 14:25:54] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 1 ms to minimize.
[2024-05-29 14:25:55] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 1 ms to minimize.
[2024-05-29 14:25:55] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 1 ms to minimize.
[2024-05-29 14:25:55] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 1 ms to minimize.
[2024-05-29 14:25:55] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 0 ms to minimize.
[2024-05-29 14:25:56] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 1 ms to minimize.
[2024-05-29 14:25:56] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 1 ms to minimize.
[2024-05-29 14:25:56] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 0 ms to minimize.
[2024-05-29 14:25:56] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 1 ms to minimize.
[2024-05-29 14:25:56] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 1 ms to minimize.
[2024-05-29 14:25:57] [INFO ] Deduced a trap composed of 13 places in 254 ms of which 0 ms to minimize.
[2024-05-29 14:25:57] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 1 ms to minimize.
[2024-05-29 14:25:57] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 1 ms to minimize.
[2024-05-29 14:25:57] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 0 ms to minimize.
[2024-05-29 14:25:58] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 1 ms to minimize.
[2024-05-29 14:25:58] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1187 unsolved
[2024-05-29 14:25:58] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2024-05-29 14:25:58] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:25:58] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2024-05-29 14:25:59] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2024-05-29 14:25:59] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2024-05-29 14:25:59] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-29 14:25:59] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-29 14:25:59] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2024-05-29 14:25:59] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-29 14:25:59] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:25:59] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-29 14:25:59] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:26:00] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 1 ms to minimize.
[2024-05-29 14:26:00] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:26:00] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 1 ms to minimize.
[2024-05-29 14:26:00] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2024-05-29 14:26:00] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:26:00] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:26:00] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 1 ms to minimize.
[2024-05-29 14:26:00] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1187 unsolved
[2024-05-29 14:26:03] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-05-29 14:26:04] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2024-05-29 14:26:04] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-29 14:26:04] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:26:04] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:26:04] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 1 ms to minimize.
[2024-05-29 14:26:04] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 0 ms to minimize.
[2024-05-29 14:26:04] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:26:05] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2024-05-29 14:26:05] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 1 ms to minimize.
[2024-05-29 14:26:05] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 0 ms to minimize.
[2024-05-29 14:26:05] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 0 ms to minimize.
[2024-05-29 14:26:05] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-29 14:26:05] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-29 14:26:05] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-29 14:26:06] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 1 ms to minimize.
[2024-05-29 14:26:06] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:26:06] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2024-05-29 14:26:06] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 0 ms to minimize.
[2024-05-29 14:26:06] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1187 unsolved
[2024-05-29 14:26:07] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:26:07] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 0 ms to minimize.
[2024-05-29 14:26:07] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:26:07] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-29 14:26:07] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2024-05-29 14:26:08] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-29 14:26:08] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 0 ms to minimize.
[2024-05-29 14:26:08] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 0 ms to minimize.
[2024-05-29 14:26:08] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:26:08] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-29 14:26:08] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2024-05-29 14:26:08] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-29 14:26:08] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 14:26:08] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2024-05-29 14:26:08] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-29 14:26:09] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 14:26:09] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:26:09] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2024-05-29 14:26:09] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 0 ms to minimize.
[2024-05-29 14:26:09] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1187 unsolved
[2024-05-29 14:26:09] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2024-05-29 14:26:10] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-29 14:26:10] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:26:10] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 14:26:10] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 14:26:10] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:26:10] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:26:10] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-29 14:26:10] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 14:26:10] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 14:26:10] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 0 ms to minimize.
[2024-05-29 14:26:11] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 0 ms to minimize.
[2024-05-29 14:26:11] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2024-05-29 14:26:11] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:26:11] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 0 ms to minimize.
[2024-05-29 14:26:11] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:26:11] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-29 14:26:11] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2024-05-29 14:26:12] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2024-05-29 14:26:12] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1187 unsolved
[2024-05-29 14:26:15] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-29 14:26:15] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 118/1296 variables, and 103 constraints, problems are : Problem set: 0 solved, 1187 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/118 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1187/155 constraints, Known Traps: 102/102 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1187 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 102/103 constraints. Problems are: Problem set: 0 solved, 1187 unsolved
[2024-05-29 14:26:22] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-29 14:26:22] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-29 14:26:23] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 14:26:23] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:26:23] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 14:26:23] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:26:24] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-05-29 14:26:24] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 14:26:24] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 14:26:24] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:26:24] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 11/114 constraints. Problems are: Problem set: 0 solved, 1187 unsolved
[2024-05-29 14:26:33] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 14:26:33] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1187 unsolved
[2024-05-29 14:26:42] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:26:43] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 118/1296 variables, and 118 constraints, problems are : Problem set: 0 solved, 1187 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/118 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/155 constraints, Known Traps: 117/117 constraints]
After SMT, in 75350ms problems are : Problem set: 0 solved, 1187 unsolved
Search for dead transitions found 0 dead transitions in 75364ms
Starting structural reductions in LTL mode, iteration 1 : 118/264 places, 1188/1377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76299 ms. Remains : 118/264 places, 1188/1377 transitions.
[2024-05-29 14:26:48] [INFO ] Flatten gal took : 50 ms
[2024-05-29 14:26:48] [INFO ] Flatten gal took : 61 ms
[2024-05-29 14:26:48] [INFO ] Input system was already deterministic with 1188 transitions.
[2024-05-29 14:26:48] [INFO ] Flatten gal took : 53 ms
[2024-05-29 14:26:48] [INFO ] Flatten gal took : 53 ms
[2024-05-29 14:26:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality2051214581024195872.gal : 11 ms
[2024-05-29 14:26:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality6839073302338859296.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/CTLCardinality2051214581024195872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6839073302338859296.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,5.38364e+07,10.8861,250164,2,9527,5,182843,6,0,1650,113145,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 14:27:18] [INFO ] Flatten gal took : 54 ms
[2024-05-29 14:27:18] [INFO ] Applying decomposition
[2024-05-29 14:27:18] [INFO ] Flatten gal took : 53 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/graph201074742246337371.txt' '-o' '/tmp/graph201074742246337371.bin' '-w' '/tmp/graph201074742246337371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph201074742246337371.bin' '-l' '-1' '-v' '-w' '/tmp/graph201074742246337371.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:27:18] [INFO ] Decomposing Gal with order
[2024-05-29 14:27:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:27:19] [INFO ] Removed a total of 9274 redundant transitions.
[2024-05-29 14:27:19] [INFO ] Flatten gal took : 120 ms
[2024-05-29 14:27:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 36 ms.
[2024-05-29 14:27:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality4470374971715080190.gal : 7 ms
[2024-05-29 14:27:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality5453477940988189711.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/CTLCardinality4470374971715080190.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5453477940988189711.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,5.38364e+07,5.27839,197644,5124,27,172837,318,1427,1.66843e+06,50,1240,0


Converting to forward existential form...Done !
original formula: EX(EG(((i7.i1.u28.p203==0)||(i1.u6.p46==1))))
=> equivalent forward existential formula: [FwdG(EY(Init),((i7.i1.u28.p203==0)||(i1.u6.p46==1)))] != FALSE
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 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 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 1377/1377 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 263 transition count 1216
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 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 197 rules applied. Total rules applied 357 place count 103 transition count 1179
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 367 place count 98 transition count 1174
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 370 place count 97 transition count 1172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 371 place count 96 transition count 1172
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 371 place count 96 transition count 1155
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 405 place count 79 transition count 1155
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 417 place count 67 transition count 1135
Iterating global reduction 5 with 12 rules applied. Total rules applied 429 place count 67 transition count 1135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 432 place count 67 transition count 1132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 432 place count 67 transition count 1131
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 434 place count 66 transition count 1131
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 440 place count 60 transition count 1119
Iterating global reduction 6 with 6 rules applied. Total rules applied 446 place count 60 transition count 1119
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Iterating post reduction 6 with 252 rules applied. Total rules applied 698 place count 60 transition count 867
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 718 place count 50 transition count 857
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 728 place count 50 transition count 847
Drop transitions (Redundant composition of simpler transitions.) removed 762 transitions
Redundant transition composition rules discarded 762 transitions
Iterating global reduction 8 with 762 rules applied. Total rules applied 1490 place count 50 transition count 85
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1508 place count 41 transition count 76
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1510 place count 41 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1511 place count 41 transition count 75
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1519 place count 33 transition count 67
Applied a total of 1519 rules in 111 ms. Remains 33 /264 variables (removed 231) and now considering 67/1377 (removed 1310) transitions.
[2024-05-29 14:27:49] [INFO ] Flow matrix only has 58 transitions (discarded 9 similar events)
// Phase 1: matrix 58 rows 33 cols
[2024-05-29 14:27:49] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 14:27:49] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 14:27:49] [INFO ] Flow matrix only has 58 transitions (discarded 9 similar events)
[2024-05-29 14:27:49] [INFO ] Invariant cache hit.
[2024-05-29 14:27:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 14:27:49] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-29 14:27:49] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-29 14:27:49] [INFO ] Flow matrix only has 58 transitions (discarded 9 similar events)
[2024-05-29 14:27:49] [INFO ] Invariant cache hit.
[2024-05-29 14:27:49] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-29 14:27:49] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:27:49] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:27:49] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 14:27:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:27:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:27:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:27:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:27:49] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:27:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 14:27:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:27:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 14:27:49] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 14:27:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 14:27:49] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 14:27:51] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-29 14:27:52] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:27:52] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/33 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (OVERLAPS) 57/90 variables, 33/112 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 9/121 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/90 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 14 (OVERLAPS) 1/91 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/91 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 16 (OVERLAPS) 0/91 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 122 constraints, problems are : Problem set: 0 solved, 66 unsolved in 3666 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-29 14:27:53] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:27:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:27:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 14:27:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 57/90 variables, 33/116 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 66/191 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 1/91 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (OVERLAPS) 0/91 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 192 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2620 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 82/82 constraints]
After SMT, in 6319ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 6320ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/264 places, 67/1377 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6524 ms. Remains : 33/264 places, 67/1377 transitions.
[2024-05-29 14:27:55] [INFO ] Flatten gal took : 6 ms
[2024-05-29 14:27:55] [INFO ] Flatten gal took : 4 ms
[2024-05-29 14:27:55] [INFO ] Input system was already deterministic with 67 transitions.
[2024-05-29 14:27:55] [INFO ] Flatten gal took : 2 ms
[2024-05-29 14:27:55] [INFO ] Flatten gal took : 2 ms
[2024-05-29 14:27:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality4689725399306906875.gal : 1 ms
[2024-05-29 14:27:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality16311965719397369053.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/CTLCardinality4689725399306906875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16311965719397369053.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,1045,0.023703,4284,2,213,5,1829,6,0,189,1147,0


Converting to forward existential form...Done !
original formula: EF((AF(AG((p135==1))) + EG(((p212==0)&&(p38==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !((p135==1))))))))] != FALSE + [FwdG(FwdU(Init,TRUE),((p212==0)&&(p38==1)...168
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t15, t16, t17, t18, t19, t20, t22...285
Hit Full ! (commute/partial/dont) 63/4/4
(forward)formula 0,1,0.077659,5396,1,0,126,7506,157,48,2319,6470,148
FORMULA StigmergyCommit-PT-08a-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-29 14:27:55] [INFO ] Flatten gal took : 58 ms
[2024-05-29 14:27:55] [INFO ] Flatten gal took : 57 ms
[2024-05-29 14:27:56] [INFO ] Applying decomposition
[2024-05-29 14:27:56] [INFO ] Flatten gal took : 58 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/graph13705319330578159033.txt' '-o' '/tmp/graph13705319330578159033.bin' '-w' '/tmp/graph13705319330578159033.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13705319330578159033.bin' '-l' '-1' '-v' '-w' '/tmp/graph13705319330578159033.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:27:56] [INFO ] Decomposing Gal with order
[2024-05-29 14:27:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:27:56] [INFO ] Removed a total of 9331 redundant transitions.
[2024-05-29 14:27:56] [INFO ] Flatten gal took : 121 ms
[2024-05-29 14:27:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 42 ms.
[2024-05-29 14:27:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality11728750535636101474.gal : 7 ms
[2024-05-29 14:27:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality318643182225527057.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/CTLCardinality11728750535636101474.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality318643182225527057.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 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,5.40986e+07,7.31803,241356,7361,34,174493,363,1411,2.19585e+06,81,1159,0


Converting to forward existential form...Done !
original formula: (EG((i17.u79.p281==0)) + A(AX(((i12.u57.p195==0)||(u90.p293==1))) U (i17.u82.p274!=0)))
=> equivalent forward existential formula: ([FwdG(Init,(i17.u79.p281==0))] != FALSE + [((Init * !(EG(!((i17.u82.p274!=0))))) * !(E(!((i17.u82.p274!=0)) U (...240
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 a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
(forward)formula 0,1,77.4626,676728,1,0,607690,473,14384,6.13235e+06,300,1885,2043152
FORMULA StigmergyCommit-PT-08a-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EG((i13.u67.p228==0)) + !(E(AX(((u53.p182==0)||(i1.u7.p24==1))) U (i13.u72.p242==0))))
=> equivalent forward existential formula: [(FwdU((Init * !(EG((i13.u67.p228==0)))),!(EX(!(((u53.p182==0)||(i1.u7.p24==1)))))) * (i13.u72.p242==0))] = FALS...156
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t7, t9, t12, t15, t20, t25, t27, t31, t35, t40, t42, t51, t56, t58, t64, t67, t81, t1...677
(forward)formula 1,1,96.1561,1060556,1,0,794261,493,21063,6.51174e+06,424,2001,9182718
FORMULA StigmergyCommit-PT-08a-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(!(((EF(!(((i1.u9.p28==0)||(i1.u9.p8==1)))) * !((EX((i12.u55.p209==1)) + (AX((i1.u11.p34==1)) * EX(((i14.u66.p221==0)||(i6.u26.p77==1)))...334
=> equivalent forward existential formula: [((FwdU(Init,!(((E(TRUE U !(((i1.u9.p28==0)||(i1.u9.p8==1)))) * !((EX((i12.u55.p209==1)) + (!(EX(!((i1.u11.p34==...674
(forward)formula 2,1,138.128,1987952,1,0,1.23026e+06,616,21715,1.66583e+07,465,2161,11990062
FORMULA StigmergyCommit-PT-08a-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E((AX((!(((i7.u24.p72==1)&&((u54.p185==0)||(i21.u31.p102==1)))) + A((i4.u38.p134==1) U (i10.i1.i1.u48.p167==1)))) * (AG((i7.u76.p252==0))...351
=> equivalent forward existential formula: [(EY(FwdU(FwdU(Init,(!(EX(!((!(((i7.u24.p72==1)&&((u54.p185==0)||(i21.u31.p102==1)))) + !((E(!((i10.i1.i1.u48.p1...515
(forward)formula 3,0,153.089,2083520,1,0,1.50674e+06,657,21827,1.6819e+07,468,2223,12493651
FORMULA StigmergyCommit-PT-08a-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(A(AG(EX(AX(((i22.u95.p305==0)||(i6.u26.p77==1))))) U AG(!(EG(((i5.u32.p106==0)||(i5.u30.p100==1)))))))
=> equivalent forward existential formula: ([FwdG(FwdU((FwdU(Init,!(!(E(TRUE U !(!(EG(((i5.u32.p106==0)||(i5.u30.p100==1))))))))) * !(!(E(TRUE U !(EX(!(EX(...344
(forward)formula 4,1,280.097,2201528,1,0,1.82303e+06,671,10008,1.70509e+07,279,2245,2909108
FORMULA StigmergyCommit-PT-08a-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(EG(((i12.u60.p203==0)||(i10.i0.i0.u14.p46==1))))
=> equivalent forward existential formula: [FwdG(EY(Init),((i12.u60.p203==0)||(i10.i0.i0.u14.p46==1)))] != FALSE
(forward)formula 5,1,328.792,2201528,1,0,1.82303e+06,671,10082,1.70509e+07,280,2245,3375609
FORMULA StigmergyCommit-PT-08a-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1573604 ms.

BK_STOP 1716993206155

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-08a"
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-08a, 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-171690531800185"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-08a.tgz
mv StigmergyCommit-PT-08a 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 ;