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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 11 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 19:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 19:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 17M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717013756839

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 20:15:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 20:15:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:15:58] [INFO ] Load time of PNML (sax parser for PT used): 883 ms
[2024-05-29 20:15:59] [INFO ] Transformed 128 places.
[2024-05-29 20:15:59] [INFO ] Transformed 18490 transitions.
[2024-05-29 20:15:59] [INFO ] Found NUPN structural information;
[2024-05-29 20:15:59] [INFO ] Parsed PT model containing 128 places and 18490 transitions and 329609 arcs in 1133 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 100 ms.
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
Support contains 12 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1195/1195 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 112 transition count 1171
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 112 transition count 1171
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 104 transition count 1155
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 104 transition count 1155
Applied a total of 48 rules in 42 ms. Remains 104 /128 variables (removed 24) and now considering 1155/1195 (removed 40) transitions.
[2024-05-29 20:15:59] [INFO ] Flow matrix only has 1144 transitions (discarded 11 similar events)
// Phase 1: matrix 1144 rows 104 cols
[2024-05-29 20:15:59] [INFO ] Computed 2 invariants in 35 ms
[2024-05-29 20:15:59] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-29 20:15:59] [INFO ] Flow matrix only has 1144 transitions (discarded 11 similar events)
[2024-05-29 20:15:59] [INFO ] Invariant cache hit.
[2024-05-29 20:16:00] [INFO ] State equation strengthened by 1066 read => feed constraints.
[2024-05-29 20:16:02] [INFO ] Implicit Places using invariants and state equation in 2198 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2617 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/128 places, 1155/1195 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 88 transition count 1140
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 88 transition count 1140
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 79 transition count 1131
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 79 transition count 1131
Applied a total of 48 rules in 20 ms. Remains 79 /103 variables (removed 24) and now considering 1131/1155 (removed 24) transitions.
[2024-05-29 20:16:02] [INFO ] Flow matrix only has 1120 transitions (discarded 11 similar events)
// Phase 1: matrix 1120 rows 79 cols
[2024-05-29 20:16:02] [INFO ] Computed 1 invariants in 8 ms
[2024-05-29 20:16:02] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 20:16:02] [INFO ] Flow matrix only has 1120 transitions (discarded 11 similar events)
[2024-05-29 20:16:02] [INFO ] Invariant cache hit.
[2024-05-29 20:16:02] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:16:02] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 79/128 places, 1131/1195 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3062 ms. Remains : 79/128 places, 1131/1195 transitions.
Support contains 12 out of 79 places after structural reductions.
[2024-05-29 20:16:02] [INFO ] Flatten gal took : 181 ms
[2024-05-29 20:16:03] [INFO ] Flatten gal took : 116 ms
[2024-05-29 20:16:03] [INFO ] Input system was already deterministic with 1131 transitions.
Reduction of identical properties reduced properties to check from 17 to 8
RANDOM walk for 40000 steps (13 resets) in 4325 ms. (9 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40004 steps (12 resets) in 267 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (11 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
[2024-05-29 20:16:04] [INFO ] Flow matrix only has 1120 transitions (discarded 11 similar events)
[2024-05-29 20:16:04] [INFO ] Invariant cache hit.
[2024-05-29 20:16:04] [INFO ] State equation strengthened by 1030 read => feed constraints.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp13 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/79 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1119/1198 variables, 79/80 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1198 variables, 1029/1109 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1198 variables, 0/1109 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/1199 variables, 1/1110 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1199 variables, 0/1110 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1199 variables, 0/1110 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1199/1199 variables, and 1110 constraints, problems are : Problem set: 2 solved, 1 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 79/79 constraints, ReadFeed: 1030/1030 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Int declared 79/1199 variables, and 1 constraints, problems are : Problem set: 3 solved, 0 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/79 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 767ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-05-29 20:16:05] [INFO ] Flatten gal took : 82 ms
[2024-05-29 20:16:05] [INFO ] Flatten gal took : 93 ms
[2024-05-29 20:16:05] [INFO ] Input system was already deterministic with 1131 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 1131/1131 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 76 transition count 1127
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 76 transition count 1127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 75 transition count 1125
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 75 transition count 1125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 74 transition count 1124
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 74 transition count 1124
Applied a total of 10 rules in 20 ms. Remains 74 /79 variables (removed 5) and now considering 1124/1131 (removed 7) transitions.
[2024-05-29 20:16:05] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
// Phase 1: matrix 1114 rows 74 cols
[2024-05-29 20:16:05] [INFO ] Computed 1 invariants in 9 ms
[2024-05-29 20:16:05] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 20:16:05] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
[2024-05-29 20:16:05] [INFO ] Invariant cache hit.
[2024-05-29 20:16:06] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:16:06] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 1123 sub problems to find dead transitions.
[2024-05-29 20:16:06] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
[2024-05-29 20:16:06] [INFO ] Invariant cache hit.
[2024-05-29 20:16:06] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:16:26] [INFO ] Deduced a trap composed of 9 places in 314 ms of which 8 ms to minimize.
[2024-05-29 20:16:26] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 1 ms to minimize.
[2024-05-29 20:16:26] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 1 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 1 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 0 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 1 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 9 places in 217 ms of which 0 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 9 places in 228 ms of which 10 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 0 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 0 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 1 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2024-05-29 20:16:29] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2024-05-29 20:16:29] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-29 20:16:29] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 1 ms to minimize.
[2024-05-29 20:16:29] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 0 ms to minimize.
[2024-05-29 20:16:29] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:16:30] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 0 ms to minimize.
[2024-05-29 20:16:30] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2024-05-29 20:16:30] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-29 20:16:30] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-29 20:16:30] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:16:30] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-29 20:16:30] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 1 ms to minimize.
[2024-05-29 20:16:31] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2024-05-29 20:16:31] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 2 ms to minimize.
[2024-05-29 20:16:31] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2024-05-29 20:16:31] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-29 20:16:31] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:16:31] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-29 20:16:31] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 1 ms to minimize.
[2024-05-29 20:16:32] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 4 ms to minimize.
[2024-05-29 20:16:32] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 0 ms to minimize.
[2024-05-29 20:16:32] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2024-05-29 20:16:32] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 0 ms to minimize.
[2024-05-29 20:16:32] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 0 ms to minimize.
[2024-05-29 20:16:32] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:16:35] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2024-05-29 20:16:35] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2024-05-29 20:16:35] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2024-05-29 20:16:35] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2024-05-29 20:16:35] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 1 ms to minimize.
[2024-05-29 20:16:35] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-05-29 20:16:35] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2024-05-29 20:16:36] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2024-05-29 20:16:36] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 0 ms to minimize.
[2024-05-29 20:16:36] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-29 20:16:36] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2024-05-29 20:16:36] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:16:36] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 1 ms to minimize.
[2024-05-29 20:16:37] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 0 ms to minimize.
[2024-05-29 20:16:37] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 1 ms to minimize.
[2024-05-29 20:16:37] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 6 ms to minimize.
[2024-05-29 20:16:37] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2024-05-29 20:16:40] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:16:40] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:16:40] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:16:41] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2024-05-29 20:16:41] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-29 20:16:41] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-29 20:16:41] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:16:41] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:16:41] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-29 20:16:41] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:16:41] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:16:41] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2024-05-29 20:16:42] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-29 20:16:42] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-05-29 20:16:45] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:16:45] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-29 20:16:45] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2024-05-29 20:16:45] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-05-29 20:16:45] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-29 20:16:45] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2024-05-29 20:16:45] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-05-29 20:16:45] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:16:46] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:16:46] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-05-29 20:16:46] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 1 ms to minimize.
[2024-05-29 20:16:46] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-05-29 20:16:46] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-29 20:16:46] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:16:47] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2024-05-29 20:16:47] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-05-29 20:16:47] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 20:16:47] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 20:16:47] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-29 20:16:47] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 1 ms to minimize.
[2024-05-29 20:16:47] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2024-05-29 20:16:47] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:16:47] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-29 20:16:50] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
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 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 16/96 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 74/1188 variables, and 96 constraints, problems are : Problem set: 0 solved, 1123 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/74 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1123/91 constraints, Known Traps: 95/95 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 95/96 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:16:55] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-29 20:16:55] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2024-05-29 20:16:55] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2024-05-29 20:16:55] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:16:55] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:16:56] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:16:56] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-05-29 20:16:56] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:16:56] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:17:00] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:17:01] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2024-05-29 20:17:01] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2024-05-29 20:17:01] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 13/109 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:17:02] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-29 20:17:02] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2024-05-29 20:17:06] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-05-29 20:17:06] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:17:07] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:17:13] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:17:13] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 74/1188 variables, and 116 constraints, problems are : Problem set: 0 solved, 1123 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/74 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/91 constraints, Known Traps: 115/115 constraints]
After SMT, in 75740ms problems are : Problem set: 0 solved, 1123 unsolved
Search for dead transitions found 0 dead transitions in 75760ms
Starting structural reductions in LTL mode, iteration 1 : 74/79 places, 1124/1131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76158 ms. Remains : 74/79 places, 1124/1131 transitions.
[2024-05-29 20:17:22] [INFO ] Flatten gal took : 62 ms
[2024-05-29 20:17:22] [INFO ] Flatten gal took : 68 ms
[2024-05-29 20:17:22] [INFO ] Input system was already deterministic with 1124 transitions.
[2024-05-29 20:17:22] [INFO ] Flatten gal took : 58 ms
[2024-05-29 20:17:22] [INFO ] Flatten gal took : 58 ms
[2024-05-29 20:17:22] [INFO ] Time to serialize gal into /tmp/CTLFireability17089224900362109546.gal : 41 ms
[2024-05-29 20:17:22] [INFO ] Time to serialize properties into /tmp/CTLFireability11243093055945983296.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/CTLFireability17089224900362109546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11243093055945983296.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97283e+06,10.7278,248800,2,8553,5,176734,6,0,1410,108864,0


Converting to forward existential form...Done !
original formula: (EG(!(E(EG((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))&&(p124==1))) U EX((((((p12==1)&...366
=> equivalent forward existential formula: [(EY((Init * EG(!(E(EG((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==...411
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...401
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-29 20:17:52] [INFO ] Flatten gal took : 56 ms
[2024-05-29 20:17:52] [INFO ] Applying decomposition
[2024-05-29 20:17:52] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12481729823732826545.txt' '-o' '/tmp/graph12481729823732826545.bin' '-w' '/tmp/graph12481729823732826545.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12481729823732826545.bin' '-l' '-1' '-v' '-w' '/tmp/graph12481729823732826545.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:17:53] [INFO ] Decomposing Gal with order
[2024-05-29 20:17:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:17:53] [INFO ] Removed a total of 9259 redundant transitions.
[2024-05-29 20:17:53] [INFO ] Flatten gal took : 320 ms
[2024-05-29 20:17:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 81 ms.
[2024-05-29 20:17:53] [INFO ] Time to serialize gal into /tmp/CTLFireability7676420500655341551.gal : 19 ms
[2024-05-29 20:17:53] [INFO ] Time to serialize properties into /tmp/CTLFireability8933150269453279723.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/CTLFireability7676420500655341551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8933150269453279723.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97283e+06,0.202657,10832,1845,26,8949,188,1489,6721,49,456,0


Converting to forward existential form...Done !
original formula: (EG(!(E(EG((((((i2.i0.u4.p12==1)&&(i3.i0.u15.p26==1))&&((i1.i0.u2.p40==1)&&(i3.i2.u19.p54==1)))&&(((i2.i1.u13.p68==1)&&(i3.i1.u17.p82==1)...609
=> equivalent forward existential formula: [(EY((Init * EG(!(E(EG((((((i2.i0.u4.p12==1)&&(i3.i0.u15.p26==1))&&((i1.i0.u2.p40==1)&&(i3.i2.u19.p54==1)))&&(((...654
Reverse transition relation is NOT exact ! Due to transitions t1106, t1108, t1110, t1112, t1114, t1116, t1118, t1120, t1122, u24.t3, u24.t4, i0.t41, i0.t31...508
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 0,0,1.3892,75768,1,0,200541,266,14585,239226,206,642,287372
FORMULA StigmergyElection-PT-09a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 1131/1131 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 76 transition count 1127
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 76 transition count 1127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 75 transition count 1125
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 75 transition count 1125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 74 transition count 1124
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 74 transition count 1124
Applied a total of 10 rules in 21 ms. Remains 74 /79 variables (removed 5) and now considering 1124/1131 (removed 7) transitions.
[2024-05-29 20:17:55] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
[2024-05-29 20:17:55] [INFO ] Invariant cache hit.
[2024-05-29 20:17:55] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-29 20:17:55] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
[2024-05-29 20:17:55] [INFO ] Invariant cache hit.
[2024-05-29 20:17:55] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:17:55] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
Running 1123 sub problems to find dead transitions.
[2024-05-29 20:17:55] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
[2024-05-29 20:17:55] [INFO ] Invariant cache hit.
[2024-05-29 20:17:55] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:18:17] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 3 ms to minimize.
[2024-05-29 20:18:17] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 1 ms to minimize.
[2024-05-29 20:18:17] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2024-05-29 20:18:17] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
[2024-05-29 20:18:17] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 1 ms to minimize.
[2024-05-29 20:18:18] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 1 ms to minimize.
[2024-05-29 20:18:18] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 0 ms to minimize.
[2024-05-29 20:18:18] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 1 ms to minimize.
[2024-05-29 20:18:18] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 0 ms to minimize.
[2024-05-29 20:18:18] [INFO ] Deduced a trap composed of 9 places in 217 ms of which 1 ms to minimize.
[2024-05-29 20:18:19] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
[2024-05-29 20:18:19] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2024-05-29 20:18:19] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2024-05-29 20:18:19] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2024-05-29 20:18:19] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2024-05-29 20:18:19] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2024-05-29 20:18:19] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2024-05-29 20:18:20] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 0 ms to minimize.
[2024-05-29 20:18:20] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 1 ms to minimize.
[2024-05-29 20:18:20] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:18:21] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 0 ms to minimize.
[2024-05-29 20:18:21] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2024-05-29 20:18:21] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2024-05-29 20:18:21] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-29 20:18:21] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:18:21] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-29 20:18:21] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 2 ms to minimize.
[2024-05-29 20:18:21] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 1 ms to minimize.
[2024-05-29 20:18:22] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 1 ms to minimize.
[2024-05-29 20:18:22] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2024-05-29 20:18:22] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-29 20:18:22] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-29 20:18:22] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:18:22] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 0 ms to minimize.
[2024-05-29 20:18:22] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 0 ms to minimize.
[2024-05-29 20:18:22] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:18:23] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2024-05-29 20:18:23] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 1 ms to minimize.
[2024-05-29 20:18:23] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 1 ms to minimize.
[2024-05-29 20:18:23] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:18:25] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 0 ms to minimize.
[2024-05-29 20:18:25] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-05-29 20:18:26] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2024-05-29 20:18:26] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2024-05-29 20:18:26] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 1 ms to minimize.
[2024-05-29 20:18:26] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-29 20:18:26] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-05-29 20:18:26] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-29 20:18:26] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-29 20:18:26] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:18:26] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2024-05-29 20:18:27] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2024-05-29 20:18:27] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 0 ms to minimize.
[2024-05-29 20:18:27] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 0 ms to minimize.
[2024-05-29 20:18:27] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 1 ms to minimize.
[2024-05-29 20:18:27] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 1 ms to minimize.
[2024-05-29 20:18:28] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 1 ms to minimize.
[2024-05-29 20:18:31] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:18:31] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:18:31] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:18:31] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2024-05-29 20:18:31] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:18:31] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-29 20:18:32] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:18:32] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2024-05-29 20:18:32] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-29 20:18:32] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-29 20:18:32] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:18:32] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-29 20:18:32] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-29 20:18:32] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-29 20:18:35] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:18:35] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:18:36] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2024-05-29 20:18:36] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2024-05-29 20:18:36] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:18:36] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2024-05-29 20:18:36] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2024-05-29 20:18:36] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:18:37] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:18:37] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-29 20:18:37] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-29 20:18:37] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-29 20:18:37] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-29 20:18:37] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:18:37] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2024-05-29 20:18:37] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-29 20:18:38] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 20:18:38] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 20:18:38] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:18:38] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2024-05-29 20:18:38] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:18:38] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:18:38] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-29 20:18:41] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 16/96 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 74/1188 variables, and 96 constraints, problems are : Problem set: 0 solved, 1123 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/74 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1123/91 constraints, Known Traps: 95/95 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 95/96 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:18:46] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2024-05-29 20:18:46] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2024-05-29 20:18:46] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-29 20:18:46] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:18:46] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:18:46] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:18:47] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 0 ms to minimize.
[2024-05-29 20:18:47] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:18:47] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:18:51] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:18:51] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2024-05-29 20:18:51] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2024-05-29 20:18:51] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 13/109 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:18:53] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-05-29 20:18:53] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:18:57] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-29 20:18:57] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:18:58] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:19:04] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:19:04] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 74/1188 variables, and 116 constraints, problems are : Problem set: 0 solved, 1123 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/74 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/91 constraints, Known Traps: 115/115 constraints]
After SMT, in 77044ms problems are : Problem set: 0 solved, 1123 unsolved
Search for dead transitions found 0 dead transitions in 77063ms
Starting structural reductions in LTL mode, iteration 1 : 74/79 places, 1124/1131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77824 ms. Remains : 74/79 places, 1124/1131 transitions.
[2024-05-29 20:19:12] [INFO ] Flatten gal took : 57 ms
[2024-05-29 20:19:12] [INFO ] Flatten gal took : 61 ms
[2024-05-29 20:19:13] [INFO ] Input system was already deterministic with 1124 transitions.
[2024-05-29 20:19:13] [INFO ] Flatten gal took : 56 ms
[2024-05-29 20:19:13] [INFO ] Flatten gal took : 57 ms
[2024-05-29 20:19:13] [INFO ] Time to serialize gal into /tmp/CTLFireability2299772025449974120.gal : 11 ms
[2024-05-29 20:19:13] [INFO ] Time to serialize properties into /tmp/CTLFireability11121511214895785165.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/CTLFireability2299772025449974120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11121511214895785165.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97283e+06,10.761,248276,2,8553,5,176734,6,0,1410,108864,0


Converting to forward existential form...Done !
original formula: EF(((EF((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))&&(p124==1))) * EX((((((p12==1)&&(p...358
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * (((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p110...416
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...401
Detected timeout of ITS tools.
[2024-05-29 20:19:43] [INFO ] Flatten gal took : 55 ms
[2024-05-29 20:19:43] [INFO ] Applying decomposition
[2024-05-29 20:19:43] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8916968270110494879.txt' '-o' '/tmp/graph8916968270110494879.bin' '-w' '/tmp/graph8916968270110494879.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8916968270110494879.bin' '-l' '-1' '-v' '-w' '/tmp/graph8916968270110494879.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:19:43] [INFO ] Decomposing Gal with order
[2024-05-29 20:19:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:19:43] [INFO ] Removed a total of 9251 redundant transitions.
[2024-05-29 20:19:43] [INFO ] Flatten gal took : 167 ms
[2024-05-29 20:19:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 61 ms.
[2024-05-29 20:19:44] [INFO ] Time to serialize gal into /tmp/CTLFireability8174994055160307788.gal : 16 ms
[2024-05-29 20:19:44] [INFO ] Time to serialize properties into /tmp/CTLFireability14612077222592325498.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/CTLFireability8174994055160307788.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14612077222592325498.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97283e+06,10.3869,215484,5698,25,206059,227,1344,1.59156e+06,42,819,0


Converting to forward existential form...Done !
original formula: EF(((EF((((((i3.u10.p12==1)&&(i3.u19.p26==1))&&((i3.u14.p40==1)&&(i3.u24.p54==1)))&&(((i3.u4.p68==1)&&(i3.u17.p82==1))&&((i3.u1.p96==1)&&...541
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * (((((i3.u10.p12==0)||(i3.u19.p26==0))||((i3.u14.p40==0)||(i3.u24.p54==0)))||(((i3.u4.p6...599
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t29, t33, t38, t43, t1106, t1108, t1110, t1112, t1114, t1116, t1118, t...447
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 1131/1131 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 78 transition count 1127
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 75 transition count 1127
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 6 place count 75 transition count 1110
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 40 place count 58 transition count 1110
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 55 transition count 1106
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 55 transition count 1106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 49 place count 55 transition count 1103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 49 place count 55 transition count 1101
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 53 transition count 1101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 52 transition count 1099
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 52 transition count 1099
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 59 place count 52 transition count 1095
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 71 place count 46 transition count 1089
Ensure Unique test removed 504 transitions
Reduce isomorphic transitions removed 504 transitions.
Iterating post reduction 4 with 504 rules applied. Total rules applied 575 place count 46 transition count 585
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 584 place count 46 transition count 576
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 602 place count 37 transition count 567
Applied a total of 602 rules in 366 ms. Remains 37 /79 variables (removed 42) and now considering 567/1131 (removed 564) transitions.
[2024-05-29 20:20:14] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
// Phase 1: matrix 557 rows 37 cols
[2024-05-29 20:20:14] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 20:20:14] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 20:20:14] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
[2024-05-29 20:20:14] [INFO ] Invariant cache hit.
[2024-05-29 20:20:14] [INFO ] State equation strengthened by 520 read => feed constraints.
[2024-05-29 20:20:14] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-29 20:20:14] [INFO ] Redundant transitions in 45 ms returned []
Running 558 sub problems to find dead transitions.
[2024-05-29 20:20:14] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
[2024-05-29 20:20:14] [INFO ] Invariant cache hit.
[2024-05-29 20:20:14] [INFO ] State equation strengthened by 520 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 9/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:20:23] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 20:20:23] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:20:23] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:20:23] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 20:20:23] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:20:23] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:20:23] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 20:20:23] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 20:20:23] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 20:20:23] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:20:23] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2024-05-29 20:20:23] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-29 20:20:23] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:20:23] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2024-05-29 20:20:23] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:20:24] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 20:20:24] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-29 20:20:24] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2024-05-29 20:20:24] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 20:20:24] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:20:24] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 20:20:24] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-29 20:20:24] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-29 20:20:24] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:20:24] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 20:20:24] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 20:20:24] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:20:24] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-29 20:20:25] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:20:25] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-29 20:20:25] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-29 20:20:25] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:20:25] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:20:25] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:20:25] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:20:25] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 20:20:25] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:20:25] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-29 20:20:25] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:20:25] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:20:26] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-29 20:20:26] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-29 20:20:26] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:20:26] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 20:20:26] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 20:20:26] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 20:20:26] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-29 20:20:29] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:20:29] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:20:29] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:20:29] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:20:29] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:20:29] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:20:31] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:20:31] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:20:31] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:20:31] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:20:32] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:20:32] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:20:32] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:20:32] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:20:32] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:20:33] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:20:33] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 20:20:33] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/37 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/37 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 11 (OVERLAPS) 556/593 variables, 37/120 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 519/639 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/594 variables, and 639 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 519/520 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 9/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (OVERLAPS) 556/593 variables, 37/120 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 519/639 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/593 variables, 558/1197 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/594 variables, and 1197 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 519/520 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 82/82 constraints]
After SMT, in 67007ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 67013ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/79 places, 567/1131 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67650 ms. Remains : 37/79 places, 567/1131 transitions.
[2024-05-29 20:21:21] [INFO ] Flatten gal took : 26 ms
[2024-05-29 20:21:21] [INFO ] Flatten gal took : 29 ms
[2024-05-29 20:21:21] [INFO ] Input system was already deterministic with 567 transitions.
[2024-05-29 20:21:21] [INFO ] Flatten gal took : 28 ms
[2024-05-29 20:21:22] [INFO ] Flatten gal took : 29 ms
[2024-05-29 20:21:22] [INFO ] Time to serialize gal into /tmp/CTLFireability1463149936283727263.gal : 6 ms
[2024-05-29 20:21:22] [INFO ] Time to serialize properties into /tmp/CTLFireability14256731016020882877.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/CTLFireability1463149936283727263.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14256731016020882877.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,1041,0.302253,18364,2,815,5,11024,6,0,706,5666,0


Converting to forward existential form...Done !
original formula: AF(((((A((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))&&(p124==1)) U (AG((((((p12==1)&&(...581
=> equivalent forward existential formula: [FwdG(Init,!(((((!((E(!((!(E(TRUE U !((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p...1357
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...332
(forward)formula 0,0,1.31008,31092,1,0,665,36583,1157,56,20895,24202,1161
FORMULA StigmergyElection-PT-09a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 1131/1131 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 76 transition count 1127
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 76 transition count 1127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 75 transition count 1125
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 75 transition count 1125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 74 transition count 1124
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 74 transition count 1124
Applied a total of 10 rules in 19 ms. Remains 74 /79 variables (removed 5) and now considering 1124/1131 (removed 7) transitions.
[2024-05-29 20:21:23] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
// Phase 1: matrix 1114 rows 74 cols
[2024-05-29 20:21:23] [INFO ] Computed 1 invariants in 10 ms
[2024-05-29 20:21:23] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 20:21:23] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
[2024-05-29 20:21:23] [INFO ] Invariant cache hit.
[2024-05-29 20:21:23] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:21:23] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Running 1123 sub problems to find dead transitions.
[2024-05-29 20:21:23] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
[2024-05-29 20:21:23] [INFO ] Invariant cache hit.
[2024-05-29 20:21:23] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:21:43] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2024-05-29 20:21:43] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
[2024-05-29 20:21:43] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 0 ms to minimize.
[2024-05-29 20:21:43] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 0 ms to minimize.
[2024-05-29 20:21:43] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
[2024-05-29 20:21:43] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2024-05-29 20:21:44] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2024-05-29 20:21:44] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 1 ms to minimize.
[2024-05-29 20:21:44] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 1 ms to minimize.
[2024-05-29 20:21:44] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 0 ms to minimize.
[2024-05-29 20:21:44] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2024-05-29 20:21:44] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 1 ms to minimize.
[2024-05-29 20:21:45] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2024-05-29 20:21:45] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2024-05-29 20:21:45] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-05-29 20:21:45] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2024-05-29 20:21:45] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-05-29 20:21:45] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 1 ms to minimize.
[2024-05-29 20:21:46] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 1 ms to minimize.
[2024-05-29 20:21:46] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:21:46] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2024-05-29 20:21:46] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2024-05-29 20:21:46] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2024-05-29 20:21:46] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 20:21:47] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:21:47] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:21:47] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 0 ms to minimize.
[2024-05-29 20:21:47] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2024-05-29 20:21:47] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-05-29 20:21:47] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2024-05-29 20:21:47] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-29 20:21:47] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:21:47] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:21:48] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 1 ms to minimize.
[2024-05-29 20:21:48] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2024-05-29 20:21:48] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 0 ms to minimize.
[2024-05-29 20:21:48] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-29 20:21:48] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 1 ms to minimize.
[2024-05-29 20:21:48] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2024-05-29 20:21:48] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:21:51] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2024-05-29 20:21:51] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-29 20:21:51] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2024-05-29 20:21:51] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2024-05-29 20:21:51] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2024-05-29 20:21:51] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-29 20:21:51] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 0 ms to minimize.
[2024-05-29 20:21:51] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-29 20:21:51] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-29 20:21:52] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:21:52] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 0 ms to minimize.
[2024-05-29 20:21:52] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2024-05-29 20:21:52] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 1 ms to minimize.
[2024-05-29 20:21:52] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 2 ms to minimize.
[2024-05-29 20:21:52] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2024-05-29 20:21:53] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2024-05-29 20:21:53] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2024-05-29 20:21:56] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:21:56] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:21:56] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:21:56] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 0 ms to minimize.
[2024-05-29 20:21:56] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-29 20:21:56] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-29 20:21:56] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-29 20:21:57] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 0 ms to minimize.
[2024-05-29 20:21:57] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-29 20:21:57] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-29 20:21:57] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:21:57] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-29 20:21:57] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-29 20:21:57] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2024-05-29 20:22:00] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-29 20:22:00] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:22:01] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2024-05-29 20:22:01] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-29 20:22:01] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-29 20:22:01] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2024-05-29 20:22:01] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-29 20:22:01] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:22:01] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 20:22:02] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-29 20:22:02] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-29 20:22:02] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-29 20:22:02] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-29 20:22:02] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 20:22:02] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2024-05-29 20:22:02] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2024-05-29 20:22:02] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 20:22:02] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:22:03] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:22:03] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-29 20:22:03] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:22:03] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-29 20:22:03] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-29 20:22:06] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 16/96 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 74/1188 variables, and 96 constraints, problems are : Problem set: 0 solved, 1123 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/74 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1123/91 constraints, Known Traps: 95/95 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 95/96 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:22:12] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-29 20:22:12] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-29 20:22:12] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-29 20:22:12] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 20:22:12] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:22:12] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:22:13] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2024-05-29 20:22:13] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:22:13] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:22:17] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:22:18] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2024-05-29 20:22:18] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-29 20:22:18] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 13/109 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:22:19] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:22:19] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-29 20:22:23] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-05-29 20:22:24] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:22:25] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:22:30] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 20:22:30] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 74/1188 variables, and 116 constraints, problems are : Problem set: 0 solved, 1123 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/74 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/91 constraints, Known Traps: 115/115 constraints]
After SMT, in 75226ms problems are : Problem set: 0 solved, 1123 unsolved
Search for dead transitions found 0 dead transitions in 75240ms
Starting structural reductions in LTL mode, iteration 1 : 74/79 places, 1124/1131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75610 ms. Remains : 74/79 places, 1124/1131 transitions.
[2024-05-29 20:22:39] [INFO ] Flatten gal took : 50 ms
[2024-05-29 20:22:39] [INFO ] Flatten gal took : 61 ms
[2024-05-29 20:22:39] [INFO ] Input system was already deterministic with 1124 transitions.
[2024-05-29 20:22:39] [INFO ] Flatten gal took : 53 ms
[2024-05-29 20:22:39] [INFO ] Flatten gal took : 54 ms
[2024-05-29 20:22:39] [INFO ] Time to serialize gal into /tmp/CTLFireability18400130448627474328.gal : 11 ms
[2024-05-29 20:22:39] [INFO ] Time to serialize properties into /tmp/CTLFireability4908679264856464455.ctl : 13 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/CTLFireability18400130448627474328.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4908679264856464455.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97283e+06,10.828,249196,2,8553,5,176734,6,0,1410,108864,0


Converting to forward existential form...Done !
original formula: (EF((AX((EX((((((p12!=1)||(p26!=1))||((p40!=1)||(p54!=1)))||(((p68!=1)||(p82!=1))||((p96!=1)||(p110!=1))))||(p124!=1))) + EX((((((p12==1)...1047
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (!(EX(!((EX((((((p12!=1)||(p26!=1))||((p40!=1)||(p54!=1)))||(((p68!=1)||(p82!=1))||((p96!=1...1184
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...401
Detected timeout of ITS tools.
[2024-05-29 20:23:09] [INFO ] Flatten gal took : 55 ms
[2024-05-29 20:23:09] [INFO ] Applying decomposition
[2024-05-29 20:23:09] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10289577879190251586.txt' '-o' '/tmp/graph10289577879190251586.bin' '-w' '/tmp/graph10289577879190251586.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10289577879190251586.bin' '-l' '-1' '-v' '-w' '/tmp/graph10289577879190251586.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:23:09] [INFO ] Decomposing Gal with order
[2024-05-29 20:23:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:23:09] [INFO ] Removed a total of 9255 redundant transitions.
[2024-05-29 20:23:09] [INFO ] Flatten gal took : 145 ms
[2024-05-29 20:23:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 46 ms.
[2024-05-29 20:23:09] [INFO ] Time to serialize gal into /tmp/CTLFireability15276600953483159129.gal : 10 ms
[2024-05-29 20:23:09] [INFO ] Time to serialize properties into /tmp/CTLFireability12224237541296864984.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/CTLFireability15276600953483159129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12224237541296864984.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97283e+06,6.7153,158956,3792,26,89882,274,1333,1.41573e+06,44,1058,0


Converting to forward existential form...Done !
original formula: (EF((AX((EX((((((i2.u2.p12!=1)||(i2.u5.p26!=1))||((i2.u19.p40!=1)||(i2.u21.p54!=1)))||(((i2.u25.p68!=1)||(i2.u15.p82!=1))||((i2.u9.p96!=1...1587
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (!(EX(!((EX((((((i2.u2.p12!=1)||(i2.u5.p26!=1))||((i2.u19.p40!=1)||(i2.u21.p54!=1)))||(((i2...1724
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t13, t19, t24, t29, t43, t1106, t1108, t1110, t1112, t1114, t1116, t1118, t1120, t112...454
(forward)formula 0,1,29.8397,506840,1,0,283255,274,28933,3.631e+06,173,1058,4081386
FORMULA StigmergyElection-PT-09a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 1131/1131 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 76 transition count 1127
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 76 transition count 1127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 75 transition count 1125
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 75 transition count 1125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 74 transition count 1124
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 74 transition count 1124
Applied a total of 10 rules in 14 ms. Remains 74 /79 variables (removed 5) and now considering 1124/1131 (removed 7) transitions.
[2024-05-29 20:23:39] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
[2024-05-29 20:23:39] [INFO ] Invariant cache hit.
[2024-05-29 20:23:40] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 20:23:40] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
[2024-05-29 20:23:40] [INFO ] Invariant cache hit.
[2024-05-29 20:23:40] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:23:40] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 1123 sub problems to find dead transitions.
[2024-05-29 20:23:40] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
[2024-05-29 20:23:40] [INFO ] Invariant cache hit.
[2024-05-29 20:23:40] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:23:59] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 1 ms to minimize.
[2024-05-29 20:23:59] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 0 ms to minimize.
[2024-05-29 20:23:59] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 0 ms to minimize.
[2024-05-29 20:23:59] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 1 ms to minimize.
[2024-05-29 20:24:00] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2024-05-29 20:24:00] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2024-05-29 20:24:00] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 0 ms to minimize.
[2024-05-29 20:24:00] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 1 ms to minimize.
[2024-05-29 20:24:00] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 0 ms to minimize.
[2024-05-29 20:24:00] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 0 ms to minimize.
[2024-05-29 20:24:01] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 0 ms to minimize.
[2024-05-29 20:24:01] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2024-05-29 20:24:01] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2024-05-29 20:24:01] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 0 ms to minimize.
[2024-05-29 20:24:01] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2024-05-29 20:24:01] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2024-05-29 20:24:01] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-05-29 20:24:02] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 1 ms to minimize.
[2024-05-29 20:24:02] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 1 ms to minimize.
[2024-05-29 20:24:02] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:24:02] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 1 ms to minimize.
[2024-05-29 20:24:03] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2024-05-29 20:24:03] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2024-05-29 20:24:03] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:24:03] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 20:24:03] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:24:03] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2024-05-29 20:24:03] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2024-05-29 20:24:03] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2024-05-29 20:24:04] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-05-29 20:24:04] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 20:24:04] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:24:04] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:24:04] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 1 ms to minimize.
[2024-05-29 20:24:04] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 1 ms to minimize.
[2024-05-29 20:24:04] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2024-05-29 20:24:04] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-29 20:24:04] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 0 ms to minimize.
[2024-05-29 20:24:05] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 0 ms to minimize.
[2024-05-29 20:24:05] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:24:07] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2024-05-29 20:24:07] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-05-29 20:24:07] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2024-05-29 20:24:07] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2024-05-29 20:24:07] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2024-05-29 20:24:08] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-05-29 20:24:08] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 0 ms to minimize.
[2024-05-29 20:24:08] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 20:24:08] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-29 20:24:08] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-29 20:24:08] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 0 ms to minimize.
[2024-05-29 20:24:08] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2024-05-29 20:24:09] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 1 ms to minimize.
[2024-05-29 20:24:09] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2024-05-29 20:24:09] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2024-05-29 20:24:09] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2024-05-29 20:24:09] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2024-05-29 20:24:12] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:24:12] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:24:12] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:24:13] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2024-05-29 20:24:13] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-29 20:24:13] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 20:24:13] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:24:13] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-29 20:24:13] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 20:24:13] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 20:24:13] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:24:13] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-05-29 20:24:13] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-29 20:24:14] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2024-05-29 20:24:17] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-29 20:24:17] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-29 20:24:17] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-29 20:24:17] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2024-05-29 20:24:17] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-29 20:24:17] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2024-05-29 20:24:17] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-29 20:24:17] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:24:18] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-29 20:24:18] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-29 20:24:18] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2024-05-29 20:24:18] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2024-05-29 20:24:19] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-29 20:24:19] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:24:19] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2024-05-29 20:24:19] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-29 20:24:19] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 20:24:19] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:24:19] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:24:19] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2024-05-29 20:24:19] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:24:20] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:24:20] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-29 20:24:23] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 16/96 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 74/1188 variables, and 96 constraints, problems are : Problem set: 0 solved, 1123 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/74 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1123/91 constraints, Known Traps: 95/95 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 95/96 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:24:28] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-29 20:24:28] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-29 20:24:29] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2024-05-29 20:24:29] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:24:29] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:24:29] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:24:29] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 0 ms to minimize.
[2024-05-29 20:24:29] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 4 ms to minimize.
[2024-05-29 20:24:29] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:24:34] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:24:34] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2024-05-29 20:24:34] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 0 ms to minimize.
[2024-05-29 20:24:34] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 13/109 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:24:35] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:24:35] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-29 20:24:39] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:24:39] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:24:41] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:24:46] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-29 20:24:46] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 74/1188 variables, and 116 constraints, problems are : Problem set: 0 solved, 1123 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/74 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/91 constraints, Known Traps: 115/115 constraints]
After SMT, in 74917ms problems are : Problem set: 0 solved, 1123 unsolved
Search for dead transitions found 0 dead transitions in 74930ms
Starting structural reductions in LTL mode, iteration 1 : 74/79 places, 1124/1131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75276 ms. Remains : 74/79 places, 1124/1131 transitions.
[2024-05-29 20:24:55] [INFO ] Flatten gal took : 50 ms
[2024-05-29 20:24:55] [INFO ] Flatten gal took : 62 ms
[2024-05-29 20:24:55] [INFO ] Input system was already deterministic with 1124 transitions.
[2024-05-29 20:24:55] [INFO ] Flatten gal took : 53 ms
[2024-05-29 20:24:55] [INFO ] Flatten gal took : 52 ms
[2024-05-29 20:24:55] [INFO ] Time to serialize gal into /tmp/CTLFireability1003458454370164005.gal : 11 ms
[2024-05-29 20:24:55] [INFO ] Time to serialize properties into /tmp/CTLFireability8642120596818271749.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/CTLFireability1003458454370164005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8642120596818271749.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97283e+06,11.0763,248612,2,8553,5,176734,6,0,1410,108864,0


Converting to forward existential form...Done !
original formula: EF((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1)))) * (((p124==1) * ((((!(A(EX((((((p12==1)...1046
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,TRUE) * ((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p1...2340
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...401
(forward)formula 0,0,29.5329,537136,1,0,1225,530256,2259,96,46172,297649,2247
FORMULA StigmergyElection-PT-09a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 1131/1131 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 76 transition count 1127
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 76 transition count 1127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 75 transition count 1125
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 75 transition count 1125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 74 transition count 1124
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 74 transition count 1124
Applied a total of 10 rules in 15 ms. Remains 74 /79 variables (removed 5) and now considering 1124/1131 (removed 7) transitions.
[2024-05-29 20:25:25] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
[2024-05-29 20:25:25] [INFO ] Invariant cache hit.
[2024-05-29 20:25:25] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-29 20:25:25] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
[2024-05-29 20:25:25] [INFO ] Invariant cache hit.
[2024-05-29 20:25:25] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:25:26] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 889 ms to find 0 implicit places.
Running 1123 sub problems to find dead transitions.
[2024-05-29 20:25:26] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
[2024-05-29 20:25:26] [INFO ] Invariant cache hit.
[2024-05-29 20:25:26] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:25:45] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 1 ms to minimize.
[2024-05-29 20:25:45] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 1 ms to minimize.
[2024-05-29 20:25:45] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 0 ms to minimize.
[2024-05-29 20:25:45] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 1 ms to minimize.
[2024-05-29 20:25:45] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 0 ms to minimize.
[2024-05-29 20:25:46] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2024-05-29 20:25:46] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 0 ms to minimize.
[2024-05-29 20:25:46] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 1 ms to minimize.
[2024-05-29 20:25:46] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
[2024-05-29 20:25:46] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 1 ms to minimize.
[2024-05-29 20:25:47] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 0 ms to minimize.
[2024-05-29 20:25:47] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2024-05-29 20:25:47] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 1 ms to minimize.
[2024-05-29 20:25:47] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2024-05-29 20:25:47] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2024-05-29 20:25:47] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 1 ms to minimize.
[2024-05-29 20:25:47] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2024-05-29 20:25:48] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 1 ms to minimize.
[2024-05-29 20:25:48] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 0 ms to minimize.
[2024-05-29 20:25:48] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:25:48] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2024-05-29 20:25:49] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2024-05-29 20:25:49] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2024-05-29 20:25:49] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2024-05-29 20:25:49] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 20:25:49] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-29 20:25:49] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 0 ms to minimize.
[2024-05-29 20:25:49] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2024-05-29 20:25:49] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2024-05-29 20:25:50] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-05-29 20:25:50] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 20:25:50] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:25:50] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:25:50] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 1 ms to minimize.
[2024-05-29 20:25:50] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2024-05-29 20:25:50] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2024-05-29 20:25:50] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2024-05-29 20:25:51] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 0 ms to minimize.
[2024-05-29 20:25:51] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 1 ms to minimize.
[2024-05-29 20:25:51] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:25:53] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2024-05-29 20:25:53] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-05-29 20:25:53] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2024-05-29 20:25:54] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2024-05-29 20:25:54] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2024-05-29 20:25:54] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-29 20:25:54] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 0 ms to minimize.
[2024-05-29 20:25:54] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:25:54] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-29 20:25:54] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:25:54] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 0 ms to minimize.
[2024-05-29 20:25:55] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2024-05-29 20:25:55] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 0 ms to minimize.
[2024-05-29 20:25:55] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 1 ms to minimize.
[2024-05-29 20:25:55] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 1 ms to minimize.
[2024-05-29 20:25:55] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 0 ms to minimize.
[2024-05-29 20:25:56] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2024-05-29 20:25:59] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-29 20:25:59] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-29 20:25:59] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:25:59] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2024-05-29 20:25:59] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-29 20:25:59] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-29 20:25:59] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:25:59] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-05-29 20:26:00] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-29 20:26:00] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-29 20:26:00] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:26:00] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-29 20:26:00] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-29 20:26:00] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-29 20:26:03] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:26:03] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-29 20:26:03] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2024-05-29 20:26:04] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2024-05-29 20:26:04] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-29 20:26:04] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2024-05-29 20:26:04] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2024-05-29 20:26:04] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:26:04] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-29 20:26:05] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2024-05-29 20:26:05] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2024-05-29 20:26:05] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2024-05-29 20:26:05] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-29 20:26:05] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:26:05] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 0 ms to minimize.
[2024-05-29 20:26:05] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2024-05-29 20:26:06] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2024-05-29 20:26:06] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:26:06] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 20:26:06] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-29 20:26:06] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2024-05-29 20:26:06] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:26:06] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-29 20:26:09] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 16/96 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 74/1188 variables, and 96 constraints, problems are : Problem set: 0 solved, 1123 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/74 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1123/91 constraints, Known Traps: 95/95 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 95/96 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:26:14] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-29 20:26:14] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2024-05-29 20:26:14] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-29 20:26:14] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-29 20:26:15] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-29 20:26:15] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:26:15] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 0 ms to minimize.
[2024-05-29 20:26:15] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:26:15] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:26:20] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-29 20:26:20] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
[2024-05-29 20:26:20] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2024-05-29 20:26:20] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 13/109 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:26:21] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:26:21] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-29 20:26:25] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-05-29 20:26:26] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:26:27] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:26:32] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:26:32] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 74/1188 variables, and 116 constraints, problems are : Problem set: 0 solved, 1123 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/74 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/91 constraints, Known Traps: 115/115 constraints]
After SMT, in 74823ms problems are : Problem set: 0 solved, 1123 unsolved
Search for dead transitions found 0 dead transitions in 74833ms
Starting structural reductions in LTL mode, iteration 1 : 74/79 places, 1124/1131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75746 ms. Remains : 74/79 places, 1124/1131 transitions.
[2024-05-29 20:26:41] [INFO ] Flatten gal took : 54 ms
[2024-05-29 20:26:41] [INFO ] Flatten gal took : 59 ms
[2024-05-29 20:26:41] [INFO ] Input system was already deterministic with 1124 transitions.
[2024-05-29 20:26:41] [INFO ] Flatten gal took : 57 ms
[2024-05-29 20:26:41] [INFO ] Flatten gal took : 59 ms
[2024-05-29 20:26:41] [INFO ] Time to serialize gal into /tmp/CTLFireability3736095342898384074.gal : 12 ms
[2024-05-29 20:26:41] [INFO ] Time to serialize properties into /tmp/CTLFireability6766698192367103749.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/CTLFireability3736095342898384074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6766698192367103749.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97283e+06,10.8479,248540,2,8553,5,176734,6,0,1410,108864,0


Converting to forward existential form...Done !
original formula: AG(AF(EX(TRUE)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...401
(forward)formula 0,1,27.4451,487864,1,0,1242,600631,2258,97,45934,396815,2263
FORMULA StigmergyElection-PT-09a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 1131/1131 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 78 transition count 1127
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 75 transition count 1127
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 6 place count 75 transition count 1110
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 40 place count 58 transition count 1110
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 55 transition count 1106
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 55 transition count 1106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 49 place count 55 transition count 1103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 49 place count 55 transition count 1101
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 53 transition count 1101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 52 transition count 1099
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 52 transition count 1099
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 59 place count 52 transition count 1095
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 71 place count 46 transition count 1089
Ensure Unique test removed 504 transitions
Reduce isomorphic transitions removed 504 transitions.
Iterating post reduction 4 with 504 rules applied. Total rules applied 575 place count 46 transition count 585
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 584 place count 46 transition count 576
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 602 place count 37 transition count 567
Applied a total of 602 rules in 592 ms. Remains 37 /79 variables (removed 42) and now considering 567/1131 (removed 564) transitions.
[2024-05-29 20:27:09] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
// Phase 1: matrix 557 rows 37 cols
[2024-05-29 20:27:09] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 20:27:09] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 20:27:09] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
[2024-05-29 20:27:09] [INFO ] Invariant cache hit.
[2024-05-29 20:27:10] [INFO ] State equation strengthened by 520 read => feed constraints.
[2024-05-29 20:27:10] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-29 20:27:10] [INFO ] Redundant transitions in 20 ms returned []
Running 558 sub problems to find dead transitions.
[2024-05-29 20:27:10] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
[2024-05-29 20:27:10] [INFO ] Invariant cache hit.
[2024-05-29 20:27:10] [INFO ] State equation strengthened by 520 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 9/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:27:17] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 20:27:17] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-29 20:27:17] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 20:27:17] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-29 20:27:17] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 20:27:17] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:27:17] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:27:17] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 20:27:18] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:27:18] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:27:18] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 20:27:18] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-29 20:27:18] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-29 20:27:18] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-29 20:27:18] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:27:18] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:27:18] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:27:18] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:27:18] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 20:27:18] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:27:19] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:27:19] [INFO ] Deduced a trap composed of 5 places in 543 ms of which 0 ms to minimize.
[2024-05-29 20:27:19] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:27:19] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:27:19] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:27:19] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 20:27:19] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:27:19] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-29 20:27:19] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 20:27:19] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:27:19] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:27:21] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 20:27:21] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-29 20:27:21] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:27:21] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-29 20:27:21] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:27:21] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 20:27:21] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:27:22] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-29 20:27:22] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:27:22] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 20:27:24] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-29 20:27:24] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:27:24] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 20:27:24] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 20:27:24] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:27:25] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:27:26] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 20:27:26] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-29 20:27:26] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:27:27] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:27:27] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 20:27:27] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:27:27] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 20:27:27] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:27:28] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:27:28] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:27:28] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/37 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/37 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 11 (OVERLAPS) 556/593 variables, 37/120 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 519/639 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/594 variables, and 639 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 519/520 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 9/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (OVERLAPS) 556/593 variables, 37/120 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 519/639 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/593 variables, 558/1197 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/594 variables, and 1197 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 519/520 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 82/82 constraints]
After SMT, in 66225ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 66231ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/79 places, 567/1131 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67060 ms. Remains : 37/79 places, 567/1131 transitions.
[2024-05-29 20:28:16] [INFO ] Flatten gal took : 26 ms
[2024-05-29 20:28:16] [INFO ] Flatten gal took : 26 ms
[2024-05-29 20:28:16] [INFO ] Input system was already deterministic with 567 transitions.
RANDOM walk for 36 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
FORMULA StigmergyElection-PT-09a-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 20:28:16] [INFO ] Flatten gal took : 28 ms
[2024-05-29 20:28:16] [INFO ] Flatten gal took : 26 ms
[2024-05-29 20:28:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4056429453959229281.gal : 5 ms
[2024-05-29 20:28:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2734932821237834052.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4056429453959229281.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2734932821237834052.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 1131/1131 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 77 transition count 1128
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 77 transition count 1128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 76 transition count 1126
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 76 transition count 1126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 75 transition count 1125
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 75 transition count 1125
Applied a total of 8 rules in 11 ms. Remains 75 /79 variables (removed 4) and now considering 1125/1131 (removed 6) transitions.
[2024-05-29 20:28:16] [INFO ] Flow matrix only has 1115 transitions (discarded 10 similar events)
// Phase 1: matrix 1115 rows 75 cols
[2024-05-29 20:28:16] [INFO ] Computed 1 invariants in 5 ms
[2024-05-29 20:28:16] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 20:28:16] [INFO ] Flow matrix only has 1115 transitions (discarded 10 similar events)
[2024-05-29 20:28:16] [INFO ] Invariant cache hit.
[2024-05-29 20:28:16] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:28:16] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 1124 sub problems to find dead transitions.
[2024-05-29 20:28:16] [INFO ] Flow matrix only has 1115 transitions (discarded 10 similar events)
[2024-05-29 20:28:16] [INFO ] Invariant cache hit.
[2024-05-29 20:28:16] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1124 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1124 unsolved
[2024-05-29 20:28:36] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
[2024-05-29 20:28:36] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 0 ms to minimize.
[2024-05-29 20:28:36] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
[2024-05-29 20:28:36] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2024-05-29 20:28:36] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 1 ms to minimize.
[2024-05-29 20:28:36] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2024-05-29 20:28:37] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 1 ms to minimize.
[2024-05-29 20:28:37] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 0 ms to minimize.
[2024-05-29 20:28:37] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
[2024-05-29 20:28:37] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 1 ms to minimize.
[2024-05-29 20:28:37] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2024-05-29 20:28:38] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:28:38] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2024-05-29 20:28:38] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2024-05-29 20:28:38] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 2 ms to minimize.
[2024-05-29 20:28:38] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-05-29 20:28:38] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2024-05-29 20:28:38] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-29 20:28:38] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-29 20:28:39] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1124 unsolved
[2024-05-29 20:28:39] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 1 ms to minimize.
[2024-05-29 20:28:39] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 1 ms to minimize.
[2024-05-29 20:28:39] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 1 ms to minimize.
[2024-05-29 20:28:39] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2024-05-29 20:28:40] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2024-05-29 20:28:40] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2024-05-29 20:28:40] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2024-05-29 20:28:40] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2024-05-29 20:28:40] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-29 20:28:40] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-29 20:28:40] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2024-05-29 20:28:40] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-29 20:28:40] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2024-05-29 20:28:41] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2024-05-29 20:28:41] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2024-05-29 20:28:41] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:28:41] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-29 20:28:41] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:28:41] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-29 20:28:41] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1124 unsolved
[2024-05-29 20:28:44] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2024-05-29 20:28:44] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2024-05-29 20:28:44] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-29 20:28:44] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-29 20:28:44] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-29 20:28:44] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 1 ms to minimize.
[2024-05-29 20:28:44] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 0 ms to minimize.
[2024-05-29 20:28:44] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2024-05-29 20:28:45] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 0 ms to minimize.
[2024-05-29 20:28:45] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2024-05-29 20:28:45] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 1 ms to minimize.
[2024-05-29 20:28:45] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-05-29 20:28:45] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2024-05-29 20:28:45] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-29 20:28:45] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2024-05-29 20:28:45] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-29 20:28:46] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2024-05-29 20:28:46] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 0 ms to minimize.
[2024-05-29 20:28:46] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
[2024-05-29 20:28:46] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1124 unsolved
[2024-05-29 20:28:47] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2024-05-29 20:28:47] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-29 20:28:47] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-29 20:28:47] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 20:28:47] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 0 ms to minimize.
[2024-05-29 20:28:47] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 1 ms to minimize.
[2024-05-29 20:28:47] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 0 ms to minimize.
[2024-05-29 20:28:48] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
[2024-05-29 20:28:48] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2024-05-29 20:28:48] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-29 20:28:48] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2024-05-29 20:28:48] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-29 20:28:48] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 0 ms to minimize.
[2024-05-29 20:28:49] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
[2024-05-29 20:28:49] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 0 ms to minimize.
[2024-05-29 20:28:49] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2024-05-29 20:28:49] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2024-05-29 20:28:49] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-29 20:28:49] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2024-05-29 20:28:49] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1124 unsolved
[2024-05-29 20:28:50] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2024-05-29 20:28:50] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-29 20:28:50] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 1 ms to minimize.
[2024-05-29 20:28:50] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 0 ms to minimize.
[2024-05-29 20:28:50] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
[2024-05-29 20:28:50] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-05-29 20:28:50] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2024-05-29 20:28:50] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-29 20:28:51] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 1 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1124 unsolved
[2024-05-29 20:28:57] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:29:01] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1124 unsolved
[2024-05-29 20:29:01] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 0 ms to minimize.
[2024-05-29 20:29:01] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 0 ms to minimize.
SMT process timed out in 45003ms, After SMT, problems are : Problem set: 0 solved, 1124 unsolved
Search for dead transitions found 0 dead transitions in 45015ms
Starting structural reductions in LTL mode, iteration 1 : 75/79 places, 1125/1131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45366 ms. Remains : 75/79 places, 1125/1131 transitions.
[2024-05-29 20:29:01] [INFO ] Flatten gal took : 49 ms
[2024-05-29 20:29:02] [INFO ] Flatten gal took : 52 ms
[2024-05-29 20:29:02] [INFO ] Input system was already deterministic with 1125 transitions.
[2024-05-29 20:29:02] [INFO ] Flatten gal took : 52 ms
[2024-05-29 20:29:02] [INFO ] Flatten gal took : 53 ms
[2024-05-29 20:29:02] [INFO ] Time to serialize gal into /tmp/CTLFireability3609171548417883589.gal : 10 ms
[2024-05-29 20:29:02] [INFO ] Time to serialize properties into /tmp/CTLFireability15582275336238390217.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/CTLFireability3609171548417883589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15582275336238390217.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,2.03836e+06,11.2262,261280,2,9532,5,215160,6,0,1415,130455,0


Converting to forward existential form...Done !
original formula: EX(EG((((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p110==0))))||((p124==0)||(((((p45==1)&&(p12==1))...254
=> equivalent forward existential formula: [FwdG(EY(Init),(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p110==0))))||(...297
Hit Full ! (commute/partial/dont) 64/0/1061
(forward)formula 0,0,26.8902,475060,1,0,27,598418,19,2,35034,253679,27
FORMULA StigmergyElection-PT-09a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 1131/1131 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 78 transition count 1127
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 75 transition count 1127
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 6 place count 75 transition count 1110
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 40 place count 58 transition count 1110
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 55 transition count 1106
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 55 transition count 1106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 49 place count 55 transition count 1103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 49 place count 55 transition count 1101
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 53 transition count 1101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 52 transition count 1099
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 52 transition count 1099
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 59 place count 52 transition count 1095
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 71 place count 46 transition count 1089
Ensure Unique test removed 504 transitions
Reduce isomorphic transitions removed 504 transitions.
Iterating post reduction 4 with 504 rules applied. Total rules applied 575 place count 46 transition count 585
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 584 place count 46 transition count 576
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 602 place count 37 transition count 567
Applied a total of 602 rules in 165 ms. Remains 37 /79 variables (removed 42) and now considering 567/1131 (removed 564) transitions.
[2024-05-29 20:29:29] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
// Phase 1: matrix 557 rows 37 cols
[2024-05-29 20:29:29] [INFO ] Computed 1 invariants in 5 ms
[2024-05-29 20:29:29] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-29 20:29:29] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
[2024-05-29 20:29:29] [INFO ] Invariant cache hit.
[2024-05-29 20:29:29] [INFO ] State equation strengthened by 520 read => feed constraints.
[2024-05-29 20:29:29] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-29 20:29:29] [INFO ] Redundant transitions in 18 ms returned []
Running 558 sub problems to find dead transitions.
[2024-05-29 20:29:29] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
[2024-05-29 20:29:29] [INFO ] Invariant cache hit.
[2024-05-29 20:29:29] [INFO ] State equation strengthened by 520 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 9/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:29:37] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 20:29:37] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 20:29:37] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:29:37] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:29:37] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:29:37] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 20:29:38] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:29:38] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 20:29:38] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:29:38] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 20:29:38] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-29 20:29:38] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 20:29:38] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 20:29:38] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-29 20:29:38] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:29:38] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:29:38] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:29:38] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:29:38] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 20:29:39] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:29:39] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 20:29:39] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:29:39] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:29:39] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 20:29:39] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 20:29:39] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 20:29:39] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:29:39] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
[2024-05-29 20:29:39] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:29:39] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:29:39] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 20:29:39] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:29:39] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:29:39] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:29:39] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:29:39] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-29 20:29:39] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:29:40] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-29 20:29:40] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:29:40] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:29:41] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-29 20:29:41] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-29 20:29:41] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:29:41] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 12 ms to minimize.
[2024-05-29 20:29:41] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:29:42] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:29:42] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:29:43] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:29:43] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:29:43] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:29:43] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-29 20:29:43] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:29:43] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 20:29:43] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:29:43] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:29:43] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-29 20:29:43] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-29 20:29:43] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 20:29:44] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:29:44] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 20:29:44] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:29:44] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:29:44] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 20:29:44] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:29:44] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:29:44] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:29:44] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:29:44] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:29:44] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 20:29:44] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:29:46] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 20:29:46] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:29:46] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:29:46] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:29:47] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 20:29:47] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:29:47] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:29:47] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 20:29:47] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:29:49] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:29:49] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:29:49] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/37 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/37 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 11 (OVERLAPS) 556/593 variables, 37/120 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 519/639 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/594 variables, and 639 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 519/520 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 9/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (OVERLAPS) 556/593 variables, 37/120 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 519/639 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/593 variables, 558/1197 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/594 variables, and 1197 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 519/520 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 82/82 constraints]
After SMT, in 66666ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 66671ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/79 places, 567/1131 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67059 ms. Remains : 37/79 places, 567/1131 transitions.
[2024-05-29 20:30:36] [INFO ] Flatten gal took : 25 ms
[2024-05-29 20:30:36] [INFO ] Flatten gal took : 26 ms
[2024-05-29 20:30:36] [INFO ] Input system was already deterministic with 567 transitions.
[2024-05-29 20:30:36] [INFO ] Flatten gal took : 26 ms
[2024-05-29 20:30:36] [INFO ] Flatten gal took : 26 ms
[2024-05-29 20:30:36] [INFO ] Time to serialize gal into /tmp/CTLFireability11670888006054251649.gal : 6 ms
[2024-05-29 20:30:36] [INFO ] Time to serialize properties into /tmp/CTLFireability6940171886908371600.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/CTLFireability11670888006054251649.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6940171886908371600.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,1041,0.308249,18364,2,815,5,11024,6,0,706,5666,0


Converting to forward existential form...Done !
original formula: AG(EF((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))&&(p124==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&...192
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...332
(forward)formula 0,0,1.43644,38220,1,0,673,49178,1144,69,20741,32313,1176
FORMULA StigmergyElection-PT-09a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 1131/1131 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 76 transition count 1127
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 76 transition count 1127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 75 transition count 1125
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 75 transition count 1125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 74 transition count 1124
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 74 transition count 1124
Applied a total of 10 rules in 21 ms. Remains 74 /79 variables (removed 5) and now considering 1124/1131 (removed 7) transitions.
[2024-05-29 20:30:38] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
// Phase 1: matrix 1114 rows 74 cols
[2024-05-29 20:30:38] [INFO ] Computed 1 invariants in 9 ms
[2024-05-29 20:30:38] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 20:30:38] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
[2024-05-29 20:30:38] [INFO ] Invariant cache hit.
[2024-05-29 20:30:38] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:30:38] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 1123 sub problems to find dead transitions.
[2024-05-29 20:30:38] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
[2024-05-29 20:30:38] [INFO ] Invariant cache hit.
[2024-05-29 20:30:38] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:30:57] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 0 ms to minimize.
[2024-05-29 20:30:57] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 1 ms to minimize.
[2024-05-29 20:30:58] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 0 ms to minimize.
[2024-05-29 20:30:58] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 0 ms to minimize.
[2024-05-29 20:30:58] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 0 ms to minimize.
[2024-05-29 20:30:58] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 0 ms to minimize.
[2024-05-29 20:30:58] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 0 ms to minimize.
[2024-05-29 20:30:58] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 1 ms to minimize.
[2024-05-29 20:30:59] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 0 ms to minimize.
[2024-05-29 20:30:59] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 0 ms to minimize.
[2024-05-29 20:30:59] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2024-05-29 20:30:59] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
[2024-05-29 20:30:59] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 1 ms to minimize.
[2024-05-29 20:31:00] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2024-05-29 20:31:00] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2024-05-29 20:31:00] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2024-05-29 20:31:00] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2024-05-29 20:31:00] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 0 ms to minimize.
[2024-05-29 20:31:00] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 1 ms to minimize.
[2024-05-29 20:31:01] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:31:01] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 0 ms to minimize.
[2024-05-29 20:31:01] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 0 ms to minimize.
[2024-05-29 20:31:01] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2024-05-29 20:31:01] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-29 20:31:01] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:31:01] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:31:02] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 1 ms to minimize.
[2024-05-29 20:31:02] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2024-05-29 20:31:02] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2024-05-29 20:31:02] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-05-29 20:31:02] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-29 20:31:02] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-29 20:31:02] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:31:02] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2024-05-29 20:31:03] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2024-05-29 20:31:03] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 0 ms to minimize.
[2024-05-29 20:31:03] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2024-05-29 20:31:03] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 1 ms to minimize.
[2024-05-29 20:31:03] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
[2024-05-29 20:31:03] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:31:06] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 0 ms to minimize.
[2024-05-29 20:31:06] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-05-29 20:31:06] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
[2024-05-29 20:31:06] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2024-05-29 20:31:06] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2024-05-29 20:31:06] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2024-05-29 20:31:06] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2024-05-29 20:31:07] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-29 20:31:07] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2024-05-29 20:31:07] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-29 20:31:07] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2024-05-29 20:31:07] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 0 ms to minimize.
[2024-05-29 20:31:07] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 1 ms to minimize.
[2024-05-29 20:31:08] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 0 ms to minimize.
[2024-05-29 20:31:08] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2024-05-29 20:31:08] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2024-05-29 20:31:08] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2024-05-29 20:31:11] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:31:11] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:31:11] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:31:12] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 0 ms to minimize.
[2024-05-29 20:31:12] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2024-05-29 20:31:12] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2024-05-29 20:31:12] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 20:31:12] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-05-29 20:31:12] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-29 20:31:12] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-29 20:31:12] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:31:12] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-05-29 20:31:13] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-29 20:31:13] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2024-05-29 20:31:16] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:31:16] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:31:16] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2024-05-29 20:31:16] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-05-29 20:31:16] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:31:16] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2024-05-29 20:31:17] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-29 20:31:17] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:31:17] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:31:17] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-29 20:31:17] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2024-05-29 20:31:17] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 0 ms to minimize.
[2024-05-29 20:31:18] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-29 20:31:18] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:31:18] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2024-05-29 20:31:18] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2024-05-29 20:31:18] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-29 20:31:18] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:31:18] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:31:19] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 0 ms to minimize.
[2024-05-29 20:31:19] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-29 20:31:19] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:31:19] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-29 20:31:22] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 16/96 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 74/1188 variables, and 96 constraints, problems are : Problem set: 0 solved, 1123 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/74 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1123/91 constraints, Known Traps: 95/95 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 95/96 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:31:27] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2024-05-29 20:31:27] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2024-05-29 20:31:27] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-29 20:31:27] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:31:27] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2024-05-29 20:31:27] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 20:31:28] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2024-05-29 20:31:28] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:31:28] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:31:32] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:31:32] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-05-29 20:31:32] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 0 ms to minimize.
[2024-05-29 20:31:32] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 13/109 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:31:34] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-05-29 20:31:34] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2024-05-29 20:31:38] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-05-29 20:31:38] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:31:39] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 74/1188 variables, and 116 constraints, problems are : Problem set: 0 solved, 1123 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/74 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/91 constraints, Known Traps: 115/115 constraints]
After SMT, in 75157ms problems are : Problem set: 0 solved, 1123 unsolved
Search for dead transitions found 0 dead transitions in 75169ms
Starting structural reductions in LTL mode, iteration 1 : 74/79 places, 1124/1131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75532 ms. Remains : 74/79 places, 1124/1131 transitions.
[2024-05-29 20:31:53] [INFO ] Flatten gal took : 49 ms
[2024-05-29 20:31:53] [INFO ] Flatten gal took : 52 ms
[2024-05-29 20:31:53] [INFO ] Input system was already deterministic with 1124 transitions.
[2024-05-29 20:31:53] [INFO ] Flatten gal took : 51 ms
[2024-05-29 20:31:53] [INFO ] Flatten gal took : 52 ms
[2024-05-29 20:31:53] [INFO ] Time to serialize gal into /tmp/CTLFireability16732014974500290846.gal : 10 ms
[2024-05-29 20:31:53] [INFO ] Time to serialize properties into /tmp/CTLFireability15548747310307349672.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/CTLFireability16732014974500290846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15548747310307349672.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97283e+06,10.655,248472,2,8553,5,176734,6,0,1410,108864,0


Converting to forward existential form...Done !
original formula: ((EX(AG((AF((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))&&(p124==1))) + (((((p12==1)&&(...825
=> equivalent forward existential formula: ([(EY((FwdU((Init * (EX(!(E(TRUE U !((!(EG(!((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1...1541
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...401
Detected timeout of ITS tools.
[2024-05-29 20:32:24] [INFO ] Flatten gal took : 53 ms
[2024-05-29 20:32:24] [INFO ] Applying decomposition
[2024-05-29 20:32:24] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15519181067912577490.txt' '-o' '/tmp/graph15519181067912577490.bin' '-w' '/tmp/graph15519181067912577490.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15519181067912577490.bin' '-l' '-1' '-v' '-w' '/tmp/graph15519181067912577490.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:32:24] [INFO ] Decomposing Gal with order
[2024-05-29 20:32:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:32:24] [INFO ] Removed a total of 9254 redundant transitions.
[2024-05-29 20:32:24] [INFO ] Flatten gal took : 128 ms
[2024-05-29 20:32:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 56 ms.
[2024-05-29 20:32:24] [INFO ] Time to serialize gal into /tmp/CTLFireability13090722711822365302.gal : 7 ms
[2024-05-29 20:32:24] [INFO ] Time to serialize properties into /tmp/CTLFireability6717450585005432544.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/CTLFireability13090722711822365302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6717450585005432544.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97283e+06,1.28419,56324,2535,34,56505,351,3060,315024,54,985,0


Converting to forward existential form...Done !
original formula: ((EX(AG((AF((((((i3.i0.u2.p12==1)&&(i1.i0.u4.p26==1))&&((i1.i0.u8.p40==1)&&(i1.i0.u16.p54==1)))&&(((i1.i1.u14.p68==1)&&(i1.i1.u18.p82==1)...1427
=> equivalent forward existential formula: ([(EY((FwdU((Init * (EX(!(E(TRUE U !((!(EG(!((((((i3.i0.u2.p12==1)&&(i1.i0.u4.p26==1))&&((i1.i0.u8.p40==1)&&(i1....2573
Reverse transition relation is NOT exact ! Due to transitions t19, t24, t1106, t1108, t1110, t1112, t1114, t1116, t1118, t1120, t1122, i0.t41, i0.t31, i0.t...507
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
(forward)formula 0,0,7.58625,221588,1,0,327693,492,23851,1.37358e+06,220,1841,1039639
FORMULA StigmergyElection-PT-09a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 1131/1131 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 76 transition count 1127
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 76 transition count 1127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 75 transition count 1125
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 75 transition count 1125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 74 transition count 1124
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 74 transition count 1124
Applied a total of 10 rules in 25 ms. Remains 74 /79 variables (removed 5) and now considering 1124/1131 (removed 7) transitions.
[2024-05-29 20:32:32] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
[2024-05-29 20:32:32] [INFO ] Invariant cache hit.
[2024-05-29 20:32:32] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 20:32:32] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
[2024-05-29 20:32:32] [INFO ] Invariant cache hit.
[2024-05-29 20:32:32] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:32:32] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 1123 sub problems to find dead transitions.
[2024-05-29 20:32:32] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
[2024-05-29 20:32:32] [INFO ] Invariant cache hit.
[2024-05-29 20:32:32] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:32:51] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
[2024-05-29 20:32:51] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 1 ms to minimize.
[2024-05-29 20:32:51] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 0 ms to minimize.
[2024-05-29 20:32:52] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 0 ms to minimize.
[2024-05-29 20:32:52] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2024-05-29 20:32:52] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 0 ms to minimize.
[2024-05-29 20:32:52] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 1 ms to minimize.
[2024-05-29 20:32:52] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 1 ms to minimize.
[2024-05-29 20:32:53] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 0 ms to minimize.
[2024-05-29 20:32:53] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 0 ms to minimize.
[2024-05-29 20:32:53] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2024-05-29 20:32:53] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 0 ms to minimize.
[2024-05-29 20:32:53] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 0 ms to minimize.
[2024-05-29 20:32:53] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2024-05-29 20:32:53] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-05-29 20:32:54] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2024-05-29 20:32:54] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2024-05-29 20:32:54] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 1 ms to minimize.
[2024-05-29 20:32:54] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 1 ms to minimize.
[2024-05-29 20:32:54] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:32:55] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 1 ms to minimize.
[2024-05-29 20:32:55] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2024-05-29 20:32:55] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-29 20:32:55] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-29 20:32:55] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:32:55] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:32:56] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 0 ms to minimize.
[2024-05-29 20:32:56] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2024-05-29 20:32:56] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:32:56] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2024-05-29 20:32:56] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-29 20:32:56] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-29 20:32:56] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-29 20:32:56] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 1 ms to minimize.
[2024-05-29 20:32:57] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 0 ms to minimize.
[2024-05-29 20:32:57] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:32:57] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2024-05-29 20:32:57] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 1 ms to minimize.
[2024-05-29 20:32:57] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 0 ms to minimize.
[2024-05-29 20:32:57] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:33:00] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2024-05-29 20:33:00] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-05-29 20:33:00] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2024-05-29 20:33:00] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 0 ms to minimize.
[2024-05-29 20:33:00] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2024-05-29 20:33:01] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2024-05-29 20:33:01] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2024-05-29 20:33:01] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-29 20:33:01] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:33:01] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 20:33:01] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2024-05-29 20:33:01] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2024-05-29 20:33:01] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 1 ms to minimize.
[2024-05-29 20:33:02] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 0 ms to minimize.
[2024-05-29 20:33:02] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 0 ms to minimize.
[2024-05-29 20:33:02] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2024-05-29 20:33:02] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2024-05-29 20:33:05] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-29 20:33:05] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-29 20:33:05] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:33:06] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2024-05-29 20:33:06] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-29 20:33:06] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-29 20:33:06] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:33:06] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 0 ms to minimize.
[2024-05-29 20:33:06] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-29 20:33:06] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-29 20:33:06] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:33:06] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-29 20:33:07] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-29 20:33:07] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2024-05-29 20:33:10] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:33:10] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-29 20:33:10] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-29 20:33:10] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-05-29 20:33:10] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 20:33:10] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2024-05-29 20:33:10] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2024-05-29 20:33:11] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:33:11] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-29 20:33:11] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2024-05-29 20:33:11] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-05-29 20:33:11] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-05-29 20:33:12] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-29 20:33:12] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:33:12] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 0 ms to minimize.
[2024-05-29 20:33:12] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2024-05-29 20:33:12] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-29 20:33:12] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:33:12] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-29 20:33:12] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 0 ms to minimize.
[2024-05-29 20:33:13] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-29 20:33:13] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-29 20:33:13] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-29 20:33:16] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 16/96 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 74/1188 variables, and 96 constraints, problems are : Problem set: 0 solved, 1123 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/74 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1123/91 constraints, Known Traps: 95/95 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 95/96 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:33:20] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-29 20:33:20] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-05-29 20:33:21] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2024-05-29 20:33:21] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:33:21] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:33:21] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:33:21] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2024-05-29 20:33:21] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:33:21] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:33:26] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:33:26] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2024-05-29 20:33:26] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 0 ms to minimize.
[2024-05-29 20:33:26] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 13/109 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:33:28] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:33:28] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 20:33:32] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2024-05-29 20:33:32] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:33:33] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:33:38] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:33:38] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 74/1188 variables, and 116 constraints, problems are : Problem set: 0 solved, 1123 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/74 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/91 constraints, Known Traps: 115/115 constraints]
After SMT, in 74780ms problems are : Problem set: 0 solved, 1123 unsolved
Search for dead transitions found 0 dead transitions in 74794ms
Starting structural reductions in LTL mode, iteration 1 : 74/79 places, 1124/1131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75165 ms. Remains : 74/79 places, 1124/1131 transitions.
[2024-05-29 20:33:47] [INFO ] Flatten gal took : 51 ms
[2024-05-29 20:33:47] [INFO ] Flatten gal took : 54 ms
[2024-05-29 20:33:47] [INFO ] Input system was already deterministic with 1124 transitions.
[2024-05-29 20:33:47] [INFO ] Flatten gal took : 53 ms
[2024-05-29 20:33:47] [INFO ] Flatten gal took : 54 ms
[2024-05-29 20:33:47] [INFO ] Time to serialize gal into /tmp/CTLFireability7913273244878141728.gal : 10 ms
[2024-05-29 20:33:47] [INFO ] Time to serialize properties into /tmp/CTLFireability7407465372377669716.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/CTLFireability7913273244878141728.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7407465372377669716.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97283e+06,11.0027,248540,2,8553,5,176734,6,0,1410,108864,0


Converting to forward existential form...Done !
original formula: AF(AX((AX((((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p110==0))))||(p124==0))) * EG(((((((p12==1)&...471
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((!(EX(!((((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p...528
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...401
Detected timeout of ITS tools.
[2024-05-29 20:34:17] [INFO ] Flatten gal took : 53 ms
[2024-05-29 20:34:17] [INFO ] Applying decomposition
[2024-05-29 20:34:17] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12626879923773621505.txt' '-o' '/tmp/graph12626879923773621505.bin' '-w' '/tmp/graph12626879923773621505.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12626879923773621505.bin' '-l' '-1' '-v' '-w' '/tmp/graph12626879923773621505.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:34:18] [INFO ] Decomposing Gal with order
[2024-05-29 20:34:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:34:18] [INFO ] Removed a total of 9255 redundant transitions.
[2024-05-29 20:34:18] [INFO ] Flatten gal took : 121 ms
[2024-05-29 20:34:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 41 ms.
[2024-05-29 20:34:18] [INFO ] Time to serialize gal into /tmp/CTLFireability6316032193423331921.gal : 6 ms
[2024-05-29 20:34:18] [INFO ] Time to serialize properties into /tmp/CTLFireability6170328180415005670.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/CTLFireability6316032193423331921.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6170328180415005670.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97283e+06,7.46722,257436,6335,26,177661,209,1346,2.3449e+06,44,901,0


Converting to forward existential form...Done !
original formula: AF(AX((AX((((((i9.u12.p12==0)||(i9.u4.p26==0))||((i9.u26.p40==0)||(i9.u10.p54==0)))||(((i9.u14.p68==0)||(i9.u24.p82==0))||((i9.u19.p96==0...715
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((!(EX(!((((((i9.u12.p12==0)||(i9.u4.p26==0))||((i9.u26.p40==0)||(i9.u10.p54==0)))||(((i9.u14...772
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t14, t18, t23, t28, t33, t38, t44, t1106, t1108, t1110, t1112, t1114, t1116, t1118, t...447
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 1131/1131 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 77 transition count 1129
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 77 transition count 1129
Applied a total of 4 rules in 6 ms. Remains 77 /79 variables (removed 2) and now considering 1129/1131 (removed 2) transitions.
[2024-05-29 20:34:48] [INFO ] Flow matrix only has 1118 transitions (discarded 11 similar events)
// Phase 1: matrix 1118 rows 77 cols
[2024-05-29 20:34:48] [INFO ] Computed 1 invariants in 10 ms
[2024-05-29 20:34:48] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 20:34:48] [INFO ] Flow matrix only has 1118 transitions (discarded 11 similar events)
[2024-05-29 20:34:48] [INFO ] Invariant cache hit.
[2024-05-29 20:34:48] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:34:48] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 1128 sub problems to find dead transitions.
[2024-05-29 20:34:48] [INFO ] Flow matrix only has 1118 transitions (discarded 11 similar events)
[2024-05-29 20:34:48] [INFO ] Invariant cache hit.
[2024-05-29 20:34:48] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-05-29 20:35:07] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 0 ms to minimize.
[2024-05-29 20:35:07] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 1 ms to minimize.
[2024-05-29 20:35:08] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 1 ms to minimize.
[2024-05-29 20:35:08] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 0 ms to minimize.
[2024-05-29 20:35:08] [INFO ] Deduced a trap composed of 9 places in 258 ms of which 1 ms to minimize.
[2024-05-29 20:35:09] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 0 ms to minimize.
[2024-05-29 20:35:09] [INFO ] Deduced a trap composed of 12 places in 258 ms of which 1 ms to minimize.
[2024-05-29 20:35:09] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 0 ms to minimize.
[2024-05-29 20:35:09] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 1 ms to minimize.
[2024-05-29 20:35:10] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 1 ms to minimize.
[2024-05-29 20:35:10] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 1 ms to minimize.
[2024-05-29 20:35:10] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 1 ms to minimize.
[2024-05-29 20:35:10] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
[2024-05-29 20:35:10] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 0 ms to minimize.
[2024-05-29 20:35:11] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:35:11] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 1 ms to minimize.
[2024-05-29 20:35:11] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 1 ms to minimize.
[2024-05-29 20:35:11] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 1 ms to minimize.
[2024-05-29 20:35:11] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 1 ms to minimize.
[2024-05-29 20:35:12] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-05-29 20:35:12] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 1 ms to minimize.
[2024-05-29 20:35:12] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 0 ms to minimize.
[2024-05-29 20:35:12] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 1 ms to minimize.
[2024-05-29 20:35:13] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 0 ms to minimize.
[2024-05-29 20:35:13] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 0 ms to minimize.
[2024-05-29 20:35:13] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:35:13] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 0 ms to minimize.
[2024-05-29 20:35:13] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2024-05-29 20:35:13] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-29 20:35:13] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:35:14] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-29 20:35:14] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 1 ms to minimize.
[2024-05-29 20:35:14] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-29 20:35:14] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2024-05-29 20:35:14] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2024-05-29 20:35:14] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-05-29 20:35:14] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2024-05-29 20:35:15] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 0 ms to minimize.
[2024-05-29 20:35:15] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 0 ms to minimize.
[2024-05-29 20:35:15] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-05-29 20:35:17] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2024-05-29 20:35:17] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-05-29 20:35:17] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2024-05-29 20:35:18] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-29 20:35:18] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2024-05-29 20:35:18] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-29 20:35:18] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-29 20:35:18] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:35:18] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 20:35:18] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:35:18] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 20:35:18] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:35:18] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-29 20:35:18] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 20:35:18] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 20:35:19] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 20:35:19] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 0 ms to minimize.
[2024-05-29 20:35:19] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 1 ms to minimize.
[2024-05-29 20:35:19] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 1 ms to minimize.
[2024-05-29 20:35:19] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-05-29 20:35:20] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:35:20] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 1 ms to minimize.
[2024-05-29 20:35:20] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2024-05-29 20:35:20] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2024-05-29 20:35:20] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-29 20:35:20] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-29 20:35:21] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 0 ms to minimize.
[2024-05-29 20:35:21] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-29 20:35:21] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-29 20:35:21] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-29 20:35:21] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-29 20:35:21] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-29 20:35:21] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:35:21] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-29 20:35:21] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2024-05-29 20:35:22] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 0 ms to minimize.
[2024-05-29 20:35:22] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 0 ms to minimize.
[2024-05-29 20:35:22] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-29 20:35:22] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-29 20:35:22] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-05-29 20:35:22] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-29 20:35:22] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:35:23] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:35:23] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-05-29 20:35:23] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-29 20:35:23] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 20:35:23] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-29 20:35:23] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 20:35:23] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-29 20:35:23] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-29 20:35:23] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2024-05-29 20:35:23] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 0 ms to minimize.
[2024-05-29 20:35:23] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2024-05-29 20:35:24] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-29 20:35:24] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-29 20:35:24] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 20:35:24] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-29 20:35:27] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 18/99 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-05-29 20:35:30] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2024-05-29 20:35:30] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:35:30] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 77/1195 variables, and 102 constraints, problems are : Problem set: 0 solved, 1128 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/77 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1128/96 constraints, Known Traps: 101/101 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 101/102 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-05-29 20:35:36] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:35:37] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:35:37] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-29 20:35:37] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:35:37] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 20:35:37] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 0 ms to minimize.
[2024-05-29 20:35:37] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:35:37] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:35:41] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-29 20:35:41] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 0 ms to minimize.
[2024-05-29 20:35:42] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2024-05-29 20:35:42] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 12/114 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-05-29 20:35:43] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-29 20:35:44] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-05-29 20:35:57] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-05-29 20:36:03] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 0 ms to minimize.
SMT process timed out in 74755ms, After SMT, problems are : Problem set: 0 solved, 1128 unsolved
Search for dead transitions found 0 dead transitions in 74766ms
Starting structural reductions in LTL mode, iteration 1 : 77/79 places, 1129/1131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75103 ms. Remains : 77/79 places, 1129/1131 transitions.
[2024-05-29 20:36:03] [INFO ] Flatten gal took : 49 ms
[2024-05-29 20:36:03] [INFO ] Flatten gal took : 54 ms
[2024-05-29 20:36:03] [INFO ] Input system was already deterministic with 1129 transitions.
[2024-05-29 20:36:03] [INFO ] Flatten gal took : 52 ms
[2024-05-29 20:36:03] [INFO ] Flatten gal took : 53 ms
[2024-05-29 20:36:03] [INFO ] Time to serialize gal into /tmp/CTLFireability15650661899569570963.gal : 10 ms
[2024-05-29 20:36:03] [INFO ] Time to serialize properties into /tmp/CTLFireability4247773362274685433.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/CTLFireability15650661899569570963.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4247773362274685433.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,2.16943e+06,9.36481,217940,2,7020,5,163361,6,0,1426,96809,0


Converting to forward existential form...Done !
original formula: E((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))&&(p124==1)) U EF(EG(EX((p113==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1)...202
Hit Full ! (commute/partial/dont) 68/232/1061
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t14, t16, t17, t19, t21, t22, t24, t26, t27, t29, t31, t32,...451
Detected timeout of ITS tools.
[2024-05-29 20:36:33] [INFO ] Flatten gal took : 54 ms
[2024-05-29 20:36:33] [INFO ] Applying decomposition
[2024-05-29 20:36:33] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6882027220684391593.txt' '-o' '/tmp/graph6882027220684391593.bin' '-w' '/tmp/graph6882027220684391593.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6882027220684391593.bin' '-l' '-1' '-v' '-w' '/tmp/graph6882027220684391593.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:36:34] [INFO ] Decomposing Gal with order
[2024-05-29 20:36:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:36:34] [INFO ] Removed a total of 9252 redundant transitions.
[2024-05-29 20:36:34] [INFO ] Flatten gal took : 120 ms
[2024-05-29 20:36:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 41 ms.
[2024-05-29 20:36:34] [INFO ] Time to serialize gal into /tmp/CTLFireability17606905608287979804.gal : 7 ms
[2024-05-29 20:36:34] [INFO ] Time to serialize properties into /tmp/CTLFireability749781896642483650.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/CTLFireability17606905608287979804.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability749781896642483650.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,2.16943e+06,5.06256,185400,5494,34,148628,351,1361,1.45043e+06,58,1331,0


Converting to forward existential form...Done !
original formula: E((((((i1.u19.p12==1)&&(i1.u5.p26==1))&&((i1.u7.p40==1)&&(i1.u11.p54==1)))&&(((i1.u25.p68==1)&&(i1.u15.p82==1))&&((i1.u17.p96==1)&&(i1.u2...215
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,(((((i1.u19.p12==1)&&(i1.u5.p26==1))&&((i1.u7.p40==1)&&(i1.u11.p54==1)))&&(((i1.u25.p68==1)...266
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t17, t22, t26, t31, t41, t46, t1110, t1113, t1115, t1117, t1119, t1121, t1123, t...541
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,21.2205,586152,1,0,418429,537,28286,3.04054e+06,233,2227,6676739
FORMULA StigmergyElection-PT-09a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 1131/1131 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 76 transition count 1127
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 76 transition count 1127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 75 transition count 1125
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 75 transition count 1125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 74 transition count 1124
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 74 transition count 1124
Applied a total of 10 rules in 10 ms. Remains 74 /79 variables (removed 5) and now considering 1124/1131 (removed 7) transitions.
[2024-05-29 20:36:55] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
// Phase 1: matrix 1114 rows 74 cols
[2024-05-29 20:36:55] [INFO ] Computed 1 invariants in 11 ms
[2024-05-29 20:36:55] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 20:36:55] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
[2024-05-29 20:36:55] [INFO ] Invariant cache hit.
[2024-05-29 20:36:55] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:36:56] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 1123 sub problems to find dead transitions.
[2024-05-29 20:36:56] [INFO ] Flow matrix only has 1114 transitions (discarded 10 similar events)
[2024-05-29 20:36:56] [INFO ] Invariant cache hit.
[2024-05-29 20:36:56] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:37:14] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 0 ms to minimize.
[2024-05-29 20:37:15] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 1 ms to minimize.
[2024-05-29 20:37:15] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 1 ms to minimize.
[2024-05-29 20:37:15] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
[2024-05-29 20:37:15] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2024-05-29 20:37:15] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2024-05-29 20:37:16] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 1 ms to minimize.
[2024-05-29 20:37:16] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2024-05-29 20:37:16] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
[2024-05-29 20:37:16] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 0 ms to minimize.
[2024-05-29 20:37:16] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 1 ms to minimize.
[2024-05-29 20:37:16] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 0 ms to minimize.
[2024-05-29 20:37:17] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2024-05-29 20:37:17] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2024-05-29 20:37:17] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2024-05-29 20:37:17] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2024-05-29 20:37:17] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2024-05-29 20:37:17] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 1 ms to minimize.
[2024-05-29 20:37:18] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 0 ms to minimize.
[2024-05-29 20:37:18] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:37:18] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2024-05-29 20:37:18] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2024-05-29 20:37:18] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-29 20:37:18] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 20:37:18] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-29 20:37:19] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:37:19] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2024-05-29 20:37:19] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2024-05-29 20:37:19] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2024-05-29 20:37:19] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-29 20:37:19] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-29 20:37:19] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:37:19] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-29 20:37:20] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 1 ms to minimize.
[2024-05-29 20:37:20] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2024-05-29 20:37:20] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2024-05-29 20:37:20] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-29 20:37:20] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 0 ms to minimize.
[2024-05-29 20:37:20] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
[2024-05-29 20:37:20] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:37:23] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 0 ms to minimize.
[2024-05-29 20:37:23] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2024-05-29 20:37:23] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2024-05-29 20:37:23] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2024-05-29 20:37:23] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2024-05-29 20:37:23] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-29 20:37:23] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2024-05-29 20:37:23] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:37:24] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-29 20:37:24] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 20:37:24] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:37:24] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2024-05-29 20:37:24] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 0 ms to minimize.
[2024-05-29 20:37:24] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 0 ms to minimize.
[2024-05-29 20:37:25] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 0 ms to minimize.
[2024-05-29 20:37:25] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 0 ms to minimize.
[2024-05-29 20:37:25] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2024-05-29 20:37:28] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:37:28] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-29 20:37:28] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:37:28] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 0 ms to minimize.
[2024-05-29 20:37:28] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-29 20:37:29] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-29 20:37:29] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:37:29] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-29 20:37:29] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-29 20:37:29] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-29 20:37:29] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:37:29] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-29 20:37:29] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-29 20:37:29] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-29 20:37:32] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:37:32] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:37:33] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-05-29 20:37:33] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-29 20:37:33] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-29 20:37:33] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2024-05-29 20:37:33] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2024-05-29 20:37:33] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:37:33] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:37:34] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-29 20:37:34] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-29 20:37:34] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-05-29 20:37:34] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-29 20:37:34] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 20:37:34] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-05-29 20:37:34] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-05-29 20:37:34] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-29 20:37:34] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-29 20:37:35] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:37:35] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2024-05-29 20:37:35] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:37:35] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-29 20:37:35] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-29 20:37:38] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 16/96 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 74/1188 variables, and 96 constraints, problems are : Problem set: 0 solved, 1123 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/74 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1123/91 constraints, Known Traps: 95/95 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 95/96 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:37:44] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-05-29 20:37:44] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-29 20:37:44] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-29 20:37:44] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:37:44] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:37:44] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:37:45] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2024-05-29 20:37:45] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:37:45] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:37:49] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:37:49] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-05-29 20:37:50] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 0 ms to minimize.
[2024-05-29 20:37:50] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 13/109 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:37:51] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:37:51] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-29 20:37:55] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
[2024-05-29 20:37:55] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:37:56] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 20:38:02] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:38:02] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 74/1188 variables, and 116 constraints, problems are : Problem set: 0 solved, 1123 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/74 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/91 constraints, Known Traps: 115/115 constraints]
After SMT, in 74802ms problems are : Problem set: 0 solved, 1123 unsolved
Search for dead transitions found 0 dead transitions in 74815ms
Starting structural reductions in LTL mode, iteration 1 : 74/79 places, 1124/1131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75163 ms. Remains : 74/79 places, 1124/1131 transitions.
[2024-05-29 20:38:10] [INFO ] Flatten gal took : 49 ms
[2024-05-29 20:38:10] [INFO ] Flatten gal took : 53 ms
[2024-05-29 20:38:11] [INFO ] Input system was already deterministic with 1124 transitions.
[2024-05-29 20:38:11] [INFO ] Flatten gal took : 53 ms
[2024-05-29 20:38:11] [INFO ] Flatten gal took : 52 ms
[2024-05-29 20:38:11] [INFO ] Time to serialize gal into /tmp/CTLFireability15214041482605360940.gal : 10 ms
[2024-05-29 20:38:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4893705234320936621.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/CTLFireability15214041482605360940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4893705234320936621.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97283e+06,10.8177,249264,2,8553,5,176734,6,0,1410,108864,0


Converting to forward existential form...Done !
original formula: EF(EG(A(AF((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))&&(p124==1))) U (!(EX((((((p12==...370
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((E(!((!(EX((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96=...929
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...401
Detected timeout of ITS tools.
[2024-05-29 20:38:41] [INFO ] Flatten gal took : 53 ms
[2024-05-29 20:38:41] [INFO ] Applying decomposition
[2024-05-29 20:38:41] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16263385007482716767.txt' '-o' '/tmp/graph16263385007482716767.bin' '-w' '/tmp/graph16263385007482716767.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16263385007482716767.bin' '-l' '-1' '-v' '-w' '/tmp/graph16263385007482716767.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:38:41] [INFO ] Decomposing Gal with order
[2024-05-29 20:38:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:38:41] [INFO ] Removed a total of 9258 redundant transitions.
[2024-05-29 20:38:41] [INFO ] Flatten gal took : 117 ms
[2024-05-29 20:38:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 37 ms.
[2024-05-29 20:38:41] [INFO ] Time to serialize gal into /tmp/CTLFireability18304526025843396318.gal : 6 ms
[2024-05-29 20:38:41] [INFO ] Time to serialize properties into /tmp/CTLFireability11283443309923399161.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/CTLFireability18304526025843396318.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11283443309923399161.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97283e+06,5.92713,215436,5357,32,115190,301,2149,2.01074e+06,55,1201,0


Converting to forward existential form...Done !
original formula: EF(EG(A(AF((((((i4.i0.u20.p12==1)&&(i4.i0.u5.p26==1))&&((i4.i0.u1.p40==1)&&(i4.i0.u10.p54==1)))&&(((i4.u11.p68==1)&&(i4.i0.u23.p82==1))&&...625
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((E(!((!(EX((((((i4.i0.u20.p12==1)&&(i4.i0.u5.p26==1))&&((i4.i0.u1.p40==1)&&(i4.i0.u10.p5...1524
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t13, t19, t29, t38, t43, t1106, t1108, t1110, t1112, t1114, t1116, t1118, t1120, t112...470
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 1131/1131 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 78 transition count 1127
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 75 transition count 1127
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 6 place count 75 transition count 1110
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 40 place count 58 transition count 1110
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 55 transition count 1106
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 55 transition count 1106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 49 place count 55 transition count 1103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 49 place count 55 transition count 1101
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 53 transition count 1101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 52 transition count 1099
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 52 transition count 1099
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 59 place count 52 transition count 1095
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 71 place count 46 transition count 1089
Ensure Unique test removed 504 transitions
Reduce isomorphic transitions removed 504 transitions.
Iterating post reduction 4 with 504 rules applied. Total rules applied 575 place count 46 transition count 585
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 584 place count 46 transition count 576
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 602 place count 37 transition count 567
Applied a total of 602 rules in 163 ms. Remains 37 /79 variables (removed 42) and now considering 567/1131 (removed 564) transitions.
[2024-05-29 20:39:11] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
// Phase 1: matrix 557 rows 37 cols
[2024-05-29 20:39:11] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 20:39:11] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 20:39:11] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
[2024-05-29 20:39:11] [INFO ] Invariant cache hit.
[2024-05-29 20:39:12] [INFO ] State equation strengthened by 520 read => feed constraints.
[2024-05-29 20:39:12] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-29 20:39:12] [INFO ] Redundant transitions in 18 ms returned []
Running 558 sub problems to find dead transitions.
[2024-05-29 20:39:12] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
[2024-05-29 20:39:12] [INFO ] Invariant cache hit.
[2024-05-29 20:39:12] [INFO ] State equation strengthened by 520 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 9/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:39:20] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 20:39:20] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:39:20] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 20:39:20] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:39:20] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 20:39:20] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:39:20] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:39:20] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:39:20] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:39:20] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:39:20] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-29 20:39:20] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-29 20:39:20] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-29 20:39:20] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:39:20] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 20:39:20] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:39:21] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:39:21] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:39:21] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 20:39:21] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:39:21] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:39:21] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-29 20:39:21] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 20:39:21] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 20:39:21] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:39:21] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:39:21] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 20:39:21] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:39:21] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:39:21] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:39:21] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:39:21] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:39:21] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:39:22] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2024-05-29 20:39:22] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 20:39:22] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-29 20:39:22] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:39:22] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-29 20:39:22] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:39:22] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:39:23] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2024-05-29 20:39:23] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 20:39:23] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 20:39:23] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 20:39:23] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 20:39:23] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:39:23] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:39:24] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:39:24] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:39:24] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:39:24] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:39:24] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 5 ms to minimize.
[2024-05-29 20:39:24] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:39:24] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:39:24] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:39:25] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2024-05-29 20:39:25] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-29 20:39:25] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-29 20:39:25] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 20:39:25] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-29 20:39:25] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 20:39:25] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:39:25] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:39:25] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:39:25] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:39:25] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:39:25] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:39:25] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:39:25] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:39:25] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:39:27] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 20:39:27] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:39:27] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:39:27] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:39:28] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 20:39:28] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:39:28] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:39:28] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:39:28] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:39:29] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:39:29] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:39:29] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/37 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/37 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 11 (OVERLAPS) 556/593 variables, 37/120 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 519/639 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/594 variables, and 639 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 519/520 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 9/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (OVERLAPS) 556/593 variables, 37/120 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 519/639 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/593 variables, 558/1197 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/594 variables, and 1197 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 519/520 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 82/82 constraints]
After SMT, in 66643ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 66649ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/79 places, 567/1131 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67092 ms. Remains : 37/79 places, 567/1131 transitions.
[2024-05-29 20:40:18] [INFO ] Flatten gal took : 26 ms
[2024-05-29 20:40:18] [INFO ] Flatten gal took : 29 ms
[2024-05-29 20:40:18] [INFO ] Input system was already deterministic with 567 transitions.
[2024-05-29 20:40:19] [INFO ] Flatten gal took : 26 ms
[2024-05-29 20:40:19] [INFO ] Flatten gal took : 27 ms
[2024-05-29 20:40:19] [INFO ] Time to serialize gal into /tmp/CTLFireability2607192561903256749.gal : 5 ms
[2024-05-29 20:40:19] [INFO ] Time to serialize properties into /tmp/CTLFireability1018791498501371114.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/CTLFireability2607192561903256749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1018791498501371114.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,1041,0.308393,18368,2,815,5,11024,6,0,706,5666,0


Converting to forward existential form...Done !
original formula: EF(AG((!(E((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))&&(p124==1)) U (((((p12==1)&&(p2...362
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(E((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p...432
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...332
(forward)formula 0,1,1.46912,37960,1,0,675,49469,1148,75,20546,33034,1188
FORMULA StigmergyElection-PT-09a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 1131/1131 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 77 transition count 1128
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 77 transition count 1128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 76 transition count 1126
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 76 transition count 1126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 75 transition count 1125
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 75 transition count 1125
Applied a total of 8 rules in 12 ms. Remains 75 /79 variables (removed 4) and now considering 1125/1131 (removed 6) transitions.
[2024-05-29 20:40:20] [INFO ] Flow matrix only has 1115 transitions (discarded 10 similar events)
// Phase 1: matrix 1115 rows 75 cols
[2024-05-29 20:40:20] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 20:40:20] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 20:40:20] [INFO ] Flow matrix only has 1115 transitions (discarded 10 similar events)
[2024-05-29 20:40:20] [INFO ] Invariant cache hit.
[2024-05-29 20:40:20] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:40:20] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 1124 sub problems to find dead transitions.
[2024-05-29 20:40:20] [INFO ] Flow matrix only has 1115 transitions (discarded 10 similar events)
[2024-05-29 20:40:20] [INFO ] Invariant cache hit.
[2024-05-29 20:40:20] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1124 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1124 unsolved
[2024-05-29 20:40:40] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 1 ms to minimize.
[2024-05-29 20:40:40] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 1 ms to minimize.
[2024-05-29 20:40:40] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 1 ms to minimize.
[2024-05-29 20:40:40] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2024-05-29 20:40:40] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2024-05-29 20:40:40] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 0 ms to minimize.
[2024-05-29 20:40:41] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 0 ms to minimize.
[2024-05-29 20:40:41] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 1 ms to minimize.
[2024-05-29 20:40:41] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 1 ms to minimize.
[2024-05-29 20:40:41] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 0 ms to minimize.
[2024-05-29 20:40:41] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 1 ms to minimize.
[2024-05-29 20:40:42] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 0 ms to minimize.
[2024-05-29 20:40:42] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 0 ms to minimize.
[2024-05-29 20:40:42] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 1 ms to minimize.
[2024-05-29 20:40:42] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2024-05-29 20:40:42] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2024-05-29 20:40:42] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 1 ms to minimize.
[2024-05-29 20:40:43] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 0 ms to minimize.
[2024-05-29 20:40:43] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 0 ms to minimize.
[2024-05-29 20:40:43] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1124 unsolved
[2024-05-29 20:40:43] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2024-05-29 20:40:44] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 1 ms to minimize.
[2024-05-29 20:40:44] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 1 ms to minimize.
[2024-05-29 20:40:44] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 1 ms to minimize.
[2024-05-29 20:40:44] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 1 ms to minimize.
[2024-05-29 20:40:44] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2024-05-29 20:40:44] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-05-29 20:40:45] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 1 ms to minimize.
[2024-05-29 20:40:45] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 1 ms to minimize.
[2024-05-29 20:40:45] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 1 ms to minimize.
[2024-05-29 20:40:45] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2024-05-29 20:40:45] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2024-05-29 20:40:45] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 1 ms to minimize.
[2024-05-29 20:40:45] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2024-05-29 20:40:46] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2024-05-29 20:40:46] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2024-05-29 20:40:46] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 1 ms to minimize.
[2024-05-29 20:40:46] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-29 20:40:46] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 1 ms to minimize.
[2024-05-29 20:40:46] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1124 unsolved
[2024-05-29 20:40:49] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 1 ms to minimize.
[2024-05-29 20:40:49] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2024-05-29 20:40:49] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-29 20:40:49] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2024-05-29 20:40:49] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-29 20:40:49] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-05-29 20:40:49] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-29 20:40:49] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:40:49] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-29 20:40:50] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-29 20:40:50] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-29 20:40:50] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-29 20:40:50] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:40:50] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-29 20:40:50] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 1 ms to minimize.
[2024-05-29 20:40:51] [INFO ] Deduced a trap composed of 12 places in 256 ms of which 0 ms to minimize.
[2024-05-29 20:40:51] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2024-05-29 20:40:51] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 0 ms to minimize.
[2024-05-29 20:40:51] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 0 ms to minimize.
[2024-05-29 20:40:51] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1124 unsolved
[2024-05-29 20:40:52] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-29 20:40:52] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 20:40:52] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2024-05-29 20:40:52] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2024-05-29 20:40:52] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 0 ms to minimize.
[2024-05-29 20:40:52] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2024-05-29 20:40:52] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2024-05-29 20:40:52] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-29 20:40:53] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-29 20:40:53] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2024-05-29 20:40:53] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2024-05-29 20:40:53] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 20:40:53] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 1 ms to minimize.
[2024-05-29 20:40:53] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 1 ms to minimize.
[2024-05-29 20:40:53] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-29 20:40:53] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-29 20:40:53] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 20:40:54] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-29 20:40:54] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:40:54] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1124 unsolved
[2024-05-29 20:40:54] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-29 20:40:54] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:40:54] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:40:55] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 1 ms to minimize.
[2024-05-29 20:40:58] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:40:58] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:40:58] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 7/88 constraints. Problems are: Problem set: 0 solved, 1124 unsolved
[2024-05-29 20:41:01] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 1 ms to minimize.
[2024-05-29 20:41:01] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-29 20:41:01] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-29 20:41:01] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-29 20:41:01] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-29 20:41:01] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 20:41:01] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:41:01] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 0 ms to minimize.
[2024-05-29 20:41:02] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2024-05-29 20:41:02] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2024-05-29 20:41:05] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:41:05] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:41:05] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2024-05-29 20:41:05] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2024-05-29 20:41:05] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-29 20:41:05] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
SMT process timed out in 44977ms, After SMT, problems are : Problem set: 0 solved, 1124 unsolved
Search for dead transitions found 0 dead transitions in 44991ms
Starting structural reductions in LTL mode, iteration 1 : 75/79 places, 1125/1131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45335 ms. Remains : 75/79 places, 1125/1131 transitions.
[2024-05-29 20:41:05] [INFO ] Flatten gal took : 52 ms
[2024-05-29 20:41:05] [INFO ] Flatten gal took : 55 ms
[2024-05-29 20:41:06] [INFO ] Input system was already deterministic with 1125 transitions.
[2024-05-29 20:41:06] [INFO ] Flatten gal took : 53 ms
[2024-05-29 20:41:06] [INFO ] Flatten gal took : 54 ms
[2024-05-29 20:41:06] [INFO ] Time to serialize gal into /tmp/CTLFireability12139693043727096407.gal : 10 ms
[2024-05-29 20:41:06] [INFO ] Time to serialize properties into /tmp/CTLFireability9277127503979249318.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/CTLFireability12139693043727096407.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9277127503979249318.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,2.03836e+06,11.27,260952,2,9565,5,216386,6,0,1415,130512,0


Converting to forward existential form...Done !
original formula: (A(!(EX((E((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))&&(p124==1)) U (((((p12==1)&&(p2...1860
=> equivalent forward existential formula: (((((((([(FwdU((((FwdU(Init,!((!(!(EG(!(EG((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))...15471
Hit Full ! (commute/partial/dont) 66/216/1059
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...446
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-29 20:41:36] [INFO ] Flatten gal took : 53 ms
[2024-05-29 20:41:36] [INFO ] Applying decomposition
[2024-05-29 20:41:36] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1679264164471987968.txt' '-o' '/tmp/graph1679264164471987968.bin' '-w' '/tmp/graph1679264164471987968.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1679264164471987968.bin' '-l' '-1' '-v' '-w' '/tmp/graph1679264164471987968.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:41:36] [INFO ] Decomposing Gal with order
[2024-05-29 20:41:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:41:36] [INFO ] Removed a total of 9251 redundant transitions.
[2024-05-29 20:41:36] [INFO ] Flatten gal took : 116 ms
[2024-05-29 20:41:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 39 ms.
[2024-05-29 20:41:36] [INFO ] Time to serialize gal into /tmp/CTLFireability4164804698216189542.gal : 6 ms
[2024-05-29 20:41:36] [INFO ] Time to serialize properties into /tmp/CTLFireability671380661033543130.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/CTLFireability4164804698216189542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability671380661033543130.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.03836e+06,8.03747,263376,3730,34,125354,576,3485,1.81546e+06,58,2328,0


Converting to forward existential form...Done !
original formula: (A(!(EX((E((((((i2.i1.u16.p12==1)&&(i2.i0.u4.p26==1))&&((i2.i1.u10.p40==1)&&(i2.i0.u12.p54==1)))&&(((i2.i1.u23.p68==1)&&(i2.i1.u15.p82==1...3287
=> equivalent forward existential formula: (((((((([(FwdU((((FwdU(Init,!((!(!(EG(!(EG((((((i2.i1.u16.p12==1)&&(i2.i0.u4.p26==1))&&((i2.i1.u10.p40==1)&&(i2....26955
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t19, t23, t33, t49, t1107, t1109, t1111, t1113, t1115, t1117, t1119, t1121, t1123, i0...603
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 1131/1131 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 78 transition count 1127
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 75 transition count 1127
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 6 place count 75 transition count 1110
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 40 place count 58 transition count 1110
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 55 transition count 1106
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 55 transition count 1106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 49 place count 55 transition count 1103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 49 place count 55 transition count 1101
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 53 transition count 1101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 52 transition count 1099
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 52 transition count 1099
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 59 place count 52 transition count 1095
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 71 place count 46 transition count 1089
Ensure Unique test removed 504 transitions
Reduce isomorphic transitions removed 504 transitions.
Iterating post reduction 4 with 504 rules applied. Total rules applied 575 place count 46 transition count 585
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 584 place count 46 transition count 576
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 602 place count 37 transition count 567
Applied a total of 602 rules in 162 ms. Remains 37 /79 variables (removed 42) and now considering 567/1131 (removed 564) transitions.
[2024-05-29 20:42:06] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
// Phase 1: matrix 557 rows 37 cols
[2024-05-29 20:42:06] [INFO ] Computed 1 invariants in 6 ms
[2024-05-29 20:42:06] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 20:42:06] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
[2024-05-29 20:42:06] [INFO ] Invariant cache hit.
[2024-05-29 20:42:07] [INFO ] State equation strengthened by 520 read => feed constraints.
[2024-05-29 20:42:07] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-29 20:42:07] [INFO ] Redundant transitions in 16 ms returned []
Running 558 sub problems to find dead transitions.
[2024-05-29 20:42:07] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
[2024-05-29 20:42:07] [INFO ] Invariant cache hit.
[2024-05-29 20:42:07] [INFO ] State equation strengthened by 520 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 9/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:42:14] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-29 20:42:14] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-29 20:42:14] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 20:42:14] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:42:15] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 20:42:15] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 20:42:15] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:42:15] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:42:15] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 20:42:15] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:42:15] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-29 20:42:15] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:42:15] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2024-05-29 20:42:15] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-29 20:42:15] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:42:15] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:42:15] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 20:42:15] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 20:42:15] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:42:17] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:42:17] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:42:17] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:42:17] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-29 20:42:18] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-29 20:42:18] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:42:18] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:42:18] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:42:18] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:42:18] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:42:19] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:42:19] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:42:19] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 20:42:19] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-29 20:42:19] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-29 20:42:19] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:42:19] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-29 20:42:19] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:42:20] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2024-05-29 20:42:20] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-29 20:42:20] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 20:42:20] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-29 20:42:20] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:42:20] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:42:20] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 20:42:20] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:42:20] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:42:20] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:42:20] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:42:20] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:42:20] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 20:42:20] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 20:42:21] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:42:22] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 20:42:22] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:42:22] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:42:22] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:42:23] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:42:23] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:42:23] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:42:24] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:42:24] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 20:42:25] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:42:25] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:42:25] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/37 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/37 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 11 (OVERLAPS) 556/593 variables, 37/120 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 519/639 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/594 variables, and 639 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 519/520 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 9/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (OVERLAPS) 556/593 variables, 37/120 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 519/639 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/593 variables, 558/1197 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/594 variables, and 1197 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 519/520 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 82/82 constraints]
After SMT, in 66400ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 66405ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/79 places, 567/1131 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66805 ms. Remains : 37/79 places, 567/1131 transitions.
[2024-05-29 20:43:13] [INFO ] Flatten gal took : 25 ms
[2024-05-29 20:43:13] [INFO ] Flatten gal took : 27 ms
[2024-05-29 20:43:13] [INFO ] Input system was already deterministic with 567 transitions.
[2024-05-29 20:43:13] [INFO ] Flatten gal took : 29 ms
[2024-05-29 20:43:13] [INFO ] Flatten gal took : 28 ms
[2024-05-29 20:43:13] [INFO ] Time to serialize gal into /tmp/CTLFireability8370413621194427575.gal : 6 ms
[2024-05-29 20:43:13] [INFO ] Time to serialize properties into /tmp/CTLFireability13419817401077876286.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/CTLFireability8370413621194427575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13419817401077876286.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,1041,0.317361,18368,2,815,5,11024,6,0,706,5666,0


Converting to forward existential form...Done !
original formula: AG((EF((((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p110==0))))||(p124==0))) * ((((EG((((((p12==0)|...361
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)...466
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...332
(forward)formula 0,0,1.79185,39808,1,0,704,48158,1153,78,19729,32250,1200
FORMULA StigmergyElection-PT-09a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 20:43:15] [INFO ] Flatten gal took : 60 ms
[2024-05-29 20:43:15] [INFO ] Flatten gal took : 60 ms
[2024-05-29 20:43:15] [INFO ] Applying decomposition
[2024-05-29 20:43:15] [INFO ] Flatten gal took : 60 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/graph6365843313692280226.txt' '-o' '/tmp/graph6365843313692280226.bin' '-w' '/tmp/graph6365843313692280226.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6365843313692280226.bin' '-l' '-1' '-v' '-w' '/tmp/graph6365843313692280226.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:43:16] [INFO ] Decomposing Gal with order
[2024-05-29 20:43:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:43:16] [INFO ] Removed a total of 9256 redundant transitions.
[2024-05-29 20:43:16] [INFO ] Flatten gal took : 142 ms
[2024-05-29 20:43:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 42 ms.
[2024-05-29 20:43:16] [INFO ] Time to serialize gal into /tmp/CTLFireability343085167944596637.gal : 8 ms
[2024-05-29 20:43:16] [INFO ] Time to serialize properties into /tmp/CTLFireability8483753722675206529.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/CTLFireability343085167944596637.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8483753722675206529.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 4 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.19811e+06,11.6081,243384,6609,26,181532,277,1238,2.37011e+06,48,1088,0


Converting to forward existential form...Done !
original formula: EF(((EF((((((i5.u2.p12==1)&&(i5.u7.p26==1))&&((i5.u25.p40==1)&&(i5.u10.p54==1)))&&(((i5.u14.p68==1)&&(i5.u12.p82==1))&&((i5.u19.p96==1)&&...541
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * (((((i5.u2.p12==0)||(i5.u7.p26==0))||((i5.u25.p40==0)||(i5.u10.p54==0)))||(((i5.u14.p68...599
Reverse transition relation is NOT exact ! Due to transitions t6, t16, t22, t27, t31, t36, t41, t47, t53, t57, t1112, t1115, t1117, t1119, t1121, t1123, t1...537
(forward)formula 0,1,118.564,2222012,1,0,856365,347,7026,2.44511e+07,124,1230,1315935
FORMULA StigmergyElection-PT-09a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(AX((AX((((((i5.u2.p12==0)||(i5.u7.p26==0))||((i5.u25.p40==0)||(i5.u10.p54==0)))||(((i5.u14.p68==0)||(i5.u12.p82==0))||((i5.u19.p96==0)...715
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((!(EX(!((((((i5.u2.p12==0)||(i5.u7.p26==0))||((i5.u25.p40==0)||(i5.u10.p54==0)))||(((i5.u14....772
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 1,0,142.426,2222012,1,0,856365,375,13645,2.44511e+07,183,1759,2156278
FORMULA StigmergyElection-PT-09a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(EG(A(AF((((((i5.u2.p12==1)&&(i5.u7.p26==1))&&((i5.u25.p40==1)&&(i5.u10.p54==1)))&&(((i5.u14.p68==1)&&(i5.u12.p82==1))&&((i5.u19.p96==1...553
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((E(!((!(EX((((((i5.u2.p12==1)&&(i5.u7.p26==1))&&((i5.u25.p40==1)&&(i5.u10.p54==1)))&&(((...1356
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 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
(forward)formula 2,1,168.224,2222012,1,0,856365,395,13704,2.44511e+07,187,1792,2310783
FORMULA StigmergyElection-PT-09a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (A(!(EX((E((((((i5.u2.p12==1)&&(i5.u7.p26==1))&&((i5.u25.p40==1)&&(i5.u10.p54==1)))&&(((i5.u14.p68==1)&&(i5.u12.p82==1))&&((i5.u19.p96==1...2843
=> equivalent forward existential formula: (((((((([(FwdU((((FwdU(Init,!((!(!(EG(!(EG((((((i5.u2.p12==1)&&(i5.u7.p26==1))&&((i5.u25.p40==1)&&(i5.u10.p54==1...23347
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 3,0,188.978,2222012,1,0,861725,395,13750,2.44511e+07,187,1795,2499606
FORMULA StigmergyElection-PT-09a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

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

BK_STOP 1717015585988

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-09a.tgz
mv StigmergyElection-PT-09a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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