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-171690532000305.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 StigmergyElection-PT-05b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532000305
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 852K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 18:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 428K 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 StigmergyElection-PT-05b-CTLCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-05b-CTLCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-05b-CTLCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-05b-CTLCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-05b-CTLCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-05b-CTLCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-05b-CTLCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-05b-CTLCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-05b-CTLCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-05b-CTLCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-05b-CTLCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-05b-CTLCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-05b-CTLCardinality-2023-12
FORMULA_NAME StigmergyElection-PT-05b-CTLCardinality-2023-13
FORMULA_NAME StigmergyElection-PT-05b-CTLCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-05b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717007669169

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 18:34:30] [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 18:34:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:34:30] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-05-29 18:34:30] [INFO ] Transformed 699 places.
[2024-05-29 18:34:30] [INFO ] Transformed 1266 transitions.
[2024-05-29 18:34:30] [INFO ] Found NUPN structural information;
[2024-05-29 18:34:30] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 252 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Support contains 105 out of 699 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 629 transition count 1196
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 629 transition count 1196
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 167 place count 602 transition count 1169
Iterating global reduction 0 with 27 rules applied. Total rules applied 194 place count 602 transition count 1169
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 199 place count 597 transition count 1164
Iterating global reduction 0 with 5 rules applied. Total rules applied 204 place count 597 transition count 1164
Applied a total of 204 rules in 150 ms. Remains 597 /699 variables (removed 102) and now considering 1164/1266 (removed 102) transitions.
// Phase 1: matrix 1164 rows 597 cols
[2024-05-29 18:34:30] [INFO ] Computed 6 invariants in 34 ms
[2024-05-29 18:34:31] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-29 18:34:31] [INFO ] Invariant cache hit.
[2024-05-29 18:34:31] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
Running 1163 sub problems to find dead transitions.
[2024-05-29 18:34:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1163 unsolved
At refinement iteration 1 (OVERLAPS) 1/597 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1163 unsolved
[2024-05-29 18:34:55] [INFO ] Deduced a trap composed of 174 places in 453 ms of which 40 ms to minimize.
[2024-05-29 18:34:55] [INFO ] Deduced a trap composed of 173 places in 389 ms of which 4 ms to minimize.
[2024-05-29 18:34:55] [INFO ] Deduced a trap composed of 172 places in 274 ms of which 4 ms to minimize.
[2024-05-29 18:34:56] [INFO ] Deduced a trap composed of 172 places in 256 ms of which 3 ms to minimize.
[2024-05-29 18:34:56] [INFO ] Deduced a trap composed of 177 places in 237 ms of which 3 ms to minimize.
[2024-05-29 18:34:56] [INFO ] Deduced a trap composed of 172 places in 233 ms of which 3 ms to minimize.
[2024-05-29 18:34:57] [INFO ] Deduced a trap composed of 168 places in 304 ms of which 3 ms to minimize.
[2024-05-29 18:34:57] [INFO ] Deduced a trap composed of 173 places in 303 ms of which 4 ms to minimize.
[2024-05-29 18:34:57] [INFO ] Deduced a trap composed of 172 places in 302 ms of which 4 ms to minimize.
[2024-05-29 18:34:57] [INFO ] Deduced a trap composed of 230 places in 292 ms of which 3 ms to minimize.
[2024-05-29 18:34:58] [INFO ] Deduced a trap composed of 228 places in 300 ms of which 3 ms to minimize.
[2024-05-29 18:34:58] [INFO ] Deduced a trap composed of 173 places in 273 ms of which 3 ms to minimize.
[2024-05-29 18:34:58] [INFO ] Deduced a trap composed of 170 places in 293 ms of which 3 ms to minimize.
[2024-05-29 18:34:59] [INFO ] Deduced a trap composed of 172 places in 307 ms of which 4 ms to minimize.
[2024-05-29 18:34:59] [INFO ] Deduced a trap composed of 173 places in 275 ms of which 4 ms to minimize.
[2024-05-29 18:34:59] [INFO ] Deduced a trap composed of 175 places in 251 ms of which 3 ms to minimize.
[2024-05-29 18:35:00] [INFO ] Deduced a trap composed of 173 places in 227 ms of which 3 ms to minimize.
[2024-05-29 18:35:00] [INFO ] Deduced a trap composed of 178 places in 243 ms of which 3 ms to minimize.
[2024-05-29 18:35:00] [INFO ] Deduced a trap composed of 172 places in 227 ms of which 3 ms to minimize.
[2024-05-29 18:35:00] [INFO ] Deduced a trap composed of 171 places in 232 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1163 unsolved
[2024-05-29 18:35:01] [INFO ] Deduced a trap composed of 169 places in 259 ms of which 4 ms to minimize.
[2024-05-29 18:35:02] [INFO ] Deduced a trap composed of 166 places in 271 ms of which 3 ms to minimize.
[2024-05-29 18:35:02] [INFO ] Deduced a trap composed of 168 places in 225 ms of which 2 ms to minimize.
[2024-05-29 18:35:04] [INFO ] Deduced a trap composed of 225 places in 258 ms of which 3 ms to minimize.
[2024-05-29 18:35:04] [INFO ] Deduced a trap composed of 174 places in 291 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 597/1761 variables, and 31 constraints, problems are : Problem set: 0 solved, 1163 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/597 constraints, PredecessorRefiner: 1163/1163 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1163 unsolved
At refinement iteration 1 (OVERLAPS) 1/597 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1163 unsolved
[2024-05-29 18:35:15] [INFO ] Deduced a trap composed of 173 places in 227 ms of which 2 ms to minimize.
[2024-05-29 18:35:16] [INFO ] Deduced a trap composed of 168 places in 245 ms of which 3 ms to minimize.
[2024-05-29 18:35:17] [INFO ] Deduced a trap composed of 173 places in 245 ms of which 3 ms to minimize.
[2024-05-29 18:35:18] [INFO ] Deduced a trap composed of 169 places in 244 ms of which 3 ms to minimize.
[2024-05-29 18:35:19] [INFO ] Deduced a trap composed of 176 places in 229 ms of which 3 ms to minimize.
[2024-05-29 18:35:19] [INFO ] Deduced a trap composed of 172 places in 218 ms of which 3 ms to minimize.
[2024-05-29 18:35:21] [INFO ] Deduced a trap composed of 170 places in 225 ms of which 2 ms to minimize.
[2024-05-29 18:35:23] [INFO ] Deduced a trap composed of 179 places in 222 ms of which 3 ms to minimize.
[2024-05-29 18:35:26] [INFO ] Deduced a trap composed of 169 places in 218 ms of which 3 ms to minimize.
[2024-05-29 18:35:26] [INFO ] Deduced a trap composed of 172 places in 246 ms of which 3 ms to minimize.
[2024-05-29 18:35:27] [INFO ] Deduced a trap composed of 180 places in 280 ms of which 3 ms to minimize.
[2024-05-29 18:35:27] [INFO ] Deduced a trap composed of 177 places in 253 ms of which 2 ms to minimize.
[2024-05-29 18:35:27] [INFO ] Deduced a trap composed of 178 places in 250 ms of which 3 ms to minimize.
[2024-05-29 18:35:28] [INFO ] Deduced a trap composed of 174 places in 246 ms of which 2 ms to minimize.
[2024-05-29 18:35:28] [INFO ] Deduced a trap composed of 233 places in 247 ms of which 3 ms to minimize.
[2024-05-29 18:35:28] [INFO ] Deduced a trap composed of 181 places in 255 ms of which 3 ms to minimize.
[2024-05-29 18:35:28] [INFO ] Deduced a trap composed of 171 places in 233 ms of which 2 ms to minimize.
[2024-05-29 18:35:29] [INFO ] Deduced a trap composed of 173 places in 245 ms of which 3 ms to minimize.
[2024-05-29 18:35:29] [INFO ] Deduced a trap composed of 231 places in 259 ms of which 2 ms to minimize.
[2024-05-29 18:35:29] [INFO ] Deduced a trap composed of 175 places in 240 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/597 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 1163 unsolved
[2024-05-29 18:35:32] [INFO ] Deduced a trap composed of 175 places in 258 ms of which 3 ms to minimize.
[2024-05-29 18:35:33] [INFO ] Deduced a trap composed of 173 places in 254 ms of which 3 ms to minimize.
[2024-05-29 18:35:33] [INFO ] Deduced a trap composed of 179 places in 229 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 597/1761 variables, and 54 constraints, problems are : Problem set: 0 solved, 1163 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/597 constraints, PredecessorRefiner: 0/1163 constraints, Known Traps: 48/48 constraints]
After SMT, in 62566ms problems are : Problem set: 0 solved, 1163 unsolved
Search for dead transitions found 0 dead transitions in 62607ms
Starting structural reductions in LTL mode, iteration 1 : 597/699 places, 1164/1266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63827 ms. Remains : 597/699 places, 1164/1266 transitions.
Support contains 105 out of 597 places after structural reductions.
[2024-05-29 18:35:34] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-29 18:35:34] [INFO ] Flatten gal took : 132 ms
FORMULA StigmergyElection-PT-05b-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 18:35:34] [INFO ] Flatten gal took : 81 ms
[2024-05-29 18:35:35] [INFO ] Input system was already deterministic with 1164 transitions.
Support contains 98 out of 597 places (down from 105) after GAL structural reductions.
RANDOM walk for 40000 steps (448 resets) in 1852 ms. (21 steps per ms) remains 32/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
[2024-05-29 18:35:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 525/582 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/582 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 15/597 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 1164/1761 variables, 597/603 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1761 variables, 0/603 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/1761 variables, 0/603 constraints. Problems are: Problem set: 1 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1761/1761 variables, and 603 constraints, problems are : Problem set: 1 solved, 31 unsolved in 2357 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 597/597 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 527/582 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 31 unsolved
[2024-05-29 18:35:38] [INFO ] Deduced a trap composed of 232 places in 305 ms of which 4 ms to minimize.
[2024-05-29 18:35:39] [INFO ] Deduced a trap composed of 174 places in 300 ms of which 3 ms to minimize.
[2024-05-29 18:35:39] [INFO ] Deduced a trap composed of 172 places in 281 ms of which 3 ms to minimize.
[2024-05-29 18:35:39] [INFO ] Deduced a trap composed of 170 places in 276 ms of which 3 ms to minimize.
[2024-05-29 18:35:40] [INFO ] Deduced a trap composed of 176 places in 301 ms of which 4 ms to minimize.
[2024-05-29 18:35:40] [INFO ] Deduced a trap composed of 172 places in 273 ms of which 3 ms to minimize.
[2024-05-29 18:35:40] [INFO ] Deduced a trap composed of 174 places in 280 ms of which 3 ms to minimize.
[2024-05-29 18:35:40] [INFO ] Deduced a trap composed of 175 places in 263 ms of which 3 ms to minimize.
[2024-05-29 18:35:41] [INFO ] Deduced a trap composed of 175 places in 239 ms of which 9 ms to minimize.
[2024-05-29 18:35:41] [INFO ] Deduced a trap composed of 174 places in 274 ms of which 3 ms to minimize.
[2024-05-29 18:35:41] [INFO ] Deduced a trap composed of 177 places in 284 ms of which 3 ms to minimize.
[2024-05-29 18:35:42] [INFO ] Deduced a trap composed of 172 places in 268 ms of which 3 ms to minimize.
[2024-05-29 18:35:42] [INFO ] Deduced a trap composed of 179 places in 273 ms of which 3 ms to minimize.
[2024-05-29 18:35:42] [INFO ] Deduced a trap composed of 170 places in 253 ms of which 3 ms to minimize.
[2024-05-29 18:35:42] [INFO ] Deduced a trap composed of 168 places in 240 ms of which 3 ms to minimize.
[2024-05-29 18:35:43] [INFO ] Deduced a trap composed of 173 places in 251 ms of which 3 ms to minimize.
[2024-05-29 18:35:43] [INFO ] Deduced a trap composed of 178 places in 266 ms of which 3 ms to minimize.
SMT process timed out in 7582ms, After SMT, problems are : Problem set: 1 solved, 31 unsolved
Fused 31 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 55 out of 597 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 597/597 places, 1164/1164 transitions.
Graph (trivial) has 505 edges and 597 vertex of which 41 / 597 are part of one of the 8 SCC in 10 ms
Free SCC test removed 33 places
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Graph (complete) has 1141 edges and 564 vertex of which 561 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.11 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 310 transitions
Trivial Post-agglo rules discarded 310 transitions
Performed 310 trivial Post agglomeration. Transition count delta: 310
Iterating post reduction 0 with 313 rules applied. Total rules applied 315 place count 561 transition count 808
Reduce places removed 310 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 330 rules applied. Total rules applied 645 place count 251 transition count 788
Reduce places removed 12 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 2 with 28 rules applied. Total rules applied 673 place count 239 transition count 772
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 18 rules applied. Total rules applied 691 place count 223 transition count 770
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 692 place count 222 transition count 770
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 692 place count 222 transition count 749
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 734 place count 201 transition count 749
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 737 place count 198 transition count 746
Iterating global reduction 5 with 3 rules applied. Total rules applied 740 place count 198 transition count 746
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 782 place count 177 transition count 725
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 783 place count 177 transition count 724
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 791 place count 169 transition count 348
Iterating global reduction 6 with 8 rules applied. Total rules applied 799 place count 169 transition count 348
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 803 place count 169 transition count 344
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 813 place count 164 transition count 339
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -8
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 831 place count 155 transition count 347
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 833 place count 155 transition count 345
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 842 place count 155 transition count 336
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 844 place count 154 transition count 342
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 852 place count 154 transition count 334
Free-agglomeration rule applied 30 times.
Iterating global reduction 8 with 30 rules applied. Total rules applied 882 place count 154 transition count 304
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 8 with 30 rules applied. Total rules applied 912 place count 124 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 931 place count 124 transition count 285
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 932 place count 124 transition count 285
Applied a total of 932 rules in 360 ms. Remains 124 /597 variables (removed 473) and now considering 285/1164 (removed 879) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 360 ms. Remains : 124/597 places, 285/1164 transitions.
RANDOM walk for 40000 steps (1916 resets) in 873 ms. (45 steps per ms) remains 6/31 properties
BEST_FIRST walk for 40004 steps (486 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (465 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (466 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (360 resets) in 126 ms. (314 steps per ms) remains 3/6 properties
// Phase 1: matrix 285 rows 124 cols
[2024-05-29 18:35:44] [INFO ] Computed 6 invariants in 2 ms
[2024-05-29 18:35:44] [INFO ] State equation strengthened by 126 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 103/109 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/124 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 285/409 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 126/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/409 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 256 constraints, problems are : Problem set: 0 solved, 3 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 103/109 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 18:35:44] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 1 ms to minimize.
[2024-05-29 18:35:44] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 15/124 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 18:35:44] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2024-05-29 18:35:44] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:35:44] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 0 ms to minimize.
[2024-05-29 18:35:44] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:35:45] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 285/409 variables, 124/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 126/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/409 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 266 constraints, problems are : Problem set: 0 solved, 3 unsolved in 702 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints]
After SMT, in 881ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 146 ms.
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 285/285 transitions.
Graph (trivial) has 108 edges and 124 vertex of which 20 / 124 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 326 edges and 114 vertex of which 112 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 112 transition count 227
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 76 transition count 215
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 98 place count 70 transition count 211
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 100 place count 68 transition count 211
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 100 place count 68 transition count 207
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 108 place count 64 transition count 207
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 123 place count 49 transition count 169
Iterating global reduction 4 with 15 rules applied. Total rules applied 138 place count 49 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 139 place count 49 transition count 168
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 145 place count 43 transition count 162
Iterating global reduction 5 with 6 rules applied. Total rules applied 151 place count 43 transition count 162
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 163 place count 37 transition count 156
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 169 place count 37 transition count 150
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 179 place count 27 transition count 125
Iterating global reduction 6 with 10 rules applied. Total rules applied 189 place count 27 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 190 place count 27 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 198 place count 27 transition count 116
Free-agglomeration rule applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 205 place count 27 transition count 109
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 224 place count 20 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 239 place count 20 transition count 82
Applied a total of 239 rules in 39 ms. Remains 20 /124 variables (removed 104) and now considering 82/285 (removed 203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 20/124 places, 82/285 transitions.
RANDOM walk for 1831 steps (128 resets) in 10 ms. (166 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-05-29 18:35:45] [INFO ] Flatten gal took : 58 ms
[2024-05-29 18:35:45] [INFO ] Flatten gal took : 59 ms
[2024-05-29 18:35:45] [INFO ] Input system was already deterministic with 1164 transitions.
Computed a total of 80 stabilizing places and 85 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 597/597 places, 1164/1164 transitions.
Graph (trivial) has 605 edges and 597 vertex of which 91 / 597 are part of one of the 15 SCC in 1 ms
Free SCC test removed 76 places
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 363 transitions
Trivial Post-agglo rules discarded 363 transitions
Performed 363 trivial Post agglomeration. Transition count delta: 363
Iterating post reduction 0 with 363 rules applied. Total rules applied 364 place count 520 transition count 714
Reduce places removed 363 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 373 rules applied. Total rules applied 737 place count 157 transition count 704
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 743 place count 152 transition count 703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 744 place count 151 transition count 703
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 744 place count 151 transition count 687
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 776 place count 135 transition count 687
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 792 place count 119 transition count 668
Iterating global reduction 4 with 16 rules applied. Total rules applied 808 place count 119 transition count 668
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 4 with 2 rules applied. Total rules applied 810 place count 119 transition count 666
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 812 place count 117 transition count 666
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 812 place count 117 transition count 664
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 816 place count 115 transition count 664
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 821 place count 110 transition count 577
Iterating global reduction 6 with 5 rules applied. Total rules applied 826 place count 110 transition count 577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 827 place count 110 transition count 576
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 829 place count 108 transition count 572
Iterating global reduction 7 with 2 rules applied. Total rules applied 831 place count 108 transition count 572
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 861 place count 93 transition count 557
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 877 place count 77 transition count 206
Iterating global reduction 7 with 16 rules applied. Total rules applied 893 place count 77 transition count 206
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 901 place count 77 transition count 198
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 904 place count 74 transition count 192
Iterating global reduction 8 with 3 rules applied. Total rules applied 907 place count 74 transition count 192
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 909 place count 72 transition count 188
Iterating global reduction 8 with 2 rules applied. Total rules applied 911 place count 72 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 913 place count 71 transition count 187
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 914 place count 70 transition count 182
Iterating global reduction 8 with 1 rules applied. Total rules applied 915 place count 70 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 920 place count 70 transition count 177
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 930 place count 65 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 931 place count 64 transition count 171
Applied a total of 931 rules in 90 ms. Remains 64 /597 variables (removed 533) and now considering 171/1164 (removed 993) transitions.
[2024-05-29 18:35:45] [INFO ] Flow matrix only has 165 transitions (discarded 6 similar events)
// Phase 1: matrix 165 rows 64 cols
[2024-05-29 18:35:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:35:45] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-29 18:35:45] [INFO ] Flow matrix only has 165 transitions (discarded 6 similar events)
[2024-05-29 18:35:45] [INFO ] Invariant cache hit.
[2024-05-29 18:35:45] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 18:35:45] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-29 18:35:45] [INFO ] Redundant transitions in 5 ms returned []
Running 160 sub problems to find dead transitions.
[2024-05-29 18:35:45] [INFO ] Flow matrix only has 165 transitions (discarded 6 similar events)
[2024-05-29 18:35:45] [INFO ] Invariant cache hit.
[2024-05-29 18:35:45] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 5/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-29 18:35:46] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-05-29 18:35:46] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:35:46] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2024-05-29 18:35:46] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:35:46] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:35:46] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-29 18:35:46] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 3 ms to minimize.
[2024-05-29 18:35:47] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:35:47] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:35:47] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:35:47] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:35:47] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:35:47] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:35:47] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-29 18:35:47] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-05-29 18:35:47] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:35:47] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:35:47] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:35:47] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:35:47] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-29 18:35:47] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:35:48] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:35:48] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:35:48] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2024-05-29 18:35:48] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:35:48] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:35:48] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:35:48] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 164/228 variables, 64/94 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 30/124 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-29 18:35:49] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (OVERLAPS) 1/229 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 12 (OVERLAPS) 0/229 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 126 constraints, problems are : Problem set: 0 solved, 160 unsolved in 7232 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 5/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (OVERLAPS) 164/228 variables, 64/95 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 30/125 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 160/285 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-29 18:35:55] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:35:55] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2024-05-29 18:35:56] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 3/288 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (OVERLAPS) 1/229 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-29 18:35:59] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:35:59] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:35:59] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 13 (OVERLAPS) 0/229 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 292 constraints, problems are : Problem set: 0 solved, 160 unsolved in 12124 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 35/35 constraints]
After SMT, in 19482ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 19483ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/597 places, 171/1164 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19752 ms. Remains : 64/597 places, 171/1164 transitions.
[2024-05-29 18:36:05] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:36:05] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:36:05] [INFO ] Input system was already deterministic with 171 transitions.
[2024-05-29 18:36:05] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:36:05] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:36:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality12761135528542551583.gal : 8 ms
[2024-05-29 18:36:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality316982662487622831.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/CTLCardinality12761135528542551583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality316982662487622831.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,529416,0.41771,20760,2,5531,5,51455,6,0,417,45289,0


Converting to forward existential form...Done !
original formula: AG(EF((((p407==0)||(p594==1))||(p683==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((p407==0)||(p594==1))||(p683==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t7, t8, t13, t14, t15, t16, t18, t19, t24, t26, t27, t48, t49, t51, t52, t78, t82, t1...319
(forward)formula 0,1,3.46632,103748,1,0,314,443873,356,152,5568,263602,345
FORMULA StigmergyElection-PT-05b-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 1164/1164 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 571 transition count 1138
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 571 transition count 1138
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 63 place count 560 transition count 1127
Iterating global reduction 0 with 11 rules applied. Total rules applied 74 place count 560 transition count 1127
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 556 transition count 1123
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 556 transition count 1123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 555 transition count 1122
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 555 transition count 1122
Applied a total of 84 rules in 60 ms. Remains 555 /597 variables (removed 42) and now considering 1122/1164 (removed 42) transitions.
// Phase 1: matrix 1122 rows 555 cols
[2024-05-29 18:36:09] [INFO ] Computed 6 invariants in 16 ms
[2024-05-29 18:36:09] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-29 18:36:09] [INFO ] Invariant cache hit.
[2024-05-29 18:36:09] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
Running 1121 sub problems to find dead transitions.
[2024-05-29 18:36:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1121 unsolved
At refinement iteration 1 (OVERLAPS) 1/555 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1121 unsolved
[2024-05-29 18:36:32] [INFO ] Deduced a trap composed of 164 places in 306 ms of which 4 ms to minimize.
[2024-05-29 18:36:32] [INFO ] Deduced a trap composed of 164 places in 304 ms of which 3 ms to minimize.
[2024-05-29 18:36:32] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 3 ms to minimize.
[2024-05-29 18:36:32] [INFO ] Deduced a trap composed of 167 places in 230 ms of which 2 ms to minimize.
[2024-05-29 18:36:34] [INFO ] Deduced a trap composed of 167 places in 226 ms of which 3 ms to minimize.
[2024-05-29 18:36:34] [INFO ] Deduced a trap composed of 168 places in 256 ms of which 2 ms to minimize.
[2024-05-29 18:36:35] [INFO ] Deduced a trap composed of 165 places in 300 ms of which 3 ms to minimize.
[2024-05-29 18:36:35] [INFO ] Deduced a trap composed of 165 places in 268 ms of which 3 ms to minimize.
[2024-05-29 18:36:35] [INFO ] Deduced a trap composed of 164 places in 272 ms of which 3 ms to minimize.
[2024-05-29 18:36:36] [INFO ] Deduced a trap composed of 165 places in 224 ms of which 2 ms to minimize.
[2024-05-29 18:36:36] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 2 ms to minimize.
[2024-05-29 18:36:36] [INFO ] Deduced a trap composed of 166 places in 243 ms of which 3 ms to minimize.
[2024-05-29 18:36:37] [INFO ] Deduced a trap composed of 167 places in 242 ms of which 2 ms to minimize.
[2024-05-29 18:36:38] [INFO ] Deduced a trap composed of 166 places in 235 ms of which 3 ms to minimize.
[2024-05-29 18:36:38] [INFO ] Deduced a trap composed of 169 places in 210 ms of which 3 ms to minimize.
[2024-05-29 18:36:38] [INFO ] Deduced a trap composed of 167 places in 218 ms of which 3 ms to minimize.
[2024-05-29 18:36:39] [INFO ] Deduced a trap composed of 163 places in 259 ms of which 3 ms to minimize.
[2024-05-29 18:36:39] [INFO ] Deduced a trap composed of 166 places in 239 ms of which 2 ms to minimize.
[2024-05-29 18:36:39] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 2 ms to minimize.
[2024-05-29 18:36:40] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/555 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1121 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 Real declared 555/1677 variables, and 26 constraints, problems are : Problem set: 0 solved, 1121 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/555 constraints, PredecessorRefiner: 1121/1121 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1121 unsolved
At refinement iteration 1 (OVERLAPS) 1/555 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/555 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1121 unsolved
[2024-05-29 18:36:52] [INFO ] Deduced a trap composed of 164 places in 237 ms of which 3 ms to minimize.
[2024-05-29 18:36:53] [INFO ] Deduced a trap composed of 163 places in 218 ms of which 2 ms to minimize.
[2024-05-29 18:36:54] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 3 ms to minimize.
[2024-05-29 18:36:56] [INFO ] Deduced a trap composed of 167 places in 242 ms of which 3 ms to minimize.
[2024-05-29 18:36:57] [INFO ] Deduced a trap composed of 168 places in 230 ms of which 2 ms to minimize.
[2024-05-29 18:36:57] [INFO ] Deduced a trap composed of 166 places in 231 ms of which 3 ms to minimize.
[2024-05-29 18:36:58] [INFO ] Deduced a trap composed of 164 places in 242 ms of which 2 ms to minimize.
[2024-05-29 18:36:58] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 3 ms to minimize.
[2024-05-29 18:36:59] [INFO ] Deduced a trap composed of 168 places in 220 ms of which 2 ms to minimize.
[2024-05-29 18:37:00] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 3 ms to minimize.
[2024-05-29 18:37:01] [INFO ] Deduced a trap composed of 167 places in 235 ms of which 2 ms to minimize.
[2024-05-29 18:37:01] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 2 ms to minimize.
[2024-05-29 18:37:01] [INFO ] Deduced a trap composed of 166 places in 235 ms of which 2 ms to minimize.
[2024-05-29 18:37:03] [INFO ] Deduced a trap composed of 166 places in 237 ms of which 3 ms to minimize.
[2024-05-29 18:37:03] [INFO ] Deduced a trap composed of 165 places in 244 ms of which 2 ms to minimize.
[2024-05-29 18:37:03] [INFO ] Deduced a trap composed of 167 places in 286 ms of which 16 ms to minimize.
[2024-05-29 18:37:04] [INFO ] Deduced a trap composed of 166 places in 262 ms of which 3 ms to minimize.
[2024-05-29 18:37:04] [INFO ] Deduced a trap composed of 166 places in 306 ms of which 3 ms to minimize.
[2024-05-29 18:37:04] [INFO ] Deduced a trap composed of 165 places in 285 ms of which 3 ms to minimize.
[2024-05-29 18:37:05] [INFO ] Deduced a trap composed of 165 places in 236 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/555 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 1121 unsolved
[2024-05-29 18:37:05] [INFO ] Deduced a trap composed of 164 places in 248 ms of which 3 ms to minimize.
[2024-05-29 18:37:06] [INFO ] Deduced a trap composed of 167 places in 236 ms of which 2 ms to minimize.
[2024-05-29 18:37:07] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 3 ms to minimize.
[2024-05-29 18:37:07] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 2 ms to minimize.
[2024-05-29 18:37:09] [INFO ] Deduced a trap composed of 168 places in 279 ms of which 3 ms to minimize.
[2024-05-29 18:37:09] [INFO ] Deduced a trap composed of 167 places in 279 ms of which 3 ms to minimize.
[2024-05-29 18:37:11] [INFO ] Deduced a trap composed of 168 places in 252 ms of which 3 ms to minimize.
[2024-05-29 18:37:11] [INFO ] Deduced a trap composed of 168 places in 247 ms of which 3 ms to minimize.
[2024-05-29 18:37:12] [INFO ] Deduced a trap composed of 169 places in 245 ms of which 3 ms to minimize.
SMT process timed out in 62339ms, After SMT, problems are : Problem set: 0 solved, 1121 unsolved
Search for dead transitions found 0 dead transitions in 62353ms
Starting structural reductions in LTL mode, iteration 1 : 555/597 places, 1122/1164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63090 ms. Remains : 555/597 places, 1122/1164 transitions.
[2024-05-29 18:37:12] [INFO ] Flatten gal took : 42 ms
[2024-05-29 18:37:12] [INFO ] Flatten gal took : 74 ms
[2024-05-29 18:37:12] [INFO ] Input system was already deterministic with 1122 transitions.
[2024-05-29 18:37:12] [INFO ] Flatten gal took : 42 ms
[2024-05-29 18:37:12] [INFO ] Flatten gal took : 43 ms
[2024-05-29 18:37:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality1616646320088549895.gal : 29 ms
[2024-05-29 18:37:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality5211787855628494159.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/CTLCardinality1616646320088549895.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5211787855628494159.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.
Detected timeout of ITS tools.
[2024-05-29 18:37:42] [INFO ] Flatten gal took : 38 ms
[2024-05-29 18:37:42] [INFO ] Applying decomposition
[2024-05-29 18:37:42] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11144953063925190112.txt' '-o' '/tmp/graph11144953063925190112.bin' '-w' '/tmp/graph11144953063925190112.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11144953063925190112.bin' '-l' '-1' '-v' '-w' '/tmp/graph11144953063925190112.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:37:42] [INFO ] Decomposing Gal with order
[2024-05-29 18:37:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:37:43] [INFO ] Removed a total of 2737 redundant transitions.
[2024-05-29 18:37:43] [INFO ] Flatten gal took : 157 ms
[2024-05-29 18:37:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 25 ms.
[2024-05-29 18:37:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality9261785395543848156.gal : 14 ms
[2024-05-29 18:37:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality4958345437352455892.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/CTLCardinality9261785395543848156.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4958345437352455892.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 1164/1164 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 571 transition count 1138
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 571 transition count 1138
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 64 place count 559 transition count 1126
Iterating global reduction 0 with 12 rules applied. Total rules applied 76 place count 559 transition count 1126
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 81 place count 554 transition count 1121
Iterating global reduction 0 with 5 rules applied. Total rules applied 86 place count 554 transition count 1121
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 552 transition count 1119
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 552 transition count 1119
Applied a total of 90 rules in 61 ms. Remains 552 /597 variables (removed 45) and now considering 1119/1164 (removed 45) transitions.
// Phase 1: matrix 1119 rows 552 cols
[2024-05-29 18:38:13] [INFO ] Computed 6 invariants in 9 ms
[2024-05-29 18:38:13] [INFO ] Implicit Places using invariants in 550 ms returned []
[2024-05-29 18:38:13] [INFO ] Invariant cache hit.
[2024-05-29 18:38:14] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
Running 1118 sub problems to find dead transitions.
[2024-05-29 18:38:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1118 unsolved
At refinement iteration 1 (OVERLAPS) 1/552 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1118 unsolved
[2024-05-29 18:38:35] [INFO ] Deduced a trap composed of 164 places in 281 ms of which 3 ms to minimize.
[2024-05-29 18:38:35] [INFO ] Deduced a trap composed of 167 places in 283 ms of which 3 ms to minimize.
[2024-05-29 18:38:35] [INFO ] Deduced a trap composed of 165 places in 284 ms of which 3 ms to minimize.
[2024-05-29 18:38:35] [INFO ] Deduced a trap composed of 164 places in 266 ms of which 3 ms to minimize.
[2024-05-29 18:38:36] [INFO ] Deduced a trap composed of 166 places in 241 ms of which 2 ms to minimize.
[2024-05-29 18:38:36] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 3 ms to minimize.
[2024-05-29 18:38:36] [INFO ] Deduced a trap composed of 163 places in 221 ms of which 2 ms to minimize.
[2024-05-29 18:38:36] [INFO ] Deduced a trap composed of 167 places in 237 ms of which 3 ms to minimize.
[2024-05-29 18:38:37] [INFO ] Deduced a trap composed of 168 places in 238 ms of which 2 ms to minimize.
[2024-05-29 18:38:38] [INFO ] Deduced a trap composed of 170 places in 233 ms of which 2 ms to minimize.
[2024-05-29 18:38:39] [INFO ] Deduced a trap composed of 166 places in 283 ms of which 3 ms to minimize.
[2024-05-29 18:38:39] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 3 ms to minimize.
[2024-05-29 18:38:39] [INFO ] Deduced a trap composed of 170 places in 208 ms of which 2 ms to minimize.
[2024-05-29 18:38:40] [INFO ] Deduced a trap composed of 170 places in 226 ms of which 7 ms to minimize.
[2024-05-29 18:38:40] [INFO ] Deduced a trap composed of 170 places in 240 ms of which 3 ms to minimize.
[2024-05-29 18:38:41] [INFO ] Deduced a trap composed of 169 places in 228 ms of which 2 ms to minimize.
[2024-05-29 18:38:41] [INFO ] Deduced a trap composed of 168 places in 225 ms of which 3 ms to minimize.
[2024-05-29 18:38:41] [INFO ] Deduced a trap composed of 221 places in 244 ms of which 3 ms to minimize.
[2024-05-29 18:38:41] [INFO ] Deduced a trap composed of 165 places in 245 ms of which 3 ms to minimize.
[2024-05-29 18:38:42] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1118 unsolved
[2024-05-29 18:38:42] [INFO ] Deduced a trap composed of 165 places in 229 ms of which 2 ms to minimize.
[2024-05-29 18:38:43] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 2 ms to minimize.
[2024-05-29 18:38:44] [INFO ] Deduced a trap composed of 221 places in 246 ms of which 2 ms to minimize.
[2024-05-29 18:38:45] [INFO ] Deduced a trap composed of 167 places in 251 ms of which 2 ms to minimize.
[2024-05-29 18:38:46] [INFO ] Deduced a trap composed of 165 places in 237 ms of which 2 ms to minimize.
[2024-05-29 18:38:46] [INFO ] Deduced a trap composed of 164 places in 261 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/1671 variables, and 32 constraints, problems are : Problem set: 0 solved, 1118 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/552 constraints, PredecessorRefiner: 1118/1118 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1118 unsolved
At refinement iteration 1 (OVERLAPS) 1/552 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 1118 unsolved
[2024-05-29 18:38:56] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 3 ms to minimize.
[2024-05-29 18:38:57] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 2 ms to minimize.
[2024-05-29 18:38:57] [INFO ] Deduced a trap composed of 166 places in 250 ms of which 3 ms to minimize.
[2024-05-29 18:38:58] [INFO ] Deduced a trap composed of 166 places in 251 ms of which 3 ms to minimize.
[2024-05-29 18:38:58] [INFO ] Deduced a trap composed of 163 places in 246 ms of which 3 ms to minimize.
[2024-05-29 18:38:59] [INFO ] Deduced a trap composed of 164 places in 259 ms of which 3 ms to minimize.
[2024-05-29 18:38:59] [INFO ] Deduced a trap composed of 220 places in 262 ms of which 3 ms to minimize.
[2024-05-29 18:39:00] [INFO ] Deduced a trap composed of 164 places in 243 ms of which 3 ms to minimize.
[2024-05-29 18:39:02] [INFO ] Deduced a trap composed of 165 places in 252 ms of which 4 ms to minimize.
[2024-05-29 18:39:02] [INFO ] Deduced a trap composed of 163 places in 229 ms of which 3 ms to minimize.
[2024-05-29 18:39:02] [INFO ] Deduced a trap composed of 218 places in 212 ms of which 3 ms to minimize.
[2024-05-29 18:39:03] [INFO ] Deduced a trap composed of 165 places in 206 ms of which 2 ms to minimize.
[2024-05-29 18:39:03] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 3 ms to minimize.
[2024-05-29 18:39:05] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 3 ms to minimize.
[2024-05-29 18:39:06] [INFO ] Deduced a trap composed of 166 places in 236 ms of which 3 ms to minimize.
[2024-05-29 18:39:07] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 2 ms to minimize.
[2024-05-29 18:39:08] [INFO ] Deduced a trap composed of 169 places in 224 ms of which 2 ms to minimize.
[2024-05-29 18:39:09] [INFO ] Deduced a trap composed of 164 places in 253 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/1671 variables, and 50 constraints, problems are : Problem set: 0 solved, 1118 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/552 constraints, PredecessorRefiner: 0/1118 constraints, Known Traps: 44/44 constraints]
After SMT, in 62384ms problems are : Problem set: 0 solved, 1118 unsolved
Search for dead transitions found 0 dead transitions in 62399ms
Starting structural reductions in LTL mode, iteration 1 : 552/597 places, 1119/1164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63583 ms. Remains : 552/597 places, 1119/1164 transitions.
[2024-05-29 18:39:16] [INFO ] Flatten gal took : 35 ms
[2024-05-29 18:39:17] [INFO ] Flatten gal took : 37 ms
[2024-05-29 18:39:17] [INFO ] Input system was already deterministic with 1119 transitions.
[2024-05-29 18:39:17] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:39:17] [INFO ] Flatten gal took : 50 ms
[2024-05-29 18:39:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality8426488588706698368.gal : 11 ms
[2024-05-29 18:39:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality9433438096463058615.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/CTLCardinality8426488588706698368.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9433438096463058615.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.
Detected timeout of ITS tools.
[2024-05-29 18:39:47] [INFO ] Flatten gal took : 33 ms
[2024-05-29 18:39:47] [INFO ] Applying decomposition
[2024-05-29 18:39:47] [INFO ] Flatten gal took : 32 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/graph2269467286855055816.txt' '-o' '/tmp/graph2269467286855055816.bin' '-w' '/tmp/graph2269467286855055816.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2269467286855055816.bin' '-l' '-1' '-v' '-w' '/tmp/graph2269467286855055816.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:39:47] [INFO ] Decomposing Gal with order
[2024-05-29 18:39:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:39:47] [INFO ] Removed a total of 2734 redundant transitions.
[2024-05-29 18:39:47] [INFO ] Flatten gal took : 131 ms
[2024-05-29 18:39:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 26 ms.
[2024-05-29 18:39:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality3839924540243137530.gal : 19 ms
[2024-05-29 18:39:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality177264576565043228.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/CTLCardinality3839924540243137530.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality177264576565043228.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 1164/1164 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 572 transition count 1139
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 572 transition count 1139
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 61 place count 561 transition count 1128
Iterating global reduction 0 with 11 rules applied. Total rules applied 72 place count 561 transition count 1128
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 557 transition count 1124
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 557 transition count 1124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 556 transition count 1123
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 556 transition count 1123
Applied a total of 82 rules in 54 ms. Remains 556 /597 variables (removed 41) and now considering 1123/1164 (removed 41) transitions.
// Phase 1: matrix 1123 rows 556 cols
[2024-05-29 18:40:17] [INFO ] Computed 6 invariants in 16 ms
[2024-05-29 18:40:18] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-29 18:40:18] [INFO ] Invariant cache hit.
[2024-05-29 18:40:18] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Running 1122 sub problems to find dead transitions.
[2024-05-29 18:40:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/555 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 1 (OVERLAPS) 1/556 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
[2024-05-29 18:40:40] [INFO ] Deduced a trap composed of 218 places in 287 ms of which 4 ms to minimize.
[2024-05-29 18:40:41] [INFO ] Deduced a trap composed of 167 places in 231 ms of which 2 ms to minimize.
[2024-05-29 18:40:41] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 2 ms to minimize.
[2024-05-29 18:40:42] [INFO ] Deduced a trap composed of 167 places in 233 ms of which 2 ms to minimize.
[2024-05-29 18:40:43] [INFO ] Deduced a trap composed of 166 places in 250 ms of which 3 ms to minimize.
[2024-05-29 18:40:43] [INFO ] Deduced a trap composed of 163 places in 247 ms of which 3 ms to minimize.
[2024-05-29 18:40:43] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 3 ms to minimize.
[2024-05-29 18:40:44] [INFO ] Deduced a trap composed of 163 places in 202 ms of which 2 ms to minimize.
[2024-05-29 18:40:44] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 3 ms to minimize.
[2024-05-29 18:40:45] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 2 ms to minimize.
[2024-05-29 18:40:46] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 3 ms to minimize.
[2024-05-29 18:40:46] [INFO ] Deduced a trap composed of 167 places in 230 ms of which 2 ms to minimize.
[2024-05-29 18:40:47] [INFO ] Deduced a trap composed of 166 places in 242 ms of which 3 ms to minimize.
[2024-05-29 18:40:47] [INFO ] Deduced a trap composed of 165 places in 215 ms of which 3 ms to minimize.
[2024-05-29 18:40:48] [INFO ] Deduced a trap composed of 166 places in 237 ms of which 3 ms to minimize.
[2024-05-29 18:40:49] [INFO ] Deduced a trap composed of 165 places in 239 ms of which 3 ms to minimize.
[2024-05-29 18:40:49] [INFO ] Deduced a trap composed of 165 places in 238 ms of which 2 ms to minimize.
[2024-05-29 18:40:49] [INFO ] Deduced a trap composed of 166 places in 235 ms of which 3 ms to minimize.
[2024-05-29 18:40:50] [INFO ] Deduced a trap composed of 167 places in 223 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 556/1679 variables, and 25 constraints, problems are : Problem set: 0 solved, 1122 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/556 constraints, PredecessorRefiner: 1122/1122 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/555 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 1 (OVERLAPS) 1/556 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/556 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
[2024-05-29 18:41:00] [INFO ] Deduced a trap composed of 169 places in 226 ms of which 3 ms to minimize.
[2024-05-29 18:41:01] [INFO ] Deduced a trap composed of 166 places in 251 ms of which 3 ms to minimize.
[2024-05-29 18:41:01] [INFO ] Deduced a trap composed of 169 places in 248 ms of which 3 ms to minimize.
[2024-05-29 18:41:01] [INFO ] Deduced a trap composed of 171 places in 242 ms of which 2 ms to minimize.
[2024-05-29 18:41:03] [INFO ] Deduced a trap composed of 172 places in 244 ms of which 3 ms to minimize.
[2024-05-29 18:41:03] [INFO ] Deduced a trap composed of 169 places in 222 ms of which 2 ms to minimize.
[2024-05-29 18:41:04] [INFO ] Deduced a trap composed of 168 places in 228 ms of which 2 ms to minimize.
[2024-05-29 18:41:04] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 2 ms to minimize.
[2024-05-29 18:41:04] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 3 ms to minimize.
[2024-05-29 18:41:06] [INFO ] Deduced a trap composed of 167 places in 218 ms of which 2 ms to minimize.
[2024-05-29 18:41:06] [INFO ] Deduced a trap composed of 165 places in 234 ms of which 3 ms to minimize.
[2024-05-29 18:41:07] [INFO ] Deduced a trap composed of 165 places in 218 ms of which 3 ms to minimize.
[2024-05-29 18:41:08] [INFO ] Deduced a trap composed of 165 places in 256 ms of which 2 ms to minimize.
[2024-05-29 18:41:09] [INFO ] Deduced a trap composed of 165 places in 222 ms of which 2 ms to minimize.
[2024-05-29 18:41:11] [INFO ] Deduced a trap composed of 167 places in 209 ms of which 3 ms to minimize.
[2024-05-29 18:41:11] [INFO ] Deduced a trap composed of 165 places in 218 ms of which 2 ms to minimize.
[2024-05-29 18:41:12] [INFO ] Deduced a trap composed of 163 places in 238 ms of which 2 ms to minimize.
[2024-05-29 18:41:13] [INFO ] Deduced a trap composed of 220 places in 249 ms of which 3 ms to minimize.
[2024-05-29 18:41:13] [INFO ] Deduced a trap composed of 165 places in 234 ms of which 2 ms to minimize.
[2024-05-29 18:41:13] [INFO ] Deduced a trap composed of 168 places in 234 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/556 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
[2024-05-29 18:41:20] [INFO ] Deduced a trap composed of 163 places in 211 ms of which 2 ms to minimize.
SMT process timed out in 62080ms, After SMT, problems are : Problem set: 0 solved, 1122 unsolved
Search for dead transitions found 0 dead transitions in 62091ms
Starting structural reductions in LTL mode, iteration 1 : 556/597 places, 1123/1164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62802 ms. Remains : 556/597 places, 1123/1164 transitions.
[2024-05-29 18:41:20] [INFO ] Flatten gal took : 31 ms
[2024-05-29 18:41:20] [INFO ] Flatten gal took : 33 ms
[2024-05-29 18:41:20] [INFO ] Input system was already deterministic with 1123 transitions.
[2024-05-29 18:41:20] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:41:20] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:41:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality10755940833554897629.gal : 10 ms
[2024-05-29 18:41:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality11646907792807301340.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/CTLCardinality10755940833554897629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11646907792807301340.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.
Detected timeout of ITS tools.
[2024-05-29 18:41:50] [INFO ] Flatten gal took : 36 ms
[2024-05-29 18:41:50] [INFO ] Applying decomposition
[2024-05-29 18:41:51] [INFO ] Flatten gal took : 50 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/graph5000085763883527846.txt' '-o' '/tmp/graph5000085763883527846.bin' '-w' '/tmp/graph5000085763883527846.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5000085763883527846.bin' '-l' '-1' '-v' '-w' '/tmp/graph5000085763883527846.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:41:51] [INFO ] Decomposing Gal with order
[2024-05-29 18:41:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:41:51] [INFO ] Removed a total of 2734 redundant transitions.
[2024-05-29 18:41:51] [INFO ] Flatten gal took : 74 ms
[2024-05-29 18:41:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 10 ms.
[2024-05-29 18:41:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality4464305816249302042.gal : 7 ms
[2024-05-29 18:41:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality8085964046191608567.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/CTLCardinality4464305816249302042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8085964046191608567.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,6.04945e+10,25.8093,789972,3766,17,1.18236e+06,1654,1439,5.21792e+06,47,3653,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 1164/1164 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 571 transition count 1138
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 571 transition count 1138
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 64 place count 559 transition count 1126
Iterating global reduction 0 with 12 rules applied. Total rules applied 76 place count 559 transition count 1126
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 555 transition count 1122
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 555 transition count 1122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 553 transition count 1120
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 553 transition count 1120
Applied a total of 88 rules in 52 ms. Remains 553 /597 variables (removed 44) and now considering 1120/1164 (removed 44) transitions.
// Phase 1: matrix 1120 rows 553 cols
[2024-05-29 18:42:21] [INFO ] Computed 6 invariants in 14 ms
[2024-05-29 18:42:21] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-29 18:42:21] [INFO ] Invariant cache hit.
[2024-05-29 18:42:22] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
Running 1119 sub problems to find dead transitions.
[2024-05-29 18:42:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1119 unsolved
At refinement iteration 1 (OVERLAPS) 1/553 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1119 unsolved
[2024-05-29 18:42:44] [INFO ] Deduced a trap composed of 163 places in 305 ms of which 4 ms to minimize.
[2024-05-29 18:42:44] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 2 ms to minimize.
[2024-05-29 18:42:44] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 2 ms to minimize.
[2024-05-29 18:42:45] [INFO ] Deduced a trap composed of 165 places in 237 ms of which 2 ms to minimize.
[2024-05-29 18:42:46] [INFO ] Deduced a trap composed of 166 places in 296 ms of which 4 ms to minimize.
[2024-05-29 18:42:46] [INFO ] Deduced a trap composed of 166 places in 294 ms of which 3 ms to minimize.
[2024-05-29 18:42:47] [INFO ] Deduced a trap composed of 167 places in 273 ms of which 3 ms to minimize.
[2024-05-29 18:42:47] [INFO ] Deduced a trap composed of 162 places in 242 ms of which 2 ms to minimize.
[2024-05-29 18:42:47] [INFO ] Deduced a trap composed of 165 places in 226 ms of which 2 ms to minimize.
[2024-05-29 18:42:49] [INFO ] Deduced a trap composed of 165 places in 254 ms of which 3 ms to minimize.
[2024-05-29 18:42:49] [INFO ] Deduced a trap composed of 166 places in 243 ms of which 2 ms to minimize.
[2024-05-29 18:42:49] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 2 ms to minimize.
[2024-05-29 18:42:50] [INFO ] Deduced a trap composed of 219 places in 221 ms of which 3 ms to minimize.
[2024-05-29 18:42:51] [INFO ] Deduced a trap composed of 166 places in 238 ms of which 2 ms to minimize.
[2024-05-29 18:42:52] [INFO ] Deduced a trap composed of 167 places in 244 ms of which 3 ms to minimize.
[2024-05-29 18:42:52] [INFO ] Deduced a trap composed of 165 places in 203 ms of which 4 ms to minimize.
[2024-05-29 18:42:52] [INFO ] Deduced a trap composed of 166 places in 256 ms of which 3 ms to minimize.
(s519 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0timeout
)
(s520 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/1673 variables, and 23 constraints, problems are : Problem set: 0 solved, 1119 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/553 constraints, PredecessorRefiner: 1119/1119 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1119 unsolved
At refinement iteration 1 (OVERLAPS) 1/553 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 1119 unsolved
[2024-05-29 18:43:07] [INFO ] Deduced a trap composed of 165 places in 227 ms of which 2 ms to minimize.
[2024-05-29 18:43:08] [INFO ] Deduced a trap composed of 164 places in 236 ms of which 3 ms to minimize.
[2024-05-29 18:43:09] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 2 ms to minimize.
[2024-05-29 18:43:10] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 3 ms to minimize.
[2024-05-29 18:43:12] [INFO ] Deduced a trap composed of 165 places in 254 ms of which 2 ms to minimize.
[2024-05-29 18:43:12] [INFO ] Deduced a trap composed of 166 places in 249 ms of which 3 ms to minimize.
[2024-05-29 18:43:13] [INFO ] Deduced a trap composed of 169 places in 253 ms of which 6 ms to minimize.
[2024-05-29 18:43:13] [INFO ] Deduced a trap composed of 164 places in 302 ms of which 3 ms to minimize.
[2024-05-29 18:43:13] [INFO ] Deduced a trap composed of 167 places in 289 ms of which 3 ms to minimize.
[2024-05-29 18:43:14] [INFO ] Deduced a trap composed of 220 places in 277 ms of which 2 ms to minimize.
[2024-05-29 18:43:14] [INFO ] Deduced a trap composed of 167 places in 260 ms of which 3 ms to minimize.
[2024-05-29 18:43:14] [INFO ] Deduced a trap composed of 169 places in 271 ms of which 2 ms to minimize.
[2024-05-29 18:43:15] [INFO ] Deduced a trap composed of 170 places in 285 ms of which 2 ms to minimize.
[2024-05-29 18:43:15] [INFO ] Deduced a trap composed of 169 places in 257 ms of which 3 ms to minimize.
[2024-05-29 18:43:15] [INFO ] Deduced a trap composed of 166 places in 254 ms of which 3 ms to minimize.
[2024-05-29 18:43:16] [INFO ] Deduced a trap composed of 169 places in 251 ms of which 2 ms to minimize.
[2024-05-29 18:43:16] [INFO ] Deduced a trap composed of 165 places in 262 ms of which 3 ms to minimize.
[2024-05-29 18:43:16] [INFO ] Deduced a trap composed of 165 places in 214 ms of which 2 ms to minimize.
[2024-05-29 18:43:17] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 2 ms to minimize.
[2024-05-29 18:43:17] [INFO ] Deduced a trap composed of 165 places in 218 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/553 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1119 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/1673 variables, and 43 constraints, problems are : Problem set: 0 solved, 1119 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/553 constraints, PredecessorRefiner: 0/1119 constraints, Known Traps: 37/37 constraints]
After SMT, in 62120ms problems are : Problem set: 0 solved, 1119 unsolved
Search for dead transitions found 0 dead transitions in 62133ms
Starting structural reductions in LTL mode, iteration 1 : 553/597 places, 1120/1164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62862 ms. Remains : 553/597 places, 1120/1164 transitions.
[2024-05-29 18:43:24] [INFO ] Flatten gal took : 31 ms
[2024-05-29 18:43:24] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:43:24] [INFO ] Input system was already deterministic with 1120 transitions.
[2024-05-29 18:43:24] [INFO ] Flatten gal took : 31 ms
[2024-05-29 18:43:24] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:43:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality14110180584647933446.gal : 8 ms
[2024-05-29 18:43:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality778946073176862229.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/CTLCardinality14110180584647933446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality778946073176862229.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.
Detected timeout of ITS tools.
[2024-05-29 18:43:54] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:43:54] [INFO ] Applying decomposition
[2024-05-29 18:43:54] [INFO ] Flatten gal took : 33 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/graph1057516439901456657.txt' '-o' '/tmp/graph1057516439901456657.bin' '-w' '/tmp/graph1057516439901456657.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1057516439901456657.bin' '-l' '-1' '-v' '-w' '/tmp/graph1057516439901456657.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:43:54] [INFO ] Decomposing Gal with order
[2024-05-29 18:43:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:43:54] [INFO ] Removed a total of 2737 redundant transitions.
[2024-05-29 18:43:54] [INFO ] Flatten gal took : 96 ms
[2024-05-29 18:43:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 8 ms.
[2024-05-29 18:43:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality13721832494866147182.gal : 6 ms
[2024-05-29 18:43:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality16340947699434698928.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/CTLCardinality13721832494866147182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16340947699434698928.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 597/597 places, 1164/1164 transitions.
Graph (trivial) has 609 edges and 597 vertex of which 91 / 597 are part of one of the 15 SCC in 2 ms
Free SCC test removed 76 places
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 369 transitions
Trivial Post-agglo rules discarded 369 transitions
Performed 369 trivial Post agglomeration. Transition count delta: 369
Iterating post reduction 0 with 369 rules applied. Total rules applied 370 place count 520 transition count 708
Reduce places removed 369 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 379 rules applied. Total rules applied 749 place count 151 transition count 698
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 755 place count 146 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 756 place count 145 transition count 697
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 756 place count 145 transition count 681
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 788 place count 129 transition count 681
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 804 place count 113 transition count 662
Iterating global reduction 4 with 16 rules applied. Total rules applied 820 place count 113 transition count 662
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 4 with 2 rules applied. Total rules applied 822 place count 113 transition count 660
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 824 place count 111 transition count 660
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 824 place count 111 transition count 658
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 828 place count 109 transition count 658
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 833 place count 104 transition count 571
Iterating global reduction 6 with 5 rules applied. Total rules applied 838 place count 104 transition count 571
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 839 place count 104 transition count 570
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 841 place count 102 transition count 566
Iterating global reduction 7 with 2 rules applied. Total rules applied 843 place count 102 transition count 566
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 873 place count 87 transition count 551
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 889 place count 71 transition count 200
Iterating global reduction 7 with 16 rules applied. Total rules applied 905 place count 71 transition count 200
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 914 place count 71 transition count 191
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 917 place count 68 transition count 185
Iterating global reduction 8 with 3 rules applied. Total rules applied 920 place count 68 transition count 185
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 922 place count 66 transition count 181
Iterating global reduction 8 with 2 rules applied. Total rules applied 924 place count 66 transition count 181
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 926 place count 65 transition count 180
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 927 place count 64 transition count 175
Iterating global reduction 8 with 1 rules applied. Total rules applied 928 place count 64 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 929 place count 64 transition count 174
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 934 place count 64 transition count 169
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 944 place count 59 transition count 164
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 945 place count 58 transition count 163
Applied a total of 945 rules in 160 ms. Remains 58 /597 variables (removed 539) and now considering 163/1164 (removed 1001) transitions.
[2024-05-29 18:44:25] [INFO ] Flow matrix only has 157 transitions (discarded 6 similar events)
// Phase 1: matrix 157 rows 58 cols
[2024-05-29 18:44:25] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 18:44:25] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-29 18:44:25] [INFO ] Flow matrix only has 157 transitions (discarded 6 similar events)
[2024-05-29 18:44:25] [INFO ] Invariant cache hit.
[2024-05-29 18:44:25] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 18:44:25] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-29 18:44:25] [INFO ] Redundant transitions in 4 ms returned []
Running 152 sub problems to find dead transitions.
[2024-05-29 18:44:25] [INFO ] Flow matrix only has 157 transitions (discarded 6 similar events)
[2024-05-29 18:44:25] [INFO ] Invariant cache hit.
[2024-05-29 18:44:25] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 5/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-29 18:44:26] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:44:26] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-29 18:44:26] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-05-29 18:44:26] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:44:26] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2024-05-29 18:44:26] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:44:26] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:44:26] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:44:26] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:44:26] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:44:26] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:44:26] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-29 18:44:26] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:44:26] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2024-05-29 18:44:26] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:44:26] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-29 18:44:26] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2024-05-29 18:44:27] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:44:27] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2024-05-29 18:44:27] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-29 18:44:27] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:44:27] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:44:27] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2024-05-29 18:44:27] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2024-05-29 18:44:27] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:44:27] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-29 18:44:27] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:44:27] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-29 18:44:28] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:44:28] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:44:28] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 156/214 variables, 58/91 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 30/121 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 1/215 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (OVERLAPS) 0/215 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 122 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5615 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 5/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-29 18:44:31] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:44:31] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 156/214 variables, 58/93 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 30/123 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 152/275 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (OVERLAPS) 1/215 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (OVERLAPS) 0/215 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 276 constraints, problems are : Problem set: 0 solved, 152 unsolved in 7402 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 33/33 constraints]
After SMT, in 13236ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 13239ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/597 places, 163/1164 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13612 ms. Remains : 58/597 places, 163/1164 transitions.
[2024-05-29 18:44:38] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:44:38] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:44:38] [INFO ] Input system was already deterministic with 163 transitions.
[2024-05-29 18:44:38] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:44:38] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:44:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality3425497751044626092.gal : 2 ms
[2024-05-29 18:44:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality13875302437592004857.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/CTLCardinality3425497751044626092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13875302437592004857.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,200004,0.680242,28896,2,4434,5,71814,6,0,385,70001,0


Converting to forward existential form...Done !
original formula: EG((p255==0))
=> equivalent forward existential formula: [FwdG(Init,(p255==0))] != FALSE
Hit Full ! (commute/partial/dont) 145/0/18
(forward)formula 0,1,3.27272,96960,1,0,25,345729,19,4,3729,334386,22
FORMULA StigmergyElection-PT-05b-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 597/597 places, 1164/1164 transitions.
Graph (trivial) has 607 edges and 597 vertex of which 91 / 597 are part of one of the 15 SCC in 2 ms
Free SCC test removed 76 places
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 366 transitions
Trivial Post-agglo rules discarded 366 transitions
Performed 366 trivial Post agglomeration. Transition count delta: 366
Iterating post reduction 0 with 366 rules applied. Total rules applied 367 place count 520 transition count 711
Reduce places removed 366 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 376 rules applied. Total rules applied 743 place count 154 transition count 701
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 749 place count 149 transition count 700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 750 place count 148 transition count 700
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 750 place count 148 transition count 684
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 782 place count 132 transition count 684
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 798 place count 116 transition count 665
Iterating global reduction 4 with 16 rules applied. Total rules applied 814 place count 116 transition count 665
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 4 with 2 rules applied. Total rules applied 816 place count 116 transition count 663
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 818 place count 114 transition count 663
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 818 place count 114 transition count 661
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 822 place count 112 transition count 661
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 827 place count 107 transition count 574
Iterating global reduction 6 with 5 rules applied. Total rules applied 832 place count 107 transition count 574
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 833 place count 107 transition count 573
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 835 place count 105 transition count 569
Iterating global reduction 7 with 2 rules applied. Total rules applied 837 place count 105 transition count 569
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 867 place count 90 transition count 554
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 883 place count 74 transition count 203
Iterating global reduction 7 with 16 rules applied. Total rules applied 899 place count 74 transition count 203
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 908 place count 74 transition count 194
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 910 place count 72 transition count 190
Iterating global reduction 8 with 2 rules applied. Total rules applied 912 place count 72 transition count 190
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 913 place count 71 transition count 188
Iterating global reduction 8 with 1 rules applied. Total rules applied 914 place count 71 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 916 place count 70 transition count 187
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 917 place count 69 transition count 181
Iterating global reduction 8 with 1 rules applied. Total rules applied 918 place count 69 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 919 place count 69 transition count 180
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 924 place count 69 transition count 175
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 934 place count 64 transition count 170
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 935 place count 64 transition count 170
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 936 place count 63 transition count 169
Applied a total of 936 rules in 178 ms. Remains 63 /597 variables (removed 534) and now considering 169/1164 (removed 995) transitions.
[2024-05-29 18:44:42] [INFO ] Flow matrix only has 163 transitions (discarded 6 similar events)
// Phase 1: matrix 163 rows 63 cols
[2024-05-29 18:44:42] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:44:42] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-29 18:44:42] [INFO ] Flow matrix only has 163 transitions (discarded 6 similar events)
[2024-05-29 18:44:42] [INFO ] Invariant cache hit.
[2024-05-29 18:44:42] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 18:44:42] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-05-29 18:44:42] [INFO ] Redundant transitions in 4 ms returned []
Running 158 sub problems to find dead transitions.
[2024-05-29 18:44:42] [INFO ] Flow matrix only has 163 transitions (discarded 6 similar events)
[2024-05-29 18:44:42] [INFO ] Invariant cache hit.
[2024-05-29 18:44:42] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (OVERLAPS) 5/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-29 18:44:43] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:44:43] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-29 18:44:43] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:44:43] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:44:43] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:44:43] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-05-29 18:44:43] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2024-05-29 18:44:43] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:44:43] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:44:43] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:44:43] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:44:43] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2024-05-29 18:44:43] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:44:44] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-29 18:44:44] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:44:44] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:44:44] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-05-29 18:44:44] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 162/225 variables, 63/83 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-29 18:44:45] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:44:45] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:44:45] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-29 18:44:45] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:44:45] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 5/118 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-29 18:44:46] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:44:46] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 1/226 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 12 (OVERLAPS) 0/226 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 121 constraints, problems are : Problem set: 0 solved, 158 unsolved in 6987 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (OVERLAPS) 5/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 162/225 variables, 63/90 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 30/120 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 158/278 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-29 18:44:51] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 1/226 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-29 18:44:55] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 13 (OVERLAPS) 0/226 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 281 constraints, problems are : Problem set: 0 solved, 158 unsolved in 10760 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 27/27 constraints]
After SMT, in 17868ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 17871ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/597 places, 169/1164 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18391 ms. Remains : 63/597 places, 169/1164 transitions.
[2024-05-29 18:45:00] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:45:00] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:45:00] [INFO ] Input system was already deterministic with 169 transitions.
[2024-05-29 18:45:00] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:45:00] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:45:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality8998383509672706453.gal : 2 ms
[2024-05-29 18:45:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality8270766298742465949.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/CTLCardinality8998383509672706453.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8270766298742465949.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,274948,0.641948,27652,2,4750,5,69141,6,0,411,67535,0


Converting to forward existential form...Done !
original formula: EF(AG(EF(((p304==0)&&(p156==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U ((p304==0)&&(p156==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t9, t10, t13, t14, t20, t22, t23, t45, t47, t48, t49, t50, t51, t75, t79, t10...324
(forward)formula 0,0,10.5572,324072,1,0,375,1.53038e+06,352,175,5473,784650,399
FORMULA StigmergyElection-PT-05b-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 1164/1164 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 569 transition count 1136
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 569 transition count 1136
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 69 place count 556 transition count 1123
Iterating global reduction 0 with 13 rules applied. Total rules applied 82 place count 556 transition count 1123
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 87 place count 551 transition count 1118
Iterating global reduction 0 with 5 rules applied. Total rules applied 92 place count 551 transition count 1118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 94 place count 549 transition count 1116
Iterating global reduction 0 with 2 rules applied. Total rules applied 96 place count 549 transition count 1116
Applied a total of 96 rules in 59 ms. Remains 549 /597 variables (removed 48) and now considering 1116/1164 (removed 48) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-05-29 18:45:11] [INFO ] Computed 6 invariants in 7 ms
[2024-05-29 18:45:11] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-29 18:45:11] [INFO ] Invariant cache hit.
[2024-05-29 18:45:11] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2024-05-29 18:45:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 18:45:33] [INFO ] Deduced a trap composed of 164 places in 274 ms of which 4 ms to minimize.
[2024-05-29 18:45:33] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 2 ms to minimize.
[2024-05-29 18:45:34] [INFO ] Deduced a trap composed of 165 places in 207 ms of which 3 ms to minimize.
[2024-05-29 18:45:35] [INFO ] Deduced a trap composed of 163 places in 277 ms of which 3 ms to minimize.
[2024-05-29 18:45:36] [INFO ] Deduced a trap composed of 164 places in 249 ms of which 3 ms to minimize.
[2024-05-29 18:45:36] [INFO ] Deduced a trap composed of 162 places in 242 ms of which 2 ms to minimize.
[2024-05-29 18:45:36] [INFO ] Deduced a trap composed of 163 places in 222 ms of which 2 ms to minimize.
[2024-05-29 18:45:37] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 2 ms to minimize.
[2024-05-29 18:45:37] [INFO ] Deduced a trap composed of 165 places in 240 ms of which 2 ms to minimize.
[2024-05-29 18:45:37] [INFO ] Deduced a trap composed of 165 places in 252 ms of which 2 ms to minimize.
[2024-05-29 18:45:37] [INFO ] Deduced a trap composed of 226 places in 249 ms of which 2 ms to minimize.
[2024-05-29 18:45:38] [INFO ] Deduced a trap composed of 166 places in 242 ms of which 3 ms to minimize.
[2024-05-29 18:45:38] [INFO ] Deduced a trap composed of 163 places in 216 ms of which 2 ms to minimize.
[2024-05-29 18:45:39] [INFO ] Deduced a trap composed of 165 places in 228 ms of which 2 ms to minimize.
[2024-05-29 18:45:39] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 2 ms to minimize.
[2024-05-29 18:45:40] [INFO ] Deduced a trap composed of 166 places in 255 ms of which 3 ms to minimize.
[2024-05-29 18:45:40] [INFO ] Deduced a trap composed of 163 places in 225 ms of which 2 ms to minimize.
[2024-05-29 18:45:41] [INFO ] Deduced a trap composed of 165 places in 246 ms of which 2 ms to minimize.
[2024-05-29 18:45:42] [INFO ] Deduced a trap composed of 167 places in 227 ms of which 3 ms to minimize.
[2024-05-29 18:45:43] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/1665 variables, and 26 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 1115/1115 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 18:45:55] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 2 ms to minimize.
[2024-05-29 18:45:58] [INFO ] Deduced a trap composed of 162 places in 238 ms of which 2 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 165 places in 223 ms of which 2 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 3 ms to minimize.
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 2 ms to minimize.
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 167 places in 269 ms of which 3 ms to minimize.
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 167 places in 266 ms of which 3 ms to minimize.
[2024-05-29 18:46:03] [INFO ] Deduced a trap composed of 166 places in 250 ms of which 3 ms to minimize.
[2024-05-29 18:46:03] [INFO ] Deduced a trap composed of 167 places in 256 ms of which 2 ms to minimize.
[2024-05-29 18:46:04] [INFO ] Deduced a trap composed of 166 places in 277 ms of which 3 ms to minimize.
[2024-05-29 18:46:04] [INFO ] Deduced a trap composed of 167 places in 269 ms of which 3 ms to minimize.
[2024-05-29 18:46:04] [INFO ] Deduced a trap composed of 166 places in 280 ms of which 3 ms to minimize.
[2024-05-29 18:46:05] [INFO ] Deduced a trap composed of 164 places in 303 ms of which 4 ms to minimize.
[2024-05-29 18:46:05] [INFO ] Deduced a trap composed of 167 places in 292 ms of which 3 ms to minimize.
[2024-05-29 18:46:05] [INFO ] Deduced a trap composed of 166 places in 249 ms of which 3 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 203 places in 270 ms of which 3 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 166 places in 268 ms of which 2 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 167 places in 243 ms of which 3 ms to minimize.
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/1665 variables, and 45 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 0/1115 constraints, Known Traps: 39/39 constraints]
After SMT, in 62154ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 62163ms
Starting structural reductions in LTL mode, iteration 1 : 549/597 places, 1116/1164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63019 ms. Remains : 549/597 places, 1116/1164 transitions.
[2024-05-29 18:46:14] [INFO ] Flatten gal took : 30 ms
[2024-05-29 18:46:14] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:46:14] [INFO ] Input system was already deterministic with 1116 transitions.
[2024-05-29 18:46:14] [INFO ] Flatten gal took : 30 ms
[2024-05-29 18:46:14] [INFO ] Flatten gal took : 31 ms
[2024-05-29 18:46:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality5683602372047970879.gal : 6 ms
[2024-05-29 18:46:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality16271210608387716996.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/CTLCardinality5683602372047970879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16271210608387716996.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.
Detected timeout of ITS tools.
[2024-05-29 18:46:44] [INFO ] Flatten gal took : 31 ms
[2024-05-29 18:46:44] [INFO ] Applying decomposition
[2024-05-29 18:46:44] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17833934024180023130.txt' '-o' '/tmp/graph17833934024180023130.bin' '-w' '/tmp/graph17833934024180023130.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17833934024180023130.bin' '-l' '-1' '-v' '-w' '/tmp/graph17833934024180023130.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:46:44] [INFO ] Decomposing Gal with order
[2024-05-29 18:46:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:46:44] [INFO ] Removed a total of 2732 redundant transitions.
[2024-05-29 18:46:44] [INFO ] Flatten gal took : 73 ms
[2024-05-29 18:46:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2024-05-29 18:46:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality1701177126334195643.gal : 5 ms
[2024-05-29 18:46:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality14005372613483039368.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/CTLCardinality1701177126334195643.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14005372613483039368.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 1164/1164 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 576 transition count 1143
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 576 transition count 1143
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 568 transition count 1135
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 568 transition count 1135
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 566 transition count 1133
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 566 transition count 1133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 565 transition count 1132
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 565 transition count 1132
Applied a total of 64 rules in 64 ms. Remains 565 /597 variables (removed 32) and now considering 1132/1164 (removed 32) transitions.
// Phase 1: matrix 1132 rows 565 cols
[2024-05-29 18:47:14] [INFO ] Computed 6 invariants in 7 ms
[2024-05-29 18:47:15] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-29 18:47:15] [INFO ] Invariant cache hit.
[2024-05-29 18:47:15] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
Running 1131 sub problems to find dead transitions.
[2024-05-29 18:47:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/564 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 1 (OVERLAPS) 1/565 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2024-05-29 18:47:36] [INFO ] Deduced a trap composed of 165 places in 244 ms of which 3 ms to minimize.
[2024-05-29 18:47:36] [INFO ] Deduced a trap composed of 171 places in 256 ms of which 2 ms to minimize.
[2024-05-29 18:47:36] [INFO ] Deduced a trap composed of 167 places in 238 ms of which 3 ms to minimize.
[2024-05-29 18:47:36] [INFO ] Deduced a trap composed of 171 places in 224 ms of which 2 ms to minimize.
[2024-05-29 18:47:37] [INFO ] Deduced a trap composed of 167 places in 235 ms of which 3 ms to minimize.
[2024-05-29 18:47:37] [INFO ] Deduced a trap composed of 172 places in 241 ms of which 2 ms to minimize.
[2024-05-29 18:47:38] [INFO ] Deduced a trap composed of 173 places in 214 ms of which 2 ms to minimize.
[2024-05-29 18:47:38] [INFO ] Deduced a trap composed of 170 places in 233 ms of which 2 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 168 places in 255 ms of which 3 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 169 places in 238 ms of which 3 ms to minimize.
[2024-05-29 18:47:40] [INFO ] Deduced a trap composed of 170 places in 289 ms of which 3 ms to minimize.
[2024-05-29 18:47:40] [INFO ] Deduced a trap composed of 172 places in 240 ms of which 3 ms to minimize.
[2024-05-29 18:47:41] [INFO ] Deduced a trap composed of 170 places in 285 ms of which 3 ms to minimize.
[2024-05-29 18:47:41] [INFO ] Deduced a trap composed of 162 places in 257 ms of which 2 ms to minimize.
[2024-05-29 18:47:42] [INFO ] Deduced a trap composed of 167 places in 243 ms of which 3 ms to minimize.
[2024-05-29 18:47:42] [INFO ] Deduced a trap composed of 170 places in 206 ms of which 3 ms to minimize.
[2024-05-29 18:47:42] [INFO ] Deduced a trap composed of 166 places in 239 ms of which 2 ms to minimize.
[2024-05-29 18:47:44] [INFO ] Deduced a trap composed of 169 places in 279 ms of which 2 ms to minimize.
[2024-05-29 18:47:45] [INFO ] Deduced a trap composed of 167 places in 224 ms of which 3 ms to minimize.
[2024-05-29 18:47:45] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/565 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2024-05-29 18:47:46] [INFO ] Deduced a trap composed of 168 places in 229 ms of which 3 ms to minimize.
[2024-05-29 18:47:46] [INFO ] Deduced a trap composed of 169 places in 249 ms of which 3 ms to minimize.
[2024-05-29 18:47:47] [INFO ] Deduced a trap composed of 168 places in 247 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/1697 variables, and 29 constraints, problems are : Problem set: 0 solved, 1131 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/565 constraints, PredecessorRefiner: 1131/1131 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/564 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 1 (OVERLAPS) 1/565 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/565 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 170 places in 208 ms of which 3 ms to minimize.
[2024-05-29 18:47:59] [INFO ] Deduced a trap composed of 164 places in 245 ms of which 3 ms to minimize.
[2024-05-29 18:48:00] [INFO ] Deduced a trap composed of 168 places in 253 ms of which 2 ms to minimize.
[2024-05-29 18:48:00] [INFO ] Deduced a trap composed of 173 places in 257 ms of which 3 ms to minimize.
[2024-05-29 18:48:01] [INFO ] Deduced a trap composed of 167 places in 237 ms of which 3 ms to minimize.
[2024-05-29 18:48:04] [INFO ] Deduced a trap composed of 172 places in 246 ms of which 2 ms to minimize.
[2024-05-29 18:48:06] [INFO ] Deduced a trap composed of 172 places in 246 ms of which 2 ms to minimize.
[2024-05-29 18:48:06] [INFO ] Deduced a trap composed of 165 places in 196 ms of which 2 ms to minimize.
[2024-05-29 18:48:07] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 2 ms to minimize.
[2024-05-29 18:48:08] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 3 ms to minimize.
[2024-05-29 18:48:08] [INFO ] Deduced a trap composed of 167 places in 240 ms of which 3 ms to minimize.
[2024-05-29 18:48:08] [INFO ] Deduced a trap composed of 168 places in 265 ms of which 3 ms to minimize.
[2024-05-29 18:48:09] [INFO ] Deduced a trap composed of 165 places in 264 ms of which 3 ms to minimize.
[2024-05-29 18:48:09] [INFO ] Deduced a trap composed of 165 places in 255 ms of which 2 ms to minimize.
[2024-05-29 18:48:09] [INFO ] Deduced a trap composed of 168 places in 263 ms of which 3 ms to minimize.
[2024-05-29 18:48:10] [INFO ] Deduced a trap composed of 222 places in 234 ms of which 3 ms to minimize.
[2024-05-29 18:48:10] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/1697 variables, and 46 constraints, problems are : Problem set: 0 solved, 1131 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/565 constraints, PredecessorRefiner: 0/1131 constraints, Known Traps: 40/40 constraints]
After SMT, in 62206ms problems are : Problem set: 0 solved, 1131 unsolved
Search for dead transitions found 0 dead transitions in 62227ms
Starting structural reductions in LTL mode, iteration 1 : 565/597 places, 1132/1164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63028 ms. Remains : 565/597 places, 1132/1164 transitions.
[2024-05-29 18:48:17] [INFO ] Flatten gal took : 31 ms
[2024-05-29 18:48:17] [INFO ] Flatten gal took : 33 ms
[2024-05-29 18:48:17] [INFO ] Input system was already deterministic with 1132 transitions.
[2024-05-29 18:48:17] [INFO ] Flatten gal took : 33 ms
[2024-05-29 18:48:18] [INFO ] Flatten gal took : 44 ms
[2024-05-29 18:48:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality14410991171030798842.gal : 6 ms
[2024-05-29 18:48:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality4359644174355871720.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/CTLCardinality14410991171030798842.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4359644174355871720.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.
Detected timeout of ITS tools.
[2024-05-29 18:48:48] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:48:48] [INFO ] Applying decomposition
[2024-05-29 18:48:48] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15244667078821897372.txt' '-o' '/tmp/graph15244667078821897372.bin' '-w' '/tmp/graph15244667078821897372.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15244667078821897372.bin' '-l' '-1' '-v' '-w' '/tmp/graph15244667078821897372.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:48:48] [INFO ] Decomposing Gal with order
[2024-05-29 18:48:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:48:48] [INFO ] Removed a total of 2731 redundant transitions.
[2024-05-29 18:48:48] [INFO ] Flatten gal took : 55 ms
[2024-05-29 18:48:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 7 ms.
[2024-05-29 18:48:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality4262958969357489490.gal : 5 ms
[2024-05-29 18:48:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality12464982859026469669.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/CTLCardinality4262958969357489490.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12464982859026469669.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 597/597 places, 1164/1164 transitions.
Graph (trivial) has 576 edges and 597 vertex of which 91 / 597 are part of one of the 15 SCC in 2 ms
Free SCC test removed 76 places
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 334 place count 520 transition count 744
Reduce places removed 333 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 341 rules applied. Total rules applied 675 place count 187 transition count 736
Reduce places removed 4 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 14 rules applied. Total rules applied 689 place count 183 transition count 726
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 699 place count 173 transition count 726
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 699 place count 173 transition count 710
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 731 place count 157 transition count 710
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 745 place count 143 transition count 693
Iterating global reduction 4 with 14 rules applied. Total rules applied 759 place count 143 transition count 693
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 4 with 2 rules applied. Total rules applied 761 place count 143 transition count 691
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 763 place count 141 transition count 691
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 763 place count 141 transition count 690
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 765 place count 140 transition count 690
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 769 place count 136 transition count 604
Iterating global reduction 6 with 4 rules applied. Total rules applied 773 place count 136 transition count 604
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 775 place count 134 transition count 600
Iterating global reduction 6 with 2 rules applied. Total rules applied 777 place count 134 transition count 600
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 807 place count 119 transition count 585
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 819 place count 107 transition count 254
Iterating global reduction 6 with 12 rules applied. Total rules applied 831 place count 107 transition count 254
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 836 place count 107 transition count 249
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 838 place count 106 transition count 248
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 839 place count 105 transition count 240
Iterating global reduction 7 with 1 rules applied. Total rules applied 840 place count 105 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 841 place count 105 transition count 239
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 846 place count 105 transition count 234
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 856 place count 100 transition count 229
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 859 place count 100 transition count 229
Applied a total of 859 rules in 83 ms. Remains 100 /597 variables (removed 497) and now considering 229/1164 (removed 935) transitions.
[2024-05-29 18:49:18] [INFO ] Flow matrix only has 222 transitions (discarded 7 similar events)
// Phase 1: matrix 222 rows 100 cols
[2024-05-29 18:49:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:49:18] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 18:49:18] [INFO ] Flow matrix only has 222 transitions (discarded 7 similar events)
[2024-05-29 18:49:18] [INFO ] Invariant cache hit.
[2024-05-29 18:49:18] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 18:49:18] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-29 18:49:18] [INFO ] Redundant transitions in 4 ms returned []
Running 226 sub problems to find dead transitions.
[2024-05-29 18:49:18] [INFO ] Flow matrix only has 222 transitions (discarded 7 similar events)
[2024-05-29 18:49:18] [INFO ] Invariant cache hit.
[2024-05-29 18:49:18] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-05-29 18:49:21] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:49:21] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:49:21] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:49:21] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 18:49:21] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-29 18:49:21] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:49:21] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-29 18:49:22] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:49:22] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:49:22] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:49:22] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:49:22] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:49:22] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-29 18:49:22] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:49:22] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:49:22] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2024-05-29 18:49:22] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 0 ms to minimize.
[2024-05-29 18:49:23] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 18:49:23] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 18:49:24] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:49:24] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 18:49:24] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 18:49:25] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2024-05-29 18:49:26] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 221/321 variables, 100/142 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 30/172 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 18:49:27] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/321 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 18:49:29] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/321 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 18:49:31] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:49:31] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/321 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 16 (OVERLAPS) 1/322 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/322 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 18:49:38] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/322 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/322 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 20 (OVERLAPS) 0/322 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 178 constraints, problems are : Problem set: 0 solved, 226 unsolved in 25804 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 18:49:45] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-29 18:49:45] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 0 ms to minimize.
[2024-05-29 18:49:45] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 18:49:46] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 221/321 variables, 100/151 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 30/181 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 226/407 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (OVERLAPS) 1/322 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 18:49:58] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2024-05-29 18:50:00] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 18:50:07] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/322 variables, and 411 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 52/52 constraints]
After SMT, in 55979ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 55982ms
Starting structural reductions in SI_CTL mode, iteration 1 : 100/597 places, 229/1164 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56260 ms. Remains : 100/597 places, 229/1164 transitions.
[2024-05-29 18:50:14] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:50:14] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:50:14] [INFO ] Input system was already deterministic with 229 transitions.
[2024-05-29 18:50:14] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:50:14] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:50:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality6643541261498045980.gal : 2 ms
[2024-05-29 18:50:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality5753158732398776772.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/CTLCardinality6643541261498045980.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5753158732398776772.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,2.28571e+06,2.07054,69436,2,7122,5,166249,6,0,622,175870,0


Converting to forward existential form...Done !
original formula: E(((p569==0)||(p88==1)) U ((E((((A((p165==1) U ((p618==0)||(p356==1))) * A(((p396==0)||(p394==1)) U (p488==1))) * (((p193==0)||(p412==1))...274
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,((p569==0)||(p88==1))) * ((p499==0)||(p6==1))) * (p55==1)),(((!((E(!(((p618==0)||(p356==1))) ...453
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t11, t21, t22, t25, t28, t34, t35, t44, t46, t47, t77, t83, t90, t106, t108, t109, t1...355
(forward)formula 0,0,8.70985,206656,1,0,433,932540,472,204,7461,585230,460
FORMULA StigmergyElection-PT-05b-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 1164/1164 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 570 transition count 1137
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 570 transition count 1137
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 66 place count 558 transition count 1125
Iterating global reduction 0 with 12 rules applied. Total rules applied 78 place count 558 transition count 1125
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 554 transition count 1121
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 554 transition count 1121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 553 transition count 1120
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 553 transition count 1120
Applied a total of 88 rules in 57 ms. Remains 553 /597 variables (removed 44) and now considering 1120/1164 (removed 44) transitions.
// Phase 1: matrix 1120 rows 553 cols
[2024-05-29 18:50:23] [INFO ] Computed 6 invariants in 8 ms
[2024-05-29 18:50:23] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-29 18:50:23] [INFO ] Invariant cache hit.
[2024-05-29 18:50:24] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
Running 1119 sub problems to find dead transitions.
[2024-05-29 18:50:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1119 unsolved
At refinement iteration 1 (OVERLAPS) 1/553 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1119 unsolved
[2024-05-29 18:50:47] [INFO ] Deduced a trap composed of 164 places in 298 ms of which 3 ms to minimize.
[2024-05-29 18:50:47] [INFO ] Deduced a trap composed of 164 places in 233 ms of which 2 ms to minimize.
[2024-05-29 18:50:47] [INFO ] Deduced a trap composed of 167 places in 222 ms of which 2 ms to minimize.
[2024-05-29 18:50:49] [INFO ] Deduced a trap composed of 168 places in 277 ms of which 3 ms to minimize.
[2024-05-29 18:50:51] [INFO ] Deduced a trap composed of 166 places in 252 ms of which 2 ms to minimize.
[2024-05-29 18:50:52] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 2 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 167 places in 226 ms of which 3 ms to minimize.
[2024-05-29 18:50:55] [INFO ] Deduced a trap composed of 164 places in 232 ms of which 2 ms to minimize.
[2024-05-29 18:50:55] [INFO ] Deduced a trap composed of 166 places in 235 ms of which 2 ms to minimize.
[2024-05-29 18:50:56] [INFO ] Deduced a trap composed of 165 places in 255 ms of which 3 ms to minimize.
[2024-05-29 18:50:56] [INFO ] Deduced a trap composed of 163 places in 252 ms of which 2 ms to minimize.
[2024-05-29 18:50:56] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 2 ms to minimize.
SMT process timed out in 32377ms, After SMT, problems are : Problem set: 0 solved, 1119 unsolved
Search for dead transitions found 0 dead transitions in 32391ms
Starting structural reductions in LTL mode, iteration 1 : 553/597 places, 1120/1164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33161 ms. Remains : 553/597 places, 1120/1164 transitions.
[2024-05-29 18:50:56] [INFO ] Flatten gal took : 30 ms
[2024-05-29 18:50:56] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:50:56] [INFO ] Input system was already deterministic with 1120 transitions.
[2024-05-29 18:50:56] [INFO ] Flatten gal took : 33 ms
[2024-05-29 18:50:56] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:50:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality3210546577704709082.gal : 6 ms
[2024-05-29 18:50:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality18433476550688420067.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/CTLCardinality3210546577704709082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18433476550688420067.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.
Detected timeout of ITS tools.
[2024-05-29 18:51:27] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:51:27] [INFO ] Applying decomposition
[2024-05-29 18:51:27] [INFO ] Flatten gal took : 32 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/graph14379148330815883433.txt' '-o' '/tmp/graph14379148330815883433.bin' '-w' '/tmp/graph14379148330815883433.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14379148330815883433.bin' '-l' '-1' '-v' '-w' '/tmp/graph14379148330815883433.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:51:27] [INFO ] Decomposing Gal with order
[2024-05-29 18:51:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:51:27] [INFO ] Removed a total of 2732 redundant transitions.
[2024-05-29 18:51:27] [INFO ] Flatten gal took : 55 ms
[2024-05-29 18:51:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2024-05-29 18:51:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality13717579776646377008.gal : 6 ms
[2024-05-29 18:51:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality12830425593168865048.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/CTLCardinality13717579776646377008.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12830425593168865048.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 1164/1164 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 572 transition count 1139
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 572 transition count 1139
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 62 place count 560 transition count 1127
Iterating global reduction 0 with 12 rules applied. Total rules applied 74 place count 560 transition count 1127
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 556 transition count 1123
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 556 transition count 1123
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 554 transition count 1121
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 554 transition count 1121
Applied a total of 86 rules in 54 ms. Remains 554 /597 variables (removed 43) and now considering 1121/1164 (removed 43) transitions.
// Phase 1: matrix 1121 rows 554 cols
[2024-05-29 18:51:57] [INFO ] Computed 6 invariants in 14 ms
[2024-05-29 18:51:57] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-29 18:51:57] [INFO ] Invariant cache hit.
[2024-05-29 18:51:58] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
Running 1120 sub problems to find dead transitions.
[2024-05-29 18:51:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (OVERLAPS) 1/554 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-29 18:52:18] [INFO ] Deduced a trap composed of 166 places in 261 ms of which 3 ms to minimize.
[2024-05-29 18:52:19] [INFO ] Deduced a trap composed of 167 places in 258 ms of which 3 ms to minimize.
[2024-05-29 18:52:19] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 2 ms to minimize.
[2024-05-29 18:52:19] [INFO ] Deduced a trap composed of 168 places in 215 ms of which 3 ms to minimize.
[2024-05-29 18:52:19] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 2 ms to minimize.
[2024-05-29 18:52:20] [INFO ] Deduced a trap composed of 167 places in 202 ms of which 2 ms to minimize.
[2024-05-29 18:52:20] [INFO ] Deduced a trap composed of 168 places in 246 ms of which 3 ms to minimize.
[2024-05-29 18:52:21] [INFO ] Deduced a trap composed of 163 places in 286 ms of which 3 ms to minimize.
[2024-05-29 18:52:21] [INFO ] Deduced a trap composed of 164 places in 272 ms of which 3 ms to minimize.
[2024-05-29 18:52:22] [INFO ] Deduced a trap composed of 167 places in 290 ms of which 3 ms to minimize.
[2024-05-29 18:52:22] [INFO ] Deduced a trap composed of 165 places in 271 ms of which 3 ms to minimize.
[2024-05-29 18:52:23] [INFO ] Deduced a trap composed of 170 places in 246 ms of which 3 ms to minimize.
[2024-05-29 18:52:23] [INFO ] Deduced a trap composed of 166 places in 239 ms of which 3 ms to minimize.
[2024-05-29 18:52:23] [INFO ] Deduced a trap composed of 166 places in 256 ms of which 3 ms to minimize.
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 165 places in 259 ms of which 3 ms to minimize.
[2024-05-29 18:52:25] [INFO ] Deduced a trap composed of 167 places in 275 ms of which 3 ms to minimize.
[2024-05-29 18:52:25] [INFO ] Deduced a trap composed of 165 places in 279 ms of which 3 ms to minimize.
[2024-05-29 18:52:25] [INFO ] Deduced a trap composed of 165 places in 269 ms of which 3 ms to minimize.
[2024-05-29 18:52:26] [INFO ] Deduced a trap composed of 166 places in 276 ms of which 4 ms to minimize.
[2024-05-29 18:52:26] [INFO ] Deduced a trap composed of 169 places in 272 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/554 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-29 18:52:28] [INFO ] Deduced a trap composed of 164 places in 243 ms of which 2 ms to minimize.
[2024-05-29 18:52:28] [INFO ] Deduced a trap composed of 169 places in 213 ms of which 3 ms to minimize.
[2024-05-29 18:52:30] [INFO ] Deduced a trap composed of 166 places in 245 ms of which 2 ms to minimize.
[2024-05-29 18:52:30] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 2 ms to minimize.
SMT process timed out in 32649ms, After SMT, problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 32663ms
Starting structural reductions in LTL mode, iteration 1 : 554/597 places, 1121/1164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33419 ms. Remains : 554/597 places, 1121/1164 transitions.
[2024-05-29 18:52:30] [INFO ] Flatten gal took : 29 ms
[2024-05-29 18:52:30] [INFO ] Flatten gal took : 31 ms
[2024-05-29 18:52:30] [INFO ] Input system was already deterministic with 1121 transitions.
[2024-05-29 18:52:30] [INFO ] Flatten gal took : 30 ms
[2024-05-29 18:52:31] [INFO ] Flatten gal took : 31 ms
[2024-05-29 18:52:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality9177925262042890378.gal : 6 ms
[2024-05-29 18:52:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality14853836687851997739.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/CTLCardinality9177925262042890378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14853836687851997739.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.
Detected timeout of ITS tools.
[2024-05-29 18:53:01] [INFO ] Flatten gal took : 34 ms
[2024-05-29 18:53:01] [INFO ] Applying decomposition
[2024-05-29 18:53:01] [INFO ] Flatten gal took : 32 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/graph13755431389831788666.txt' '-o' '/tmp/graph13755431389831788666.bin' '-w' '/tmp/graph13755431389831788666.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13755431389831788666.bin' '-l' '-1' '-v' '-w' '/tmp/graph13755431389831788666.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:53:01] [INFO ] Decomposing Gal with order
[2024-05-29 18:53:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:53:01] [INFO ] Removed a total of 2737 redundant transitions.
[2024-05-29 18:53:01] [INFO ] Flatten gal took : 53 ms
[2024-05-29 18:53:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 15 ms.
[2024-05-29 18:53:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality8825902494695931337.gal : 9 ms
[2024-05-29 18:53:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality17369596088327796959.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/CTLCardinality8825902494695931337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17369596088327796959.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 1164/1164 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 569 transition count 1136
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 569 transition count 1136
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 69 place count 556 transition count 1123
Iterating global reduction 0 with 13 rules applied. Total rules applied 82 place count 556 transition count 1123
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 87 place count 551 transition count 1118
Iterating global reduction 0 with 5 rules applied. Total rules applied 92 place count 551 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 550 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 550 transition count 1117
Applied a total of 94 rules in 50 ms. Remains 550 /597 variables (removed 47) and now considering 1117/1164 (removed 47) transitions.
// Phase 1: matrix 1117 rows 550 cols
[2024-05-29 18:53:31] [INFO ] Computed 6 invariants in 15 ms
[2024-05-29 18:53:31] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-29 18:53:31] [INFO ] Invariant cache hit.
[2024-05-29 18:53:32] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2024-05-29 18:53:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/549 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (OVERLAPS) 1/550 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-29 18:53:55] [INFO ] Deduced a trap composed of 218 places in 304 ms of which 4 ms to minimize.
[2024-05-29 18:53:55] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 2 ms to minimize.
[2024-05-29 18:53:55] [INFO ] Deduced a trap composed of 164 places in 230 ms of which 2 ms to minimize.
[2024-05-29 18:53:55] [INFO ] Deduced a trap composed of 163 places in 222 ms of which 2 ms to minimize.
[2024-05-29 18:53:57] [INFO ] Deduced a trap composed of 164 places in 230 ms of which 2 ms to minimize.
[2024-05-29 18:53:57] [INFO ] Deduced a trap composed of 165 places in 292 ms of which 3 ms to minimize.
[2024-05-29 18:53:58] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 2 ms to minimize.
[2024-05-29 18:53:58] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 6 ms to minimize.
[2024-05-29 18:53:59] [INFO ] Deduced a trap composed of 165 places in 226 ms of which 2 ms to minimize.
[2024-05-29 18:54:00] [INFO ] Deduced a trap composed of 166 places in 259 ms of which 3 ms to minimize.
[2024-05-29 18:54:00] [INFO ] Deduced a trap composed of 165 places in 238 ms of which 3 ms to minimize.
[2024-05-29 18:54:01] [INFO ] Deduced a trap composed of 218 places in 234 ms of which 3 ms to minimize.
[2024-05-29 18:54:01] [INFO ] Deduced a trap composed of 166 places in 232 ms of which 2 ms to minimize.
[2024-05-29 18:54:01] [INFO ] Deduced a trap composed of 165 places in 210 ms of which 3 ms to minimize.
[2024-05-29 18:54:03] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 3 ms to minimize.
[2024-05-29 18:54:03] [INFO ] Deduced a trap composed of 166 places in 246 ms of which 3 ms to minimize.
[2024-05-29 18:54:03] [INFO ] Deduced a trap composed of 167 places in 233 ms of which 2 ms to minimize.
[2024-05-29 18:54:03] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 3 ms to minimize.
[2024-05-29 18:54:04] [INFO ] Deduced a trap composed of 165 places in 204 ms of which 3 ms to minimize.
[2024-05-29 18:54:04] [INFO ] Deduced a trap composed of 166 places in 236 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1667 variables, and 26 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/550 constraints, PredecessorRefiner: 1116/1116 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/549 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (OVERLAPS) 1/550 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-29 18:54:14] [INFO ] Deduced a trap composed of 165 places in 266 ms of which 3 ms to minimize.
[2024-05-29 18:54:14] [INFO ] Deduced a trap composed of 166 places in 257 ms of which 3 ms to minimize.
[2024-05-29 18:54:14] [INFO ] Deduced a trap composed of 166 places in 235 ms of which 3 ms to minimize.
[2024-05-29 18:54:16] [INFO ] Deduced a trap composed of 164 places in 230 ms of which 2 ms to minimize.
[2024-05-29 18:54:17] [INFO ] Deduced a trap composed of 163 places in 227 ms of which 3 ms to minimize.
[2024-05-29 18:54:18] [INFO ] Deduced a trap composed of 167 places in 224 ms of which 2 ms to minimize.
[2024-05-29 18:54:18] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 3 ms to minimize.
[2024-05-29 18:54:19] [INFO ] Deduced a trap composed of 163 places in 257 ms of which 2 ms to minimize.
[2024-05-29 18:54:20] [INFO ] Deduced a trap composed of 163 places in 215 ms of which 2 ms to minimize.
[2024-05-29 18:54:23] [INFO ] Deduced a trap composed of 163 places in 203 ms of which 2 ms to minimize.
[2024-05-29 18:54:25] [INFO ] Deduced a trap composed of 164 places in 239 ms of which 2 ms to minimize.
[2024-05-29 18:54:25] [INFO ] Deduced a trap composed of 165 places in 290 ms of which 3 ms to minimize.
[2024-05-29 18:54:26] [INFO ] Deduced a trap composed of 165 places in 261 ms of which 3 ms to minimize.
[2024-05-29 18:54:26] [INFO ] Deduced a trap composed of 165 places in 287 ms of which 3 ms to minimize.
[2024-05-29 18:54:26] [INFO ] Deduced a trap composed of 165 places in 290 ms of which 3 ms to minimize.
[2024-05-29 18:54:27] [INFO ] Deduced a trap composed of 167 places in 273 ms of which 3 ms to minimize.
[2024-05-29 18:54:27] [INFO ] Deduced a trap composed of 165 places in 276 ms of which 3 ms to minimize.
[2024-05-29 18:54:27] [INFO ] Deduced a trap composed of 166 places in 254 ms of which 3 ms to minimize.
[2024-05-29 18:54:27] [INFO ] Deduced a trap composed of 164 places in 266 ms of which 3 ms to minimize.
[2024-05-29 18:54:28] [INFO ] Deduced a trap composed of 166 places in 251 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/550 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-29 18:54:29] [INFO ] Deduced a trap composed of 167 places in 223 ms of which 3 ms to minimize.
[2024-05-29 18:54:29] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 2 ms to minimize.
[2024-05-29 18:54:30] [INFO ] Deduced a trap composed of 165 places in 213 ms of which 2 ms to minimize.
[2024-05-29 18:54:33] [INFO ] Deduced a trap composed of 218 places in 242 ms of which 2 ms to minimize.
[2024-05-29 18:54:34] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 2 ms to minimize.
[2024-05-29 18:54:34] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1667 variables, and 52 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/550 constraints, PredecessorRefiner: 0/1116 constraints, Known Traps: 46/46 constraints]
After SMT, in 62522ms problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 62534ms
Starting structural reductions in LTL mode, iteration 1 : 550/597 places, 1117/1164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63281 ms. Remains : 550/597 places, 1117/1164 transitions.
[2024-05-29 18:54:34] [INFO ] Flatten gal took : 30 ms
[2024-05-29 18:54:34] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:54:34] [INFO ] Input system was already deterministic with 1117 transitions.
[2024-05-29 18:54:34] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:54:34] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:54:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality12615046871250379427.gal : 6 ms
[2024-05-29 18:54:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality17238276771967961058.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/CTLCardinality12615046871250379427.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17238276771967961058.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.
Detected timeout of ITS tools.
[2024-05-29 18:55:05] [INFO ] Flatten gal took : 33 ms
[2024-05-29 18:55:05] [INFO ] Applying decomposition
[2024-05-29 18:55:05] [INFO ] Flatten gal took : 32 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/graph38004297950664428.txt' '-o' '/tmp/graph38004297950664428.bin' '-w' '/tmp/graph38004297950664428.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph38004297950664428.bin' '-l' '-1' '-v' '-w' '/tmp/graph38004297950664428.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:55:05] [INFO ] Decomposing Gal with order
[2024-05-29 18:55:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:55:05] [INFO ] Removed a total of 2730 redundant transitions.
[2024-05-29 18:55:05] [INFO ] Flatten gal took : 54 ms
[2024-05-29 18:55:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2024-05-29 18:55:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality5579092093038830672.gal : 5 ms
[2024-05-29 18:55:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality1610969179293789329.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/CTLCardinality5579092093038830672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1610969179293789329.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 597/597 places, 1164/1164 transitions.
Graph (trivial) has 590 edges and 597 vertex of which 81 / 597 are part of one of the 13 SCC in 2 ms
Free SCC test removed 68 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 358 place count 529 transition count 730
Reduce places removed 357 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 370 rules applied. Total rules applied 728 place count 172 transition count 717
Reduce places removed 7 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 13 rules applied. Total rules applied 741 place count 165 transition count 711
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 747 place count 159 transition count 711
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 747 place count 159 transition count 695
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 779 place count 143 transition count 695
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 791 place count 131 transition count 681
Iterating global reduction 4 with 12 rules applied. Total rules applied 803 place count 131 transition count 681
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 4 with 1 rules applied. Total rules applied 804 place count 131 transition count 680
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 805 place count 130 transition count 680
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 805 place count 130 transition count 678
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 809 place count 128 transition count 678
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 810 place count 127 transition count 677
Iterating global reduction 6 with 1 rules applied. Total rules applied 811 place count 127 transition count 677
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 843 place count 111 transition count 661
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 858 place count 96 transition count 237
Iterating global reduction 6 with 15 rules applied. Total rules applied 873 place count 96 transition count 237
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 882 place count 96 transition count 228
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 885 place count 93 transition count 223
Iterating global reduction 7 with 3 rules applied. Total rules applied 888 place count 93 transition count 223
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 890 place count 91 transition count 221
Iterating global reduction 7 with 2 rules applied. Total rules applied 892 place count 91 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 898 place count 91 transition count 215
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 908 place count 86 transition count 210
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 909 place count 86 transition count 210
Applied a total of 909 rules in 68 ms. Remains 86 /597 variables (removed 511) and now considering 210/1164 (removed 954) transitions.
[2024-05-29 18:55:35] [INFO ] Flow matrix only has 204 transitions (discarded 6 similar events)
// Phase 1: matrix 204 rows 86 cols
[2024-05-29 18:55:35] [INFO ] Computed 3 invariants in 5 ms
[2024-05-29 18:55:35] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 18:55:35] [INFO ] Flow matrix only has 204 transitions (discarded 6 similar events)
[2024-05-29 18:55:35] [INFO ] Invariant cache hit.
[2024-05-29 18:55:35] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-29 18:55:35] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-05-29 18:55:35] [INFO ] Redundant transitions in 2 ms returned []
Running 209 sub problems to find dead transitions.
[2024-05-29 18:55:35] [INFO ] Flow matrix only has 204 transitions (discarded 6 similar events)
[2024-05-29 18:55:35] [INFO ] Invariant cache hit.
[2024-05-29 18:55:35] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-29 18:55:36] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:55:36] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:55:36] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:55:36] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:55:36] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:55:36] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:55:36] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:55:36] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2024-05-29 18:55:37] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-29 18:55:37] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2024-05-29 18:55:37] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 0 ms to minimize.
[2024-05-29 18:55:37] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:55:37] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2024-05-29 18:55:37] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:55:37] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:55:37] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:55:37] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-29 18:55:37] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-29 18:55:37] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:55:37] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-29 18:55:37] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-29 18:55:37] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:55:37] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:55:38] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:55:38] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2024-05-29 18:55:38] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2024-05-29 18:55:38] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-05-29 18:55:38] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:55:38] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2024-05-29 18:55:38] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
[2024-05-29 18:55:38] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-29 18:55:38] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2024-05-29 18:55:38] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 13/36 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-29 18:55:39] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 0 ms to minimize.
[2024-05-29 18:55:39] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:55:39] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-29 18:55:39] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:55:39] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-29 18:55:40] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-29 18:55:40] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-29 18:55:40] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:55:40] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2024-05-29 18:55:40] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2024-05-29 18:55:41] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-29 18:55:42] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:55:42] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-05-29 18:55:42] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-29 18:55:42] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:55:42] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 0 ms to minimize.
[2024-05-29 18:55:42] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 203/289 variables, 86/139 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 38/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-29 18:55:44] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 14 (OVERLAPS) 1/290 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/290 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-29 18:55:51] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/290 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/290 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 18 (OVERLAPS) 0/290 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 180 constraints, problems are : Problem set: 0 solved, 209 unsolved in 19545 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 203/289 variables, 86/141 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 38/179 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 209/388 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-29 18:55:59] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:56:00] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (OVERLAPS) 1/290 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-29 18:56:10] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2024-05-29 18:56:10] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:56:10] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:56:10] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-29 18:56:10] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 5/396 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 12 (OVERLAPS) 0/290 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 396 constraints, problems are : Problem set: 0 solved, 209 unsolved in 27045 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 59/59 constraints]
After SMT, in 46742ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 46745ms
Starting structural reductions in SI_CTL mode, iteration 1 : 86/597 places, 210/1164 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46993 ms. Remains : 86/597 places, 210/1164 transitions.
[2024-05-29 18:56:22] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:56:22] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:56:22] [INFO ] Input system was already deterministic with 210 transitions.
[2024-05-29 18:56:22] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:56:22] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:56:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality18361195423954276035.gal : 2 ms
[2024-05-29 18:56:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality18268427542888729575.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/CTLCardinality18361195423954276035.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18268427542888729575.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,633399,1.37743,44808,2,6592,5,110154,6,0,548,109821,0


Converting to forward existential form...Done !
original formula: E(EG((AG((p248==1)) * (!(A(((p604==0)||(p355==1)) U (p451==1))) + !(((p503==0)||(p561==1)))))) U AG(AF(((AF((p1==1)) + (p519==0)) + ((p50...202
=> equivalent forward existential formula: [(FwdU(Init,EG((!(E(TRUE U !((p248==1)))) * (!(!((E(!((p451==1)) U (!(((p604==0)||(p355==1))) * !((p451==1)))) +...331
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t10, t20, t22, t25, t30, t32, t33, t65, t68, t72, t101, t105, t119, t139, t140, t141,...334
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-29 18:56:52] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:56:52] [INFO ] Applying decomposition
[2024-05-29 18:56:52] [INFO ] Flatten gal took : 8 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/graph3112754180841212312.txt' '-o' '/tmp/graph3112754180841212312.bin' '-w' '/tmp/graph3112754180841212312.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3112754180841212312.bin' '-l' '-1' '-v' '-w' '/tmp/graph3112754180841212312.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:56:52] [INFO ] Decomposing Gal with order
[2024-05-29 18:56:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:56:52] [INFO ] Removed a total of 599 redundant transitions.
[2024-05-29 18:56:52] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:56:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 2 ms.
[2024-05-29 18:56:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality17233722902759165390.gal : 15 ms
[2024-05-29 18:56:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality8215658863515367244.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/CTLCardinality17233722902759165390.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8215658863515367244.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,633399,0.290444,17092,928,75,19169,1050,515,85034,72,2784,0


Converting to forward existential form...Done !
original formula: E(EG((AG((i3.u6.p248==1)) * (!(A(((i7.u24.p604==0)||(i4.u10.p355==1)) U (i6.u15.p451==1))) + !(((i4.u17.p503==0)||(i7.u23.p561==1)))))) U...283
=> equivalent forward existential formula: [(FwdU(Init,EG((!(E(TRUE U !((i3.u6.p248==1)))) * (!(!((E(!((i6.u15.p451==1)) U (!(((i7.u24.p604==0)||(i4.u10.p3...426
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t32, t196, t199, t200, t201, t202, t203, t206, t209, i1.t101, i1.u1.t65, i1.u3.t105,...426
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
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
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
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
(forward)formula 0,0,5.06877,150148,1,0,233808,1819,3346,628405,383,8176,536541
FORMULA StigmergyElection-PT-05b-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-05-29 18:56:57] [INFO ] Flatten gal took : 35 ms
[2024-05-29 18:56:57] [INFO ] Flatten gal took : 34 ms
[2024-05-29 18:56:57] [INFO ] Applying decomposition
[2024-05-29 18:56:57] [INFO ] Flatten gal took : 34 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/graph3382568650822727359.txt' '-o' '/tmp/graph3382568650822727359.bin' '-w' '/tmp/graph3382568650822727359.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3382568650822727359.bin' '-l' '-1' '-v' '-w' '/tmp/graph3382568650822727359.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:56:57] [INFO ] Decomposing Gal with order
[2024-05-29 18:56:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:56:58] [INFO ] Removed a total of 2755 redundant transitions.
[2024-05-29 18:56:58] [INFO ] Flatten gal took : 58 ms
[2024-05-29 18:56:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2024-05-29 18:56:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality11180701362279276469.gal : 6 ms
[2024-05-29 18:56:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality9170467094041662358.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/CTLCardinality11180701362279276469.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9170467094041662358.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 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.22537e+10,15.2461,444576,5309,23,678415,1224,1668,2.85912e+06,51,3901,0


Converting to forward existential form...Done !
original formula: A(A((i19.u120.p335==0) U !(AX(EG(((i23.u4.p123==0)||(i18.u130.p359==1)))))) U !(EF(AX(EX(((i7.u56.p157==0)||(i24.u169.p462==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(EX(!(EX(((i7.u56.p157==0)||(i24.u169.p462==1)))))))))))) * !(E(!(!(E(TRUE U !(EX(!...514
Reverse transition relation is NOT exact ! Due to transitions t8, t18, t74, t85, t123, t136, t159, t160, t178, t229, t230, t266, t270, t287, t313, t335, t3...595
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Detected timeout of ITS tools.
[2024-05-29 19:24:27] [INFO ] Applying decomposition
[2024-05-29 19:24:27] [INFO ] Flatten gal took : 40 ms
[2024-05-29 19:24:27] [INFO ] Decomposing Gal with order
[2024-05-29 19:24:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:24:27] [INFO ] Removed a total of 2587 redundant transitions.
[2024-05-29 19:24:27] [INFO ] Flatten gal took : 88 ms
[2024-05-29 19:24:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 190 labels/synchronizations in 7 ms.
[2024-05-29 19:24:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality16673965913380181902.gal : 2 ms
[2024-05-29 19:24:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality14604371556070433691.ctl : 26 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/CTLCardinality16673965913380181902.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14604371556070433691.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 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.22537e+10,0.90482,30704,347,6326,6227,55668,181,23002,1068,311694,0


Converting to forward existential form...Done !
original formula: A(A((i0.i0.i0.u7.p335==0) U !(AX(EG(((i0.i0.i0.i0.u5.p123==0)||(i0.i0.i0.u7.p359==1)))))) U !(EF(AX(EX(((i0.i0.i0.i0.u6.p157==0)||(i0.i0....172
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(EX(!(EX(((i0.i0.i0.i0.u6.p157==0)||(i0.i0.u8.p462==1)))))))))))) * !(E(!(!(E(TRUE ...574
Reverse transition relation is NOT exact ! Due to transitions t609, u10.t47, u10.t48, i0.u9.t74, i0.u9.t85, i0.u9.t122, i0.u9.t123, i0.u9.t136, i0.u9.t158,...995
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-29 19:34:17] [INFO ] Flatten gal took : 38 ms
[2024-05-29 19:34:17] [INFO ] Input system was already deterministic with 1164 transitions.
[2024-05-29 19:34:17] [INFO ] Transformed 597 places.
[2024-05-29 19:34:17] [INFO ] Transformed 1164 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 19:34:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality16960961719019435241.gal : 7 ms
[2024-05-29 19:34:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality3308643520884910034.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/CTLCardinality16960961719019435241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3308643520884910034.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="StigmergyElection-PT-05b"
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 StigmergyElection-PT-05b, 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-171690532000305"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-05b.tgz
mv StigmergyElection-PT-05b 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 ;