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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 18:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 11 18:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 11 18:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 203K 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-04b-CTLCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2023-12
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2023-13
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717007056150

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 18:24:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 18:24:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:24:17] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-05-29 18:24:17] [INFO ] Transformed 563 places.
[2024-05-29 18:24:17] [INFO ] Transformed 780 transitions.
[2024-05-29 18:24:17] [INFO ] Found NUPN structural information;
[2024-05-29 18:24:17] [INFO ] Parsed PT model containing 563 places and 780 transitions and 2680 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-04b-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 83 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 780/780 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 507 transition count 724
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 507 transition count 724
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 140 place count 479 transition count 696
Iterating global reduction 0 with 28 rules applied. Total rules applied 168 place count 479 transition count 696
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 172 place count 475 transition count 692
Iterating global reduction 0 with 4 rules applied. Total rules applied 176 place count 475 transition count 692
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 177 place count 474 transition count 691
Iterating global reduction 0 with 1 rules applied. Total rules applied 178 place count 474 transition count 691
Applied a total of 178 rules in 141 ms. Remains 474 /563 variables (removed 89) and now considering 691/780 (removed 89) transitions.
// Phase 1: matrix 691 rows 474 cols
[2024-05-29 18:24:17] [INFO ] Computed 5 invariants in 30 ms
[2024-05-29 18:24:18] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-29 18:24:18] [INFO ] Invariant cache hit.
[2024-05-29 18:24:18] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2024-05-29 18:24:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/474 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-05-29 18:24:28] [INFO ] Deduced a trap composed of 174 places in 192 ms of which 28 ms to minimize.
[2024-05-29 18:24:28] [INFO ] Deduced a trap composed of 166 places in 159 ms of which 3 ms to minimize.
[2024-05-29 18:24:28] [INFO ] Deduced a trap composed of 165 places in 141 ms of which 3 ms to minimize.
[2024-05-29 18:24:29] [INFO ] Deduced a trap composed of 175 places in 119 ms of which 3 ms to minimize.
[2024-05-29 18:24:29] [INFO ] Deduced a trap composed of 171 places in 148 ms of which 2 ms to minimize.
[2024-05-29 18:24:29] [INFO ] Deduced a trap composed of 171 places in 137 ms of which 3 ms to minimize.
[2024-05-29 18:24:29] [INFO ] Deduced a trap composed of 173 places in 138 ms of which 2 ms to minimize.
[2024-05-29 18:24:29] [INFO ] Deduced a trap composed of 172 places in 151 ms of which 2 ms to minimize.
[2024-05-29 18:24:30] [INFO ] Deduced a trap composed of 169 places in 161 ms of which 2 ms to minimize.
[2024-05-29 18:24:30] [INFO ] Deduced a trap composed of 174 places in 143 ms of which 2 ms to minimize.
[2024-05-29 18:24:30] [INFO ] Deduced a trap composed of 169 places in 151 ms of which 3 ms to minimize.
[2024-05-29 18:24:30] [INFO ] Deduced a trap composed of 168 places in 137 ms of which 3 ms to minimize.
[2024-05-29 18:24:31] [INFO ] Deduced a trap composed of 351 places in 161 ms of which 4 ms to minimize.
[2024-05-29 18:24:31] [INFO ] Deduced a trap composed of 177 places in 147 ms of which 3 ms to minimize.
[2024-05-29 18:24:31] [INFO ] Deduced a trap composed of 193 places in 146 ms of which 3 ms to minimize.
[2024-05-29 18:24:31] [INFO ] Deduced a trap composed of 178 places in 166 ms of which 3 ms to minimize.
[2024-05-29 18:24:32] [INFO ] Deduced a trap composed of 168 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:24:32] [INFO ] Deduced a trap composed of 167 places in 132 ms of which 2 ms to minimize.
[2024-05-29 18:24:32] [INFO ] Deduced a trap composed of 174 places in 145 ms of which 3 ms to minimize.
[2024-05-29 18:24:33] [INFO ] Deduced a trap composed of 176 places in 141 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-05-29 18:24:33] [INFO ] Deduced a trap composed of 177 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:24:34] [INFO ] Deduced a trap composed of 171 places in 136 ms of which 2 ms to minimize.
[2024-05-29 18:24:35] [INFO ] Deduced a trap composed of 175 places in 137 ms of which 2 ms to minimize.
[2024-05-29 18:24:35] [INFO ] Deduced a trap composed of 169 places in 127 ms of which 3 ms to minimize.
[2024-05-29 18:24:35] [INFO ] Deduced a trap composed of 175 places in 137 ms of which 2 ms to minimize.
[2024-05-29 18:24:35] [INFO ] Deduced a trap composed of 168 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:24:36] [INFO ] Deduced a trap composed of 269 places in 160 ms of which 3 ms to minimize.
[2024-05-29 18:24:37] [INFO ] Deduced a trap composed of 169 places in 127 ms of which 2 ms to minimize.
[2024-05-29 18:24:37] [INFO ] Deduced a trap composed of 167 places in 159 ms of which 3 ms to minimize.
[2024-05-29 18:24:38] [INFO ] Deduced a trap composed of 172 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:24:39] [INFO ] Deduced a trap composed of 166 places in 124 ms of which 3 ms to minimize.
[2024-05-29 18:24:40] [INFO ] Deduced a trap composed of 166 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:24:40] [INFO ] Deduced a trap composed of 180 places in 157 ms of which 2 ms to minimize.
[2024-05-29 18:24:40] [INFO ] Deduced a trap composed of 174 places in 126 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 690 unsolved
(s203 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 474/1165 variables, and 39 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/474 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/474 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-05-29 18:24:56] [INFO ] Deduced a trap composed of 168 places in 139 ms of which 3 ms to minimize.
[2024-05-29 18:24:59] [INFO ] Deduced a trap composed of 175 places in 156 ms of which 2 ms to minimize.
[2024-05-29 18:24:59] [INFO ] Deduced a trap composed of 175 places in 134 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-05-29 18:25:06] [INFO ] Deduced a trap composed of 171 places in 125 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 6 (OVERLAPS) 691/1165 variables, 474/517 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1165 variables, 690/1207 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1165/1165 variables, and 1207 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 38/38 constraints]
After SMT, in 60527ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60547ms
Starting structural reductions in LTL mode, iteration 1 : 474/563 places, 691/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61412 ms. Remains : 474/563 places, 691/780 transitions.
Support contains 83 out of 474 places after structural reductions.
[2024-05-29 18:25:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 18:25:19] [INFO ] Flatten gal took : 77 ms
FORMULA StigmergyElection-PT-04b-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 18:25:19] [INFO ] Flatten gal took : 43 ms
[2024-05-29 18:25:19] [INFO ] Input system was already deterministic with 691 transitions.
RANDOM walk for 40000 steps (542 resets) in 1926 ms. (20 steps per ms) remains 21/51 properties
BEST_FIRST walk for 4003 steps (11 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (11 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (9 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (11 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (10 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (10 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (10 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (10 resets) in 46 ms. (85 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (11 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (10 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (11 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (10 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (10 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (10 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (10 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (9 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
[2024-05-29 18:25:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 421/458 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 16/474 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 691/1165 variables, 474/479 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1165 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/1165 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1165/1165 variables, and 479 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1220 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 1 (OVERLAPS) 421/458 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-05-29 18:25:21] [INFO ] Deduced a trap composed of 172 places in 141 ms of which 2 ms to minimize.
[2024-05-29 18:25:22] [INFO ] Deduced a trap composed of 175 places in 166 ms of which 3 ms to minimize.
[2024-05-29 18:25:22] [INFO ] Deduced a trap composed of 169 places in 143 ms of which 2 ms to minimize.
[2024-05-29 18:25:22] [INFO ] Deduced a trap composed of 171 places in 152 ms of which 3 ms to minimize.
[2024-05-29 18:25:22] [INFO ] Deduced a trap composed of 166 places in 162 ms of which 3 ms to minimize.
[2024-05-29 18:25:22] [INFO ] Deduced a trap composed of 175 places in 158 ms of which 3 ms to minimize.
[2024-05-29 18:25:22] [INFO ] Deduced a trap composed of 168 places in 154 ms of which 3 ms to minimize.
[2024-05-29 18:25:23] [INFO ] Deduced a trap composed of 168 places in 139 ms of which 3 ms to minimize.
[2024-05-29 18:25:23] [INFO ] Deduced a trap composed of 169 places in 125 ms of which 2 ms to minimize.
[2024-05-29 18:25:23] [INFO ] Deduced a trap composed of 172 places in 146 ms of which 3 ms to minimize.
[2024-05-29 18:25:23] [INFO ] Deduced a trap composed of 169 places in 139 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 11/15 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-05-29 18:25:23] [INFO ] Deduced a trap composed of 169 places in 161 ms of which 3 ms to minimize.
[2024-05-29 18:25:24] [INFO ] Deduced a trap composed of 175 places in 157 ms of which 3 ms to minimize.
[2024-05-29 18:25:24] [INFO ] Deduced a trap composed of 169 places in 154 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 3/18 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-05-29 18:25:24] [INFO ] Deduced a trap composed of 166 places in 133 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 1/19 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 16/474 variables, 1/20 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 691/1165 variables, 474/494 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1165 variables, 19/513 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-05-29 18:25:25] [INFO ] Deduced a trap composed of 169 places in 133 ms of which 3 ms to minimize.
[2024-05-29 18:25:26] [INFO ] Deduced a trap composed of 171 places in 126 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1165 variables, 2/515 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-05-29 18:25:26] [INFO ] Deduced a trap composed of 177 places in 123 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1165/1165 variables, and 516 constraints, problems are : Problem set: 2 solved, 19 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 19/21 constraints, Known Traps: 18/18 constraints]
After SMT, in 6242ms problems are : Problem set: 2 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 691/691 transitions.
Graph (trivial) has 428 edges and 474 vertex of which 36 / 474 are part of one of the 7 SCC in 5 ms
Free SCC test removed 29 places
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Graph (complete) has 817 edges and 445 vertex of which 441 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 265 transitions
Trivial Post-agglo rules discarded 265 transitions
Performed 265 trivial Post agglomeration. Transition count delta: 265
Iterating post reduction 0 with 268 rules applied. Total rules applied 270 place count 441 transition count 383
Reduce places removed 265 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 269 rules applied. Total rules applied 539 place count 176 transition count 379
Reduce places removed 2 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 15 rules applied. Total rules applied 554 place count 174 transition count 366
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 19 rules applied. Total rules applied 573 place count 161 transition count 360
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 576 place count 158 transition count 360
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 23 Pre rules applied. Total rules applied 576 place count 158 transition count 337
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 622 place count 135 transition count 337
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 624 place count 133 transition count 335
Iterating global reduction 5 with 2 rules applied. Total rules applied 626 place count 133 transition count 335
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 626 place count 133 transition count 334
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 628 place count 132 transition count 334
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 629 place count 131 transition count 326
Iterating global reduction 5 with 1 rules applied. Total rules applied 630 place count 131 transition count 326
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 631 place count 131 transition count 325
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 673 place count 110 transition count 303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 674 place count 110 transition count 302
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 682 place count 102 transition count 179
Iterating global reduction 7 with 8 rules applied. Total rules applied 690 place count 102 transition count 179
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 695 place count 102 transition count 174
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 709 place count 95 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 720 place count 95 transition count 171
Free-agglomeration rule applied 22 times.
Iterating global reduction 8 with 22 rules applied. Total rules applied 742 place count 95 transition count 149
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 764 place count 73 transition count 149
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 765 place count 72 transition count 148
Iterating global reduction 9 with 1 rules applied. Total rules applied 766 place count 72 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 776 place count 72 transition count 138
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 778 place count 72 transition count 138
Applied a total of 778 rules in 118 ms. Remains 72 /474 variables (removed 402) and now considering 138/691 (removed 553) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 72/474 places, 138/691 transitions.
RANDOM walk for 32432 steps (158 resets) in 550 ms. (58 steps per ms) remains 0/19 properties
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2024-05-29 18:25:26] [INFO ] Flatten gal took : 39 ms
[2024-05-29 18:25:27] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:25:27] [INFO ] Input system was already deterministic with 691 transitions.
Computed a total of 62 stabilizing places and 66 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 691/691 transitions.
Graph (trivial) has 480 edges and 474 vertex of which 65 / 474 are part of one of the 11 SCC in 2 ms
Free SCC test removed 54 places
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 290 transitions
Trivial Post-agglo rules discarded 290 transitions
Performed 290 trivial Post agglomeration. Transition count delta: 290
Iterating post reduction 0 with 290 rules applied. Total rules applied 291 place count 419 transition count 339
Reduce places removed 290 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 300 rules applied. Total rules applied 591 place count 129 transition count 329
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 8 rules applied. Total rules applied 599 place count 124 transition count 326
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 602 place count 121 transition count 326
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 602 place count 121 transition count 309
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 636 place count 104 transition count 309
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 648 place count 92 transition count 295
Iterating global reduction 4 with 12 rules applied. Total rules applied 660 place count 92 transition count 295
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 662 place count 92 transition count 293
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 664 place count 90 transition count 293
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 664 place count 90 transition count 291
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 668 place count 88 transition count 291
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 672 place count 84 transition count 278
Iterating global reduction 6 with 4 rules applied. Total rules applied 676 place count 84 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 677 place count 84 transition count 277
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 679 place count 82 transition count 275
Iterating global reduction 7 with 2 rules applied. Total rules applied 681 place count 82 transition count 275
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 701 place count 72 transition count 265
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 712 place count 61 transition count 131
Iterating global reduction 7 with 11 rules applied. Total rules applied 723 place count 61 transition count 131
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 731 place count 61 transition count 123
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 732 place count 60 transition count 121
Iterating global reduction 8 with 1 rules applied. Total rules applied 733 place count 60 transition count 121
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 734 place count 59 transition count 120
Iterating global reduction 8 with 1 rules applied. Total rules applied 735 place count 59 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 739 place count 59 transition count 116
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 747 place count 55 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 748 place count 54 transition count 111
Applied a total of 748 rules in 66 ms. Remains 54 /474 variables (removed 420) and now considering 111/691 (removed 580) transitions.
[2024-05-29 18:25:27] [INFO ] Flow matrix only has 106 transitions (discarded 5 similar events)
// Phase 1: matrix 106 rows 54 cols
[2024-05-29 18:25:27] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 18:25:27] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 18:25:27] [INFO ] Flow matrix only has 106 transitions (discarded 5 similar events)
[2024-05-29 18:25:27] [INFO ] Invariant cache hit.
[2024-05-29 18:25:27] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:25:27] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-29 18:25:27] [INFO ] Redundant transitions in 1 ms returned []
Running 102 sub problems to find dead transitions.
[2024-05-29 18:25:27] [INFO ] Flow matrix only has 106 transitions (discarded 5 similar events)
[2024-05-29 18:25:27] [INFO ] Invariant cache hit.
[2024-05-29 18:25:27] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 4/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-29 18:25:27] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 8 ms to minimize.
[2024-05-29 18:25:27] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:25:27] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:25:27] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:25:27] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:25:27] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:25:27] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:25:27] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:25:27] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:25:27] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:25:28] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:25:28] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:25:28] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:25:28] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:25:28] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:25:28] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:25:28] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:25:28] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-29 18:25:28] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 105/159 variables, 54/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-29 18:25:29] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/160 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/160 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 91 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3401 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 4/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 105/159 variables, 54/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 102/192 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/160 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/160 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 193 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3101 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 20/20 constraints]
After SMT, in 6546ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 6547ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/474 places, 111/691 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6729 ms. Remains : 54/474 places, 111/691 transitions.
[2024-05-29 18:25:33] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:25:33] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:25:33] [INFO ] Input system was already deterministic with 111 transitions.
[2024-05-29 18:25:33] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:25:33] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:25:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality10212325176730649796.gal : 3 ms
[2024-05-29 18:25:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality3549197708840300794.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/CTLCardinality10212325176730649796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3549197708840300794.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,29810,0.133925,8808,2,1980,5,17299,6,0,319,17999,0


Converting to forward existential form...Done !
original formula: EG(((p380==0)||(p153==1)))
=> equivalent forward existential formula: [FwdG(Init,((p380==0)||(p153==1)))] != FALSE
Hit Full ! (commute/partial/dont) 106/0/5
(forward)formula 0,1,0.59627,24856,1,0,22,85635,19,4,2233,78219,20
FORMULA StigmergyElection-PT-04b-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 691/691 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 455 transition count 672
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 455 transition count 672
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 448 transition count 665
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 448 transition count 665
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 446 transition count 663
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 446 transition count 663
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 445 transition count 662
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 445 transition count 662
Applied a total of 58 rules in 68 ms. Remains 445 /474 variables (removed 29) and now considering 662/691 (removed 29) transitions.
// Phase 1: matrix 662 rows 445 cols
[2024-05-29 18:25:34] [INFO ] Computed 5 invariants in 9 ms
[2024-05-29 18:25:34] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-29 18:25:34] [INFO ] Invariant cache hit.
[2024-05-29 18:25:34] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 661 sub problems to find dead transitions.
[2024-05-29 18:25:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (OVERLAPS) 1/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-29 18:25:44] [INFO ] Deduced a trap composed of 337 places in 166 ms of which 3 ms to minimize.
[2024-05-29 18:25:45] [INFO ] Deduced a trap composed of 164 places in 163 ms of which 3 ms to minimize.
[2024-05-29 18:25:45] [INFO ] Deduced a trap composed of 163 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:25:45] [INFO ] Deduced a trap composed of 163 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:25:45] [INFO ] Deduced a trap composed of 162 places in 117 ms of which 2 ms to minimize.
[2024-05-29 18:25:47] [INFO ] Deduced a trap composed of 165 places in 140 ms of which 3 ms to minimize.
[2024-05-29 18:25:47] [INFO ] Deduced a trap composed of 162 places in 117 ms of which 2 ms to minimize.
[2024-05-29 18:25:47] [INFO ] Deduced a trap composed of 165 places in 122 ms of which 2 ms to minimize.
[2024-05-29 18:25:48] [INFO ] Deduced a trap composed of 166 places in 121 ms of which 3 ms to minimize.
[2024-05-29 18:25:48] [INFO ] Deduced a trap composed of 167 places in 133 ms of which 2 ms to minimize.
[2024-05-29 18:25:49] [INFO ] Deduced a trap composed of 163 places in 143 ms of which 3 ms to minimize.
[2024-05-29 18:25:49] [INFO ] Deduced a trap composed of 164 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:25:49] [INFO ] Deduced a trap composed of 166 places in 132 ms of which 3 ms to minimize.
[2024-05-29 18:25:50] [INFO ] Deduced a trap composed of 218 places in 120 ms of which 2 ms to minimize.
[2024-05-29 18:25:50] [INFO ] Deduced a trap composed of 166 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:25:50] [INFO ] Deduced a trap composed of 164 places in 152 ms of which 3 ms to minimize.
[2024-05-29 18:25:50] [INFO ] Deduced a trap composed of 167 places in 132 ms of which 2 ms to minimize.
[2024-05-29 18:25:50] [INFO ] Deduced a trap composed of 163 places in 152 ms of which 2 ms to minimize.
[2024-05-29 18:25:51] [INFO ] Deduced a trap composed of 166 places in 137 ms of which 3 ms to minimize.
[2024-05-29 18:25:51] [INFO ] Deduced a trap composed of 164 places in 145 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-29 18:25:53] [INFO ] Deduced a trap composed of 165 places in 138 ms of which 3 ms to minimize.
[2024-05-29 18:25:54] [INFO ] Deduced a trap composed of 163 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:25:56] [INFO ] Deduced a trap composed of 165 places in 132 ms of which 2 ms to minimize.
[2024-05-29 18:25:56] [INFO ] Deduced a trap composed of 167 places in 155 ms of which 3 ms to minimize.
[2024-05-29 18:25:56] [INFO ] Deduced a trap composed of 176 places in 138 ms of which 2 ms to minimize.
[2024-05-29 18:25:56] [INFO ] Deduced a trap composed of 165 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:25:56] [INFO ] Deduced a trap composed of 164 places in 126 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-29 18:26:03] [INFO ] Deduced a trap composed of 221 places in 135 ms of which 2 ms to minimize.
[2024-05-29 18:26:04] [INFO ] Deduced a trap composed of 163 places in 120 ms of which 3 ms to minimize.
[2024-05-29 18:26:05] [INFO ] Deduced a trap composed of 165 places in 130 ms of which 3 ms to minimize.
[2024-05-29 18:26:05] [INFO ] Deduced a trap composed of 168 places in 121 ms of which 2 ms to minimize.
[2024-05-29 18:26:05] [INFO ] Deduced a trap composed of 167 places in 118 ms of which 2 ms to minimize.
SMT process timed out in 30377ms, After SMT, problems are : Problem set: 0 solved, 661 unsolved
Search for dead transitions found 0 dead transitions in 30389ms
Starting structural reductions in LTL mode, iteration 1 : 445/474 places, 662/691 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30879 ms. Remains : 445/474 places, 662/691 transitions.
[2024-05-29 18:26:05] [INFO ] Flatten gal took : 30 ms
[2024-05-29 18:26:05] [INFO ] Flatten gal took : 21 ms
[2024-05-29 18:26:05] [INFO ] Input system was already deterministic with 662 transitions.
[2024-05-29 18:26:05] [INFO ] Flatten gal took : 20 ms
[2024-05-29 18:26:05] [INFO ] Flatten gal took : 18 ms
[2024-05-29 18:26:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality18414011427870149261.gal : 13 ms
[2024-05-29 18:26:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality13062137519765046849.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/CTLCardinality18414011427870149261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13062137519765046849.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,8.45397e+08,9.08263,242928,2,18020,5,707658,6,0,2444,1.07469e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:26:35] [INFO ] Flatten gal took : 21 ms
[2024-05-29 18:26:35] [INFO ] Applying decomposition
[2024-05-29 18:26:35] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18218161312992935082.txt' '-o' '/tmp/graph18218161312992935082.bin' '-w' '/tmp/graph18218161312992935082.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18218161312992935082.bin' '-l' '-1' '-v' '-w' '/tmp/graph18218161312992935082.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:26:35] [INFO ] Decomposing Gal with order
[2024-05-29 18:26:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:26:36] [INFO ] Removed a total of 797 redundant transitions.
[2024-05-29 18:26:36] [INFO ] Flatten gal took : 114 ms
[2024-05-29 18:26:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 15 ms.
[2024-05-29 18:26:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality17766202903192938692.gal : 11 ms
[2024-05-29 18:26:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality12453480048235575446.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/CTLCardinality17766202903192938692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12453480048235575446.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,8.45397e+08,5.111,179496,2028,16,326024,897,891,902708,47,2774,0


Converting to forward existential form...Done !
original formula: ((!(E(EG(!(AF(((i8.u83.p236==0)||(i6.u42.p119==1))))) U EX((i17.u129.p382==1)))) * EG(AF((i27.u174.p519==1)))) * (EG(AG(((i23.u140.p422==...356
=> equivalent forward existential formula: (([(EY(FwdU(Init,EG(!(!(EG(!(((i8.u83.p236==0)||(i6.u42.p119==1))))))))) * (i17.u129.p382==1))] = FALSE * [(Init...521
Reverse transition relation is NOT exact ! Due to transitions t60, t104, t105, t139, t141, t158, t237, t239, t256, t301, t335, t337, t353, t398, t433, t456...510
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
(forward)formula 0,0,9.89316,258432,1,0,422850,897,7873,1.44492e+06,260,2774,1466490
FORMULA StigmergyElection-PT-04b-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 691/691 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 456 transition count 673
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 456 transition count 673
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 450 transition count 667
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 450 transition count 667
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 449 transition count 666
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 449 transition count 666
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 448 transition count 665
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 448 transition count 665
Applied a total of 52 rules in 115 ms. Remains 448 /474 variables (removed 26) and now considering 665/691 (removed 26) transitions.
// Phase 1: matrix 665 rows 448 cols
[2024-05-29 18:26:46] [INFO ] Computed 5 invariants in 9 ms
[2024-05-29 18:26:46] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-29 18:26:46] [INFO ] Invariant cache hit.
[2024-05-29 18:26:46] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Running 664 sub problems to find dead transitions.
[2024-05-29 18:26:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 1 (OVERLAPS) 1/448 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2024-05-29 18:26:56] [INFO ] Deduced a trap composed of 167 places in 169 ms of which 4 ms to minimize.
[2024-05-29 18:26:57] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 3 ms to minimize.
[2024-05-29 18:26:57] [INFO ] Deduced a trap composed of 166 places in 120 ms of which 2 ms to minimize.
[2024-05-29 18:26:57] [INFO ] Deduced a trap composed of 164 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:26:58] [INFO ] Deduced a trap composed of 166 places in 145 ms of which 3 ms to minimize.
[2024-05-29 18:26:58] [INFO ] Deduced a trap composed of 166 places in 123 ms of which 2 ms to minimize.
[2024-05-29 18:26:58] [INFO ] Deduced a trap composed of 169 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:26:59] [INFO ] Deduced a trap composed of 167 places in 123 ms of which 2 ms to minimize.
[2024-05-29 18:26:59] [INFO ] Deduced a trap composed of 166 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:27:00] [INFO ] Deduced a trap composed of 164 places in 138 ms of which 2 ms to minimize.
[2024-05-29 18:27:00] [INFO ] Deduced a trap composed of 164 places in 122 ms of which 2 ms to minimize.
[2024-05-29 18:27:01] [INFO ] Deduced a trap composed of 166 places in 139 ms of which 3 ms to minimize.
[2024-05-29 18:27:01] [INFO ] Deduced a trap composed of 164 places in 129 ms of which 3 ms to minimize.
[2024-05-29 18:27:01] [INFO ] Deduced a trap composed of 167 places in 142 ms of which 2 ms to minimize.
[2024-05-29 18:27:01] [INFO ] Deduced a trap composed of 224 places in 139 ms of which 3 ms to minimize.
[2024-05-29 18:27:02] [INFO ] Deduced a trap composed of 168 places in 127 ms of which 2 ms to minimize.
[2024-05-29 18:27:02] [INFO ] Deduced a trap composed of 164 places in 146 ms of which 2 ms to minimize.
[2024-05-29 18:27:02] [INFO ] Deduced a trap composed of 167 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:27:02] [INFO ] Deduced a trap composed of 177 places in 137 ms of which 3 ms to minimize.
[2024-05-29 18:27:02] [INFO ] Deduced a trap composed of 170 places in 117 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2024-05-29 18:27:06] [INFO ] Deduced a trap composed of 163 places in 135 ms of which 3 ms to minimize.
[2024-05-29 18:27:06] [INFO ] Deduced a trap composed of 168 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:27:06] [INFO ] Deduced a trap composed of 166 places in 129 ms of which 2 ms to minimize.
[2024-05-29 18:27:07] [INFO ] Deduced a trap composed of 167 places in 135 ms of which 2 ms to minimize.
[2024-05-29 18:27:08] [INFO ] Deduced a trap composed of 167 places in 130 ms of which 2 ms to minimize.
[2024-05-29 18:27:08] [INFO ] Deduced a trap composed of 167 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:27:08] [INFO ] Deduced a trap composed of 167 places in 123 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2024-05-29 18:27:14] [INFO ] Deduced a trap composed of 166 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:27:14] [INFO ] Deduced a trap composed of 166 places in 115 ms of which 2 ms to minimize.
[2024-05-29 18:27:15] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 2 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 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/1113 variables, and 35 constraints, problems are : Problem set: 0 solved, 664 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/448 constraints, PredecessorRefiner: 664/664 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 664 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 1 (OVERLAPS) 1/448 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2024-05-29 18:27:23] [INFO ] Deduced a trap composed of 166 places in 131 ms of which 2 ms to minimize.
[2024-05-29 18:27:24] [INFO ] Deduced a trap composed of 167 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:27:25] [INFO ] Deduced a trap composed of 164 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:27:26] [INFO ] Deduced a trap composed of 165 places in 143 ms of which 3 ms to minimize.
[2024-05-29 18:27:26] [INFO ] Deduced a trap composed of 219 places in 122 ms of which 2 ms to minimize.
[2024-05-29 18:27:26] [INFO ] Deduced a trap composed of 166 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2024-05-29 18:27:33] [INFO ] Deduced a trap composed of 169 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:27:34] [INFO ] Deduced a trap composed of 167 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 6 (OVERLAPS) 665/1113 variables, 448/491 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1113 variables, 664/1155 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2024-05-29 18:27:46] [INFO ] Deduced a trap composed of 165 places in 126 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1113/1113 variables, and 1156 constraints, problems are : Problem set: 0 solved, 664 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 448/448 constraints, PredecessorRefiner: 664/664 constraints, Known Traps: 39/39 constraints]
After SMT, in 60311ms problems are : Problem set: 0 solved, 664 unsolved
Search for dead transitions found 0 dead transitions in 60330ms
Starting structural reductions in LTL mode, iteration 1 : 448/474 places, 665/691 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61035 ms. Remains : 448/474 places, 665/691 transitions.
[2024-05-29 18:27:47] [INFO ] Flatten gal took : 17 ms
[2024-05-29 18:27:47] [INFO ] Flatten gal took : 17 ms
[2024-05-29 18:27:47] [INFO ] Input system was already deterministic with 665 transitions.
[2024-05-29 18:27:47] [INFO ] Flatten gal took : 17 ms
[2024-05-29 18:27:47] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:27:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality952243690974502624.gal : 4 ms
[2024-05-29 18:27:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality7120162831064463416.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/CTLCardinality952243690974502624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7120162831064463416.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.16724e+08,8.87663,205028,2,14614,5,604898,6,0,2459,876891,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:28:17] [INFO ] Flatten gal took : 18 ms
[2024-05-29 18:28:17] [INFO ] Applying decomposition
[2024-05-29 18:28:17] [INFO ] Flatten gal took : 16 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/graph16665654212723828746.txt' '-o' '/tmp/graph16665654212723828746.bin' '-w' '/tmp/graph16665654212723828746.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16665654212723828746.bin' '-l' '-1' '-v' '-w' '/tmp/graph16665654212723828746.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:28:17] [INFO ] Decomposing Gal with order
[2024-05-29 18:28:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:28:17] [INFO ] Removed a total of 796 redundant transitions.
[2024-05-29 18:28:17] [INFO ] Flatten gal took : 35 ms
[2024-05-29 18:28:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2024-05-29 18:28:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality1988925960504298231.gal : 5 ms
[2024-05-29 18:28:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality14470606020617950437.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/CTLCardinality1988925960504298231.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14470606020617950437.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,8.16724e+08,6.04555,211004,1901,18,339585,816,936,1.24909e+06,49,2694,0


Converting to forward existential form...Done !
original formula: E(A((EG(AG((i27.u168.p508==1))) + (!(AG((i0.u44.p137==0))) * EG((i29.u183.p548==1)))) U EX(!(EF(((i15.u98.p287==0)||(i7.i0.i1.u66.p195==1...329
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!((E(!(EX(!(E(TRUE U ((i15.u98.p287==0)||(i7.i0.i1.u66.p195==1)))))) U (!((EG(!(E(TRUE U !((i27...817
Reverse transition relation is NOT exact ! Due to transitions t32, t60, t140, t142, t159, t204, t238, t240, t257, t303, t338, t356, t401, t435, t437, t458,...471
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 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 691/691 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 455 transition count 672
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 455 transition count 672
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 447 transition count 664
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 447 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 446 transition count 663
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 446 transition count 663
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 445 transition count 662
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 445 transition count 662
Applied a total of 58 rules in 43 ms. Remains 445 /474 variables (removed 29) and now considering 662/691 (removed 29) transitions.
// Phase 1: matrix 662 rows 445 cols
[2024-05-29 18:28:47] [INFO ] Computed 5 invariants in 14 ms
[2024-05-29 18:28:47] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-29 18:28:47] [INFO ] Invariant cache hit.
[2024-05-29 18:28:48] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 661 sub problems to find dead transitions.
[2024-05-29 18:28:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (OVERLAPS) 1/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-29 18:28:56] [INFO ] Deduced a trap composed of 164 places in 132 ms of which 2 ms to minimize.
[2024-05-29 18:28:57] [INFO ] Deduced a trap composed of 164 places in 137 ms of which 3 ms to minimize.
[2024-05-29 18:28:57] [INFO ] Deduced a trap composed of 163 places in 123 ms of which 2 ms to minimize.
[2024-05-29 18:28:57] [INFO ] Deduced a trap composed of 164 places in 136 ms of which 3 ms to minimize.
[2024-05-29 18:28:58] [INFO ] Deduced a trap composed of 167 places in 125 ms of which 3 ms to minimize.
[2024-05-29 18:28:58] [INFO ] Deduced a trap composed of 164 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:28:58] [INFO ] Deduced a trap composed of 164 places in 136 ms of which 2 ms to minimize.
[2024-05-29 18:28:59] [INFO ] Deduced a trap composed of 165 places in 131 ms of which 3 ms to minimize.
[2024-05-29 18:28:59] [INFO ] Deduced a trap composed of 166 places in 125 ms of which 2 ms to minimize.
[2024-05-29 18:28:59] [INFO ] Deduced a trap composed of 164 places in 113 ms of which 2 ms to minimize.
[2024-05-29 18:28:59] [INFO ] Deduced a trap composed of 162 places in 111 ms of which 2 ms to minimize.
[2024-05-29 18:29:01] [INFO ] Deduced a trap composed of 166 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:29:01] [INFO ] Deduced a trap composed of 162 places in 146 ms of which 2 ms to minimize.
[2024-05-29 18:29:01] [INFO ] Deduced a trap composed of 165 places in 139 ms of which 2 ms to minimize.
[2024-05-29 18:29:02] [INFO ] Deduced a trap composed of 165 places in 133 ms of which 2 ms to minimize.
[2024-05-29 18:29:02] [INFO ] Deduced a trap composed of 165 places in 117 ms of which 2 ms to minimize.
[2024-05-29 18:29:02] [INFO ] Deduced a trap composed of 163 places in 111 ms of which 2 ms to minimize.
[2024-05-29 18:29:02] [INFO ] Deduced a trap composed of 167 places in 149 ms of which 3 ms to minimize.
[2024-05-29 18:29:02] [INFO ] Deduced a trap composed of 166 places in 134 ms of which 2 ms to minimize.
[2024-05-29 18:29:03] [INFO ] Deduced a trap composed of 164 places in 136 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-29 18:29:06] [INFO ] Deduced a trap composed of 167 places in 121 ms of which 3 ms to minimize.
[2024-05-29 18:29:07] [INFO ] Deduced a trap composed of 165 places in 136 ms of which 3 ms to minimize.
[2024-05-29 18:29:08] [INFO ] Deduced a trap composed of 167 places in 138 ms of which 3 ms to minimize.
[2024-05-29 18:29:08] [INFO ] Deduced a trap composed of 168 places in 146 ms of which 3 ms to minimize.
[2024-05-29 18:29:08] [INFO ] Deduced a trap composed of 168 places in 134 ms of which 2 ms to minimize.
[2024-05-29 18:29:08] [INFO ] Deduced a trap composed of 191 places in 148 ms of which 2 ms to minimize.
[2024-05-29 18:29:08] [INFO ] Deduced a trap composed of 181 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:29:08] [INFO ] Deduced a trap composed of 166 places in 112 ms of which 2 ms to minimize.
[2024-05-29 18:29:09] [INFO ] Deduced a trap composed of 164 places in 146 ms of which 3 ms to minimize.
[2024-05-29 18:29:09] [INFO ] Deduced a trap composed of 166 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:29:09] [INFO ] Deduced a trap composed of 191 places in 122 ms of which 2 ms to minimize.
[2024-05-29 18:29:09] [INFO ] Deduced a trap composed of 167 places in 115 ms of which 2 ms to minimize.
[2024-05-29 18:29:09] [INFO ] Deduced a trap composed of 166 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-29 18:29:16] [INFO ] Deduced a trap composed of 169 places in 145 ms of which 3 ms to minimize.
[2024-05-29 18:29:17] [INFO ] Deduced a trap composed of 164 places in 133 ms of which 2 ms to minimize.
[2024-05-29 18:29:17] [INFO ] Deduced a trap composed of 164 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:29:17] [INFO ] Deduced a trap composed of 164 places in 116 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1107 variables, and 42 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/445 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 661 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (OVERLAPS) 1/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 37/42 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-29 18:29:23] [INFO ] Deduced a trap composed of 166 places in 121 ms of which 2 ms to minimize.
[2024-05-29 18:29:24] [INFO ] Deduced a trap composed of 165 places in 121 ms of which 2 ms to minimize.
[2024-05-29 18:29:25] [INFO ] Deduced a trap composed of 165 places in 145 ms of which 2 ms to minimize.
[2024-05-29 18:29:28] [INFO ] Deduced a trap composed of 165 places in 112 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/445 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 5 (OVERLAPS) 662/1107 variables, 445/491 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1107 variables, 661/1152 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1107/1107 variables, and 1152 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 445/445 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 41/41 constraints]
After SMT, in 60311ms problems are : Problem set: 0 solved, 661 unsolved
Search for dead transitions found 0 dead transitions in 60320ms
Starting structural reductions in LTL mode, iteration 1 : 445/474 places, 662/691 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60803 ms. Remains : 445/474 places, 662/691 transitions.
[2024-05-29 18:29:48] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:29:48] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:29:48] [INFO ] Input system was already deterministic with 662 transitions.
[2024-05-29 18:29:48] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:29:48] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:29:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality3032524385928397588.gal : 4 ms
[2024-05-29 18:29:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality3878573106954399551.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/CTLCardinality3032524385928397588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3878573106954399551.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,8.08356e+08,9.02519,228140,2,14080,5,696055,6,0,2444,1.02192e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:30:18] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:30:18] [INFO ] Applying decomposition
[2024-05-29 18:30:18] [INFO ] Flatten gal took : 13 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/graph6252566132848802641.txt' '-o' '/tmp/graph6252566132848802641.bin' '-w' '/tmp/graph6252566132848802641.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6252566132848802641.bin' '-l' '-1' '-v' '-w' '/tmp/graph6252566132848802641.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:30:18] [INFO ] Decomposing Gal with order
[2024-05-29 18:30:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:30:18] [INFO ] Removed a total of 795 redundant transitions.
[2024-05-29 18:30:18] [INFO ] Flatten gal took : 29 ms
[2024-05-29 18:30:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-05-29 18:30:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality11558188832274511227.gal : 4 ms
[2024-05-29 18:30:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality15255880168191698704.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/CTLCardinality11558188832274511227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15255880168191698704.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,8.08356e+08,10.0602,332640,1979,15,491144,780,890,2.25234e+06,49,2675,0


Converting to forward existential form...Done !
original formula: EF(AG((A(!(A((i0.u13.p122==1) U ((i17.u113.p351==0)||(i9.i1.i1.u63.p184==1)))) U ((i13.u87.p259==1)&&(i13.u88.p269==0))) + (EF(EX(((i24.u...239
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!((E(!(((i13.u87.p259==1)&&(i13.u88.p269==0))) U (!(!(!((E(!(((i17.u113.p351==...531
Reverse transition relation is NOT exact ! Due to transitions t16, t60, t140, t142, t159, t204, t238, t240, t303, t337, t339, t355, t400, t434, t457, t459,...452
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 691/691 transitions.
Graph (trivial) has 483 edges and 474 vertex of which 72 / 474 are part of one of the 12 SCC in 3 ms
Free SCC test removed 60 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 289 transitions
Trivial Post-agglo rules discarded 289 transitions
Performed 289 trivial Post agglomeration. Transition count delta: 289
Iterating post reduction 0 with 289 rules applied. Total rules applied 290 place count 413 transition count 333
Reduce places removed 289 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 297 rules applied. Total rules applied 587 place count 124 transition count 325
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 592 place count 120 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 593 place count 119 transition count 324
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 593 place count 119 transition count 309
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 623 place count 104 transition count 309
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 636 place count 91 transition count 294
Iterating global reduction 4 with 13 rules applied. Total rules applied 649 place count 91 transition count 294
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 650 place count 91 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 651 place count 90 transition count 293
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 651 place count 90 transition count 291
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 655 place count 88 transition count 291
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 659 place count 84 transition count 278
Iterating global reduction 6 with 4 rules applied. Total rules applied 663 place count 84 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 664 place count 84 transition count 277
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 666 place count 82 transition count 275
Iterating global reduction 7 with 2 rules applied. Total rules applied 668 place count 82 transition count 275
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 690 place count 71 transition count 264
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 703 place count 58 transition count 127
Iterating global reduction 7 with 13 rules applied. Total rules applied 716 place count 58 transition count 127
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 724 place count 58 transition count 119
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 726 place count 56 transition count 115
Iterating global reduction 8 with 2 rules applied. Total rules applied 728 place count 56 transition count 115
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 730 place count 54 transition count 113
Iterating global reduction 8 with 2 rules applied. Total rules applied 732 place count 54 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 736 place count 54 transition count 109
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 744 place count 50 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 745 place count 49 transition count 104
Applied a total of 745 rules in 58 ms. Remains 49 /474 variables (removed 425) and now considering 104/691 (removed 587) transitions.
[2024-05-29 18:30:48] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
// Phase 1: matrix 99 rows 49 cols
[2024-05-29 18:30:48] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 18:30:49] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-29 18:30:49] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
[2024-05-29 18:30:49] [INFO ] Invariant cache hit.
[2024-05-29 18:30:49] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:30:49] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-29 18:30:49] [INFO ] Redundant transitions in 4 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-29 18:30:49] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
[2024-05-29 18:30:49] [INFO ] Invariant cache hit.
[2024-05-29 18:30:49] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 4/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:30:49] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:30:49] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:30:49] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:30:49] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:30:49] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:30:49] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:30:49] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:30:49] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:30:49] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:30:49] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:30:49] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:30:49] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:30:49] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:30:50] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:30:50] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:30:50] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:30:50] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:30:50] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:30:50] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:30:50] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 98/147 variables, 49/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/148 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/148 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 86 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2728 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 4/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 98/147 variables, 49/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 95/180 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/148 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/148 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 181 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2891 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 20/20 constraints]
After SMT, in 5656ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 5657ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/474 places, 104/691 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5861 ms. Remains : 49/474 places, 104/691 transitions.
[2024-05-29 18:30:54] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:30:54] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:30:54] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-29 18:30:54] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:30:54] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:30:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality4280715699471640669.gal : 1 ms
[2024-05-29 18:30:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality11905695293234302063.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/CTLCardinality4280715699471640669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11905695293234302063.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,24160,0.110125,8080,2,1927,5,14618,6,0,292,15064,0


Converting to forward existential form...Done !
original formula: EG((p128==0))
=> equivalent forward existential formula: [FwdG(Init,(p128==0))] != FALSE
Hit Full ! (commute/partial/dont) 102/0/2
(forward)formula 0,1,0.816455,28008,1,0,22,100469,19,4,2064,101888,21
FORMULA StigmergyElection-PT-04b-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 691/691 transitions.
Graph (trivial) has 477 edges and 474 vertex of which 72 / 474 are part of one of the 12 SCC in 3 ms
Free SCC test removed 60 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 288 transitions
Trivial Post-agglo rules discarded 288 transitions
Performed 288 trivial Post agglomeration. Transition count delta: 288
Iterating post reduction 0 with 288 rules applied. Total rules applied 289 place count 413 transition count 334
Reduce places removed 288 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 296 rules applied. Total rules applied 585 place count 125 transition count 326
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 589 place count 121 transition count 326
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 589 place count 121 transition count 312
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 617 place count 107 transition count 312
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 630 place count 94 transition count 297
Iterating global reduction 3 with 13 rules applied. Total rules applied 643 place count 94 transition count 297
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 644 place count 94 transition count 296
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 645 place count 93 transition count 296
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 645 place count 93 transition count 294
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 649 place count 91 transition count 294
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 653 place count 87 transition count 281
Iterating global reduction 5 with 4 rules applied. Total rules applied 657 place count 87 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 658 place count 87 transition count 280
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 660 place count 85 transition count 278
Iterating global reduction 6 with 2 rules applied. Total rules applied 662 place count 85 transition count 278
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 684 place count 74 transition count 267
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 696 place count 62 transition count 138
Iterating global reduction 6 with 12 rules applied. Total rules applied 708 place count 62 transition count 138
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 715 place count 62 transition count 131
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 716 place count 61 transition count 129
Iterating global reduction 7 with 1 rules applied. Total rules applied 717 place count 61 transition count 129
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 718 place count 60 transition count 128
Iterating global reduction 7 with 1 rules applied. Total rules applied 719 place count 60 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 724 place count 60 transition count 123
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 732 place count 56 transition count 119
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 733 place count 56 transition count 119
Applied a total of 733 rules in 51 ms. Remains 56 /474 variables (removed 418) and now considering 119/691 (removed 572) transitions.
[2024-05-29 18:30:55] [INFO ] Flow matrix only has 114 transitions (discarded 5 similar events)
// Phase 1: matrix 114 rows 56 cols
[2024-05-29 18:30:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:30:55] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 18:30:55] [INFO ] Flow matrix only has 114 transitions (discarded 5 similar events)
[2024-05-29 18:30:55] [INFO ] Invariant cache hit.
[2024-05-29 18:30:55] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:30:55] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-29 18:30:55] [INFO ] Redundant transitions in 3 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-29 18:30:55] [INFO ] Flow matrix only has 114 transitions (discarded 5 similar events)
[2024-05-29 18:30:55] [INFO ] Invariant cache hit.
[2024-05-29 18:30:55] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 18:30:56] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:30:56] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:30:56] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:30:56] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:30:56] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:30:56] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:30:56] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:30:56] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:30:56] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:30:56] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 113/169 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 18:30:57] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:30:57] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:30:57] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 1/170 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (OVERLAPS) 0/170 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 86 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3590 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 18:30:59] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 113/169 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 116/202 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 1/170 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 18:31:03] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:31:03] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:31:03] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/170 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/170 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 14 (OVERLAPS) 0/170 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 206 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7680 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 17/17 constraints]
After SMT, in 11319ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 11322ms
Starting structural reductions in SI_CTL mode, iteration 1 : 56/474 places, 119/691 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11496 ms. Remains : 56/474 places, 119/691 transitions.
[2024-05-29 18:31:07] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:31:07] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:31:07] [INFO ] Input system was already deterministic with 119 transitions.
[2024-05-29 18:31:07] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:31:07] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:31:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality4060753427320815307.gal : 2 ms
[2024-05-29 18:31:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality5246895873876215255.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/CTLCardinality4060753427320815307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5246895873876215255.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,34570,0.134268,9040,2,2602,5,17731,6,0,338,16484,0


Converting to forward existential form...Done !
original formula: EF(AG(((EG((p71==1)) * EG((p124==0))) * ((p127==0)&&(p174==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((EG((p71==1)) * EG((p124==0))) * ((p127==0)&&(p174==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t7, t15, t16, t21, t50, t58, t59, t71, t72, t73, t92, t99, t108, t109...280
(forward)formula 0,0,4.44985,139904,1,0,443,780350,265,206,3423,598122,507
FORMULA StigmergyElection-PT-04b-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 691/691 transitions.
Graph (trivial) has 470 edges and 474 vertex of which 65 / 474 are part of one of the 11 SCC in 2 ms
Free SCC test removed 54 places
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 282 place count 419 transition count 348
Reduce places removed 281 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 289 rules applied. Total rules applied 571 place count 138 transition count 340
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 579 place count 134 transition count 336
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 585 place count 130 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 586 place count 129 transition count 334
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 586 place count 129 transition count 318
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 618 place count 113 transition count 318
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 631 place count 100 transition count 303
Iterating global reduction 5 with 13 rules applied. Total rules applied 644 place count 100 transition count 303
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 645 place count 100 transition count 302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 646 place count 99 transition count 302
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 646 place count 99 transition count 300
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 650 place count 97 transition count 300
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 653 place count 94 transition count 289
Iterating global reduction 7 with 3 rules applied. Total rules applied 656 place count 94 transition count 289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 657 place count 94 transition count 288
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 658 place count 93 transition count 287
Iterating global reduction 8 with 1 rules applied. Total rules applied 659 place count 93 transition count 287
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 681 place count 82 transition count 276
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 693 place count 70 transition count 141
Iterating global reduction 8 with 12 rules applied. Total rules applied 705 place count 70 transition count 141
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 711 place count 70 transition count 135
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 712 place count 69 transition count 133
Iterating global reduction 9 with 1 rules applied. Total rules applied 713 place count 69 transition count 133
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 714 place count 68 transition count 132
Iterating global reduction 9 with 1 rules applied. Total rules applied 715 place count 68 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 719 place count 68 transition count 128
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 727 place count 64 transition count 124
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 729 place count 64 transition count 124
Applied a total of 729 rules in 44 ms. Remains 64 /474 variables (removed 410) and now considering 124/691 (removed 567) transitions.
[2024-05-29 18:31:11] [INFO ] Flow matrix only has 119 transitions (discarded 5 similar events)
// Phase 1: matrix 119 rows 64 cols
[2024-05-29 18:31:11] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 18:31:11] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 18:31:11] [INFO ] Flow matrix only has 119 transitions (discarded 5 similar events)
[2024-05-29 18:31:11] [INFO ] Invariant cache hit.
[2024-05-29 18:31:11] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:31:11] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-29 18:31:11] [INFO ] Redundant transitions in 2 ms returned []
Running 121 sub problems to find dead transitions.
[2024-05-29 18:31:11] [INFO ] Flow matrix only has 119 transitions (discarded 5 similar events)
[2024-05-29 18:31:11] [INFO ] Invariant cache hit.
[2024-05-29 18:31:11] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 18:31:12] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:31:12] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:31:12] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:31:12] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:31:12] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
[2024-05-29 18:31:12] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:31:12] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:31:12] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:31:12] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:31:12] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:31:12] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:31:12] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:31:12] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:31:12] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:31:12] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:31:13] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:31:13] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 18:31:13] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:31:13] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 118/182 variables, 64/85 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 14/99 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 1/183 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/183 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 100 constraints, problems are : Problem set: 0 solved, 121 unsolved in 4271 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 118/182 variables, 64/85 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 14/99 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 121/220 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 18:31:17] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 18:31:18] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 18:31:19] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 2 ms to minimize.
[2024-05-29 18:31:20] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 1/183 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (OVERLAPS) 0/183 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 225 constraints, problems are : Problem set: 0 solved, 121 unsolved in 10217 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 23/23 constraints]
After SMT, in 14531ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 14533ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/474 places, 124/691 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14690 ms. Remains : 64/474 places, 124/691 transitions.
[2024-05-29 18:31:26] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:31:26] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:31:26] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-29 18:31:26] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:31:26] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:31:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality15910113247321462701.gal : 1 ms
[2024-05-29 18:31:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality11803185813637113454.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/CTLCardinality15910113247321462701.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11803185813637113454.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,56282,0.2066,11624,2,2879,5,26954,6,0,375,29732,0


Converting to forward existential form...Done !
original formula: EF((A(((p190==0)||(p152==1)) U (!(AG(((p482==0)||(p124==1)))) * EF(EG(((p314==0)||(p289==1)))))) * (p493!=1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (p493!=1)) * !(EG(!((!(!(E(TRUE U !(((p482==0)||(p124==1)))))) * E(TRUE U EG(((p314==0)||(...394
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t5, t6, t9, t11, t12, t15, t18, t19, t57, t59, t68, t69, t82, t83, t102, t103, t1...306
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,8.67908,238800,1,0,631,1.41024e+06,280,322,3566,1.0283e+06,683
FORMULA StigmergyElection-PT-04b-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 691/691 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 454 transition count 671
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 454 transition count 671
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 447 transition count 664
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 447 transition count 664
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 445 transition count 662
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 445 transition count 662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 444 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 444 transition count 661
Applied a total of 60 rules in 41 ms. Remains 444 /474 variables (removed 30) and now considering 661/691 (removed 30) transitions.
// Phase 1: matrix 661 rows 444 cols
[2024-05-29 18:31:35] [INFO ] Computed 5 invariants in 7 ms
[2024-05-29 18:31:35] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-29 18:31:35] [INFO ] Invariant cache hit.
[2024-05-29 18:31:35] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 660 sub problems to find dead transitions.
[2024-05-29 18:31:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (OVERLAPS) 1/444 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-29 18:31:45] [INFO ] Deduced a trap composed of 166 places in 158 ms of which 3 ms to minimize.
[2024-05-29 18:31:45] [INFO ] Deduced a trap composed of 165 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:31:45] [INFO ] Deduced a trap composed of 166 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:31:46] [INFO ] Deduced a trap composed of 219 places in 147 ms of which 2 ms to minimize.
[2024-05-29 18:31:47] [INFO ] Deduced a trap composed of 164 places in 115 ms of which 3 ms to minimize.
[2024-05-29 18:31:47] [INFO ] Deduced a trap composed of 163 places in 106 ms of which 2 ms to minimize.
[2024-05-29 18:31:48] [INFO ] Deduced a trap composed of 165 places in 133 ms of which 2 ms to minimize.
[2024-05-29 18:31:48] [INFO ] Deduced a trap composed of 163 places in 119 ms of which 5 ms to minimize.
[2024-05-29 18:31:49] [INFO ] Deduced a trap composed of 166 places in 134 ms of which 2 ms to minimize.
[2024-05-29 18:31:49] [INFO ] Deduced a trap composed of 164 places in 134 ms of which 3 ms to minimize.
[2024-05-29 18:31:49] [INFO ] Deduced a trap composed of 167 places in 138 ms of which 3 ms to minimize.
[2024-05-29 18:31:49] [INFO ] Deduced a trap composed of 165 places in 121 ms of which 2 ms to minimize.
[2024-05-29 18:31:50] [INFO ] Deduced a trap composed of 168 places in 149 ms of which 3 ms to minimize.
[2024-05-29 18:31:50] [INFO ] Deduced a trap composed of 166 places in 131 ms of which 2 ms to minimize.
[2024-05-29 18:31:50] [INFO ] Deduced a trap composed of 167 places in 136 ms of which 2 ms to minimize.
[2024-05-29 18:31:50] [INFO ] Deduced a trap composed of 167 places in 135 ms of which 2 ms to minimize.
[2024-05-29 18:31:50] [INFO ] Deduced a trap composed of 165 places in 137 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-29 18:31:55] [INFO ] Deduced a trap composed of 165 places in 141 ms of which 2 ms to minimize.
[2024-05-29 18:31:55] [INFO ] Deduced a trap composed of 165 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:31:55] [INFO ] Deduced a trap composed of 166 places in 143 ms of which 3 ms to minimize.
[2024-05-29 18:31:56] [INFO ] Deduced a trap composed of 164 places in 132 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/1105 variables, and 26 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/444 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (OVERLAPS) 1/444 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 21/26 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-29 18:32:12] [INFO ] Deduced a trap composed of 166 places in 138 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-29 18:32:19] [INFO ] Deduced a trap composed of 162 places in 146 ms of which 2 ms to minimize.
[2024-05-29 18:32:19] [INFO ] Deduced a trap composed of 162 places in 147 ms of which 2 ms to minimize.
[2024-05-29 18:32:19] [INFO ] Deduced a trap composed of 165 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:32:20] [INFO ] Deduced a trap composed of 166 places in 144 ms of which 3 ms to minimize.
[2024-05-29 18:32:20] [INFO ] Deduced a trap composed of 218 places in 120 ms of which 2 ms to minimize.
[2024-05-29 18:32:21] [INFO ] Deduced a trap composed of 166 places in 122 ms of which 2 ms to minimize.
[2024-05-29 18:32:22] [INFO ] Deduced a trap composed of 166 places in 118 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-29 18:32:26] [INFO ] Deduced a trap composed of 164 places in 130 ms of which 2 ms to minimize.
[2024-05-29 18:32:27] [INFO ] Deduced a trap composed of 162 places in 116 ms of which 2 ms to minimize.
[2024-05-29 18:32:29] [INFO ] Deduced a trap composed of 166 places in 146 ms of which 3 ms to minimize.
[2024-05-29 18:32:29] [INFO ] Deduced a trap composed of 165 places in 136 ms of which 2 ms to minimize.
[2024-05-29 18:32:29] [INFO ] Deduced a trap composed of 163 places in 134 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-29 18:32:35] [INFO ] Deduced a trap composed of 164 places in 119 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/1105 variables, and 40 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/444 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 35/35 constraints]
After SMT, in 60286ms problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 60294ms
Starting structural reductions in LTL mode, iteration 1 : 444/474 places, 661/691 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60755 ms. Remains : 444/474 places, 661/691 transitions.
[2024-05-29 18:32:35] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:32:35] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:32:35] [INFO ] Input system was already deterministic with 661 transitions.
[2024-05-29 18:32:35] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:32:36] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:32:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality16277145002637935972.gal : 11 ms
[2024-05-29 18:32:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality436816152114849072.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/CTLCardinality16277145002637935972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality436816152114849072.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,8.04946e+08,8.47758,204748,2,14734,5,606321,6,0,2439,882524,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:33:06] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:33:06] [INFO ] Applying decomposition
[2024-05-29 18:33:06] [INFO ] Flatten gal took : 13 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/graph7213719159974906712.txt' '-o' '/tmp/graph7213719159974906712.bin' '-w' '/tmp/graph7213719159974906712.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7213719159974906712.bin' '-l' '-1' '-v' '-w' '/tmp/graph7213719159974906712.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:33:06] [INFO ] Decomposing Gal with order
[2024-05-29 18:33:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:33:06] [INFO ] Removed a total of 791 redundant transitions.
[2024-05-29 18:33:06] [INFO ] Flatten gal took : 30 ms
[2024-05-29 18:33:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 11 ms.
[2024-05-29 18:33:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality6107123663987200857.gal : 6 ms
[2024-05-29 18:33:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality2879776548326402145.ctl : 112 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6107123663987200857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2879776548326402145.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,8.04946e+08,6.69434,222020,1870,13,359400,871,888,1.33974e+06,47,2855,0


Converting to forward existential form...Done !
original formula: AF(EG(AX(EX(((i24.i1.i2.u153.p474==0)&&(i14.u46.p273==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(!(EX(((i24.i1.i2.u153.p474==0)&&(i14.u46.p273==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t59, t106, t140, t159, t204, t238, t240, t257, t336, t338, t354, t433, t435, t456, t458, t460...467
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 691/691 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 453 transition count 670
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 453 transition count 670
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 445 transition count 662
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 445 transition count 662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 444 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 444 transition count 661
Applied a total of 60 rules in 30 ms. Remains 444 /474 variables (removed 30) and now considering 661/691 (removed 30) transitions.
// Phase 1: matrix 661 rows 444 cols
[2024-05-29 18:33:36] [INFO ] Computed 5 invariants in 6 ms
[2024-05-29 18:33:36] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-29 18:33:36] [INFO ] Invariant cache hit.
[2024-05-29 18:33:36] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Running 660 sub problems to find dead transitions.
[2024-05-29 18:33:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (OVERLAPS) 1/444 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-29 18:33:46] [INFO ] Deduced a trap composed of 163 places in 158 ms of which 3 ms to minimize.
[2024-05-29 18:33:47] [INFO ] Deduced a trap composed of 220 places in 161 ms of which 2 ms to minimize.
[2024-05-29 18:33:47] [INFO ] Deduced a trap composed of 164 places in 121 ms of which 2 ms to minimize.
[2024-05-29 18:33:48] [INFO ] Deduced a trap composed of 165 places in 110 ms of which 2 ms to minimize.
[2024-05-29 18:33:49] [INFO ] Deduced a trap composed of 219 places in 133 ms of which 2 ms to minimize.
[2024-05-29 18:33:49] [INFO ] Deduced a trap composed of 163 places in 127 ms of which 2 ms to minimize.
[2024-05-29 18:33:49] [INFO ] Deduced a trap composed of 166 places in 136 ms of which 2 ms to minimize.
[2024-05-29 18:33:49] [INFO ] Deduced a trap composed of 166 places in 122 ms of which 2 ms to minimize.
[2024-05-29 18:33:50] [INFO ] Deduced a trap composed of 166 places in 131 ms of which 2 ms to minimize.
[2024-05-29 18:33:50] [INFO ] Deduced a trap composed of 165 places in 151 ms of which 2 ms to minimize.
[2024-05-29 18:33:50] [INFO ] Deduced a trap composed of 165 places in 139 ms of which 2 ms to minimize.
[2024-05-29 18:33:51] [INFO ] Deduced a trap composed of 163 places in 142 ms of which 2 ms to minimize.
[2024-05-29 18:33:51] [INFO ] Deduced a trap composed of 165 places in 116 ms of which 2 ms to minimize.
[2024-05-29 18:33:51] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 3 ms to minimize.
[2024-05-29 18:33:51] [INFO ] Deduced a trap composed of 167 places in 140 ms of which 3 ms to minimize.
[2024-05-29 18:33:51] [INFO ] Deduced a trap composed of 164 places in 120 ms of which 2 ms to minimize.
[2024-05-29 18:33:51] [INFO ] Deduced a trap composed of 165 places in 129 ms of which 2 ms to minimize.
[2024-05-29 18:33:52] [INFO ] Deduced a trap composed of 164 places in 111 ms of which 2 ms to minimize.
[2024-05-29 18:33:52] [INFO ] Deduced a trap composed of 163 places in 132 ms of which 2 ms to minimize.
[2024-05-29 18:33:54] [INFO ] Deduced a trap composed of 166 places in 147 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-29 18:33:54] [INFO ] Deduced a trap composed of 164 places in 137 ms of which 2 ms to minimize.
[2024-05-29 18:33:54] [INFO ] Deduced a trap composed of 165 places in 117 ms of which 2 ms to minimize.
[2024-05-29 18:33:55] [INFO ] Deduced a trap composed of 166 places in 124 ms of which 2 ms to minimize.
[2024-05-29 18:33:55] [INFO ] Deduced a trap composed of 165 places in 111 ms of which 2 ms to minimize.
[2024-05-29 18:33:57] [INFO ] Deduced a trap composed of 164 places in 123 ms of which 2 ms to minimize.
[2024-05-29 18:33:57] [INFO ] Deduced a trap composed of 162 places in 140 ms of which 2 ms to minimize.
[2024-05-29 18:33:57] [INFO ] Deduced a trap composed of 164 places in 120 ms of which 3 ms to minimize.
[2024-05-29 18:33:58] [INFO ] Deduced a trap composed of 167 places in 122 ms of which 2 ms to minimize.
[2024-05-29 18:34:02] [INFO ] Deduced a trap composed of 219 places in 132 ms of which 2 ms to minimize.
[2024-05-29 18:34:02] [INFO ] Deduced a trap composed of 166 places in 147 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/1105 variables, and 35 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/444 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (OVERLAPS) 1/444 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-29 18:34:14] [INFO ] Deduced a trap composed of 162 places in 137 ms of which 2 ms to minimize.
[2024-05-29 18:34:14] [INFO ] Deduced a trap composed of 164 places in 118 ms of which 1 ms to minimize.
[2024-05-29 18:34:14] [INFO ] Deduced a trap composed of 165 places in 132 ms of which 2 ms to minimize.
[2024-05-29 18:34:15] [INFO ] Deduced a trap composed of 166 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:34:15] [INFO ] Deduced a trap composed of 166 places in 128 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-29 18:34:19] [INFO ] Deduced a trap composed of 166 places in 120 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 6 (OVERLAPS) 661/1105 variables, 444/485 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1105 variables, 660/1145 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1105/1105 variables, and 1145 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 444/444 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 36/36 constraints]
After SMT, in 60271ms problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 60282ms
Starting structural reductions in LTL mode, iteration 1 : 444/474 places, 661/691 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60771 ms. Remains : 444/474 places, 661/691 transitions.
[2024-05-29 18:34:37] [INFO ] Flatten gal took : 22 ms
[2024-05-29 18:34:37] [INFO ] Flatten gal took : 17 ms
[2024-05-29 18:34:37] [INFO ] Input system was already deterministic with 661 transitions.
[2024-05-29 18:34:37] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:34:37] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:34:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality2385243604069311414.gal : 5 ms
[2024-05-29 18:34:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality14030209419729463962.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/CTLCardinality2385243604069311414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14030209419729463962.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,8.01813e+08,8.1199,207272,2,14096,5,604456,6,0,2439,879216,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:35:07] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:35:07] [INFO ] Applying decomposition
[2024-05-29 18:35:07] [INFO ] Flatten gal took : 13 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/graph9941246681831154461.txt' '-o' '/tmp/graph9941246681831154461.bin' '-w' '/tmp/graph9941246681831154461.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9941246681831154461.bin' '-l' '-1' '-v' '-w' '/tmp/graph9941246681831154461.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:35:07] [INFO ] Decomposing Gal with order
[2024-05-29 18:35:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:35:07] [INFO ] Removed a total of 798 redundant transitions.
[2024-05-29 18:35:07] [INFO ] Flatten gal took : 27 ms
[2024-05-29 18:35:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2024-05-29 18:35:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality5321132505772828214.gal : 4 ms
[2024-05-29 18:35:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality13248081556052213772.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/CTLCardinality5321132505772828214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13248081556052213772.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,8.01813e+08,5.20958,187940,1621,13,326685,954,959,1.00077e+06,44,3066,0


Converting to forward existential form...Done !
original formula: AX(EG((EX((AX(((i13.i0.u78.p243==0)||(i18.u115.p351==1))) + (i27.i1.u171.p519==0))) + EX(TRUE))))
=> equivalent forward existential formula: [(EY(Init) * !(EG((EX((!(EX(!(((i13.i0.u78.p243==0)||(i18.u115.p351==1))))) + (i27.i1.u171.p519==0))) + EX(TRUE)...168
Reverse transition relation is NOT exact ! Due to transitions t59, t104, t138, t140, t157, t202, t236, t255, t301, t335, t353, t398, t432, t434, t455, t457...457
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 691/691 transitions.
Graph (trivial) has 478 edges and 474 vertex of which 72 / 474 are part of one of the 12 SCC in 0 ms
Free SCC test removed 60 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 284 transitions
Trivial Post-agglo rules discarded 284 transitions
Performed 284 trivial Post agglomeration. Transition count delta: 284
Iterating post reduction 0 with 284 rules applied. Total rules applied 285 place count 413 transition count 338
Reduce places removed 284 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 292 rules applied. Total rules applied 577 place count 129 transition count 330
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 583 place count 125 transition count 328
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 585 place count 123 transition count 328
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 585 place count 123 transition count 313
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 615 place count 108 transition count 313
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 627 place count 96 transition count 299
Iterating global reduction 4 with 12 rules applied. Total rules applied 639 place count 96 transition count 299
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 640 place count 96 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 641 place count 95 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 641 place count 95 transition count 297
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 643 place count 94 transition count 297
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 647 place count 90 transition count 284
Iterating global reduction 6 with 4 rules applied. Total rules applied 651 place count 90 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 652 place count 90 transition count 283
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 654 place count 88 transition count 281
Iterating global reduction 7 with 2 rules applied. Total rules applied 656 place count 88 transition count 281
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 680 place count 76 transition count 269
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 693 place count 63 transition count 132
Iterating global reduction 7 with 13 rules applied. Total rules applied 706 place count 63 transition count 132
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 713 place count 63 transition count 125
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 715 place count 61 transition count 121
Iterating global reduction 8 with 2 rules applied. Total rules applied 717 place count 61 transition count 121
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 719 place count 59 transition count 119
Iterating global reduction 8 with 2 rules applied. Total rules applied 721 place count 59 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 725 place count 59 transition count 115
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 733 place count 55 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 734 place count 54 transition count 110
Applied a total of 734 rules in 48 ms. Remains 54 /474 variables (removed 420) and now considering 110/691 (removed 581) transitions.
[2024-05-29 18:35:37] [INFO ] Flow matrix only has 106 transitions (discarded 4 similar events)
// Phase 1: matrix 106 rows 54 cols
[2024-05-29 18:35:37] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 18:35:37] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 18:35:37] [INFO ] Flow matrix only has 106 transitions (discarded 4 similar events)
[2024-05-29 18:35:37] [INFO ] Invariant cache hit.
[2024-05-29 18:35:37] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:35:37] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-29 18:35:37] [INFO ] Redundant transitions in 3 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-29 18:35:37] [INFO ] Flow matrix only has 106 transitions (discarded 4 similar events)
[2024-05-29 18:35:37] [INFO ] Invariant cache hit.
[2024-05-29 18:35:37] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 4/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-29 18:35:38] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:35:38] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:35:38] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:35:38] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:35:38] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2024-05-29 18:35:38] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:35:38] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:35:38] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-29 18:35:38] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-29 18:35:38] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 105/159 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-29 18:35:39] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:35:39] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:35:39] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 1/160 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 13 (OVERLAPS) 0/160 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 84 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3406 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 4/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 105/159 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 14/83 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 101/184 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 1/160 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/160 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 185 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2757 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 13/13 constraints]
After SMT, in 6222ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 6223ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/474 places, 110/691 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6462 ms. Remains : 54/474 places, 110/691 transitions.
[2024-05-29 18:35:44] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:35:44] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:35:44] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-29 18:35:44] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:35:44] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:35:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality9631946798477888448.gal : 1 ms
[2024-05-29 18:35:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality3546865667318308049.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/CTLCardinality9631946798477888448.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3546865667318308049.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,38034,0.108473,8376,2,2256,5,17647,6,0,318,16695,0


Converting to forward existential form...Done !
original formula: EF((EG(((p345==1)&&(p533==1))) + ((p92==0)&&(p526==1))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),((p345==1)&&(p533==1)))] != FALSE + [(FwdU(Init,TRUE) * ((p92==0)&&(p526==1)))] != FALSE)
Hit Full ! (commute/partial/dont) 106/4/4
(forward)formula 0,1,0.538952,24516,1,0,27,97028,20,3,2215,71001,26
FORMULA StigmergyElection-PT-04b-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 691/691 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 459 transition count 676
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 459 transition count 676
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 453 transition count 670
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 453 transition count 670
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 451 transition count 668
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 451 transition count 668
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 450 transition count 667
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 450 transition count 667
Applied a total of 48 rules in 42 ms. Remains 450 /474 variables (removed 24) and now considering 667/691 (removed 24) transitions.
// Phase 1: matrix 667 rows 450 cols
[2024-05-29 18:35:44] [INFO ] Computed 5 invariants in 3 ms
[2024-05-29 18:35:44] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-29 18:35:44] [INFO ] Invariant cache hit.
[2024-05-29 18:35:45] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Running 666 sub problems to find dead transitions.
[2024-05-29 18:35:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (OVERLAPS) 1/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-29 18:35:55] [INFO ] Deduced a trap composed of 166 places in 179 ms of which 2 ms to minimize.
[2024-05-29 18:35:55] [INFO ] Deduced a trap composed of 165 places in 158 ms of which 2 ms to minimize.
[2024-05-29 18:35:55] [INFO ] Deduced a trap composed of 166 places in 133 ms of which 2 ms to minimize.
[2024-05-29 18:35:56] [INFO ] Deduced a trap composed of 167 places in 116 ms of which 2 ms to minimize.
[2024-05-29 18:35:56] [INFO ] Deduced a trap composed of 167 places in 150 ms of which 3 ms to minimize.
[2024-05-29 18:35:57] [INFO ] Deduced a trap composed of 169 places in 154 ms of which 3 ms to minimize.
[2024-05-29 18:35:57] [INFO ] Deduced a trap composed of 220 places in 157 ms of which 2 ms to minimize.
[2024-05-29 18:35:57] [INFO ] Deduced a trap composed of 167 places in 112 ms of which 2 ms to minimize.
[2024-05-29 18:35:57] [INFO ] Deduced a trap composed of 167 places in 133 ms of which 2 ms to minimize.
[2024-05-29 18:35:57] [INFO ] Deduced a trap composed of 165 places in 122 ms of which 2 ms to minimize.
[2024-05-29 18:35:58] [INFO ] Deduced a trap composed of 165 places in 122 ms of which 1 ms to minimize.
[2024-05-29 18:35:58] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 1 ms to minimize.
[2024-05-29 18:35:58] [INFO ] Deduced a trap composed of 170 places in 130 ms of which 2 ms to minimize.
[2024-05-29 18:35:59] [INFO ] Deduced a trap composed of 166 places in 125 ms of which 2 ms to minimize.
[2024-05-29 18:35:59] [INFO ] Deduced a trap composed of 164 places in 127 ms of which 2 ms to minimize.
[2024-05-29 18:35:59] [INFO ] Deduced a trap composed of 171 places in 134 ms of which 2 ms to minimize.
[2024-05-29 18:35:59] [INFO ] Deduced a trap composed of 223 places in 158 ms of which 2 ms to minimize.
[2024-05-29 18:36:00] [INFO ] Deduced a trap composed of 168 places in 113 ms of which 1 ms to minimize.
[2024-05-29 18:36:00] [INFO ] Deduced a trap composed of 168 places in 133 ms of which 2 ms to minimize.
[2024-05-29 18:36:00] [INFO ] Deduced a trap composed of 164 places in 137 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-29 18:36:01] [INFO ] Deduced a trap composed of 165 places in 139 ms of which 2 ms to minimize.
[2024-05-29 18:36:01] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 2 ms to minimize.
[2024-05-29 18:36:01] [INFO ] Deduced a trap composed of 166 places in 131 ms of which 2 ms to minimize.
[2024-05-29 18:36:02] [INFO ] Deduced a trap composed of 166 places in 140 ms of which 2 ms to minimize.
[2024-05-29 18:36:03] [INFO ] Deduced a trap composed of 165 places in 141 ms of which 2 ms to minimize.
[2024-05-29 18:36:03] [INFO ] Deduced a trap composed of 163 places in 107 ms of which 2 ms to minimize.
[2024-05-29 18:36:03] [INFO ] Deduced a trap composed of 166 places in 144 ms of which 3 ms to minimize.
[2024-05-29 18:36:03] [INFO ] Deduced a trap composed of 220 places in 142 ms of which 2 ms to minimize.
[2024-05-29 18:36:03] [INFO ] Deduced a trap composed of 164 places in 130 ms of which 2 ms to minimize.
[2024-05-29 18:36:03] [INFO ] Deduced a trap composed of 219 places in 128 ms of which 3 ms to minimize.
[2024-05-29 18:36:03] [INFO ] Deduced a trap composed of 164 places in 113 ms of which 2 ms to minimize.
[2024-05-29 18:36:04] [INFO ] Deduced a trap composed of 163 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:36:04] [INFO ] Deduced a trap composed of 162 places in 109 ms of which 2 ms to minimize.
[2024-05-29 18:36:05] [INFO ] Deduced a trap composed of 165 places in 142 ms of which 3 ms to minimize.
[2024-05-29 18:36:05] [INFO ] Deduced a trap composed of 165 places in 131 ms of which 2 ms to minimize.
[2024-05-29 18:36:05] [INFO ] Deduced a trap composed of 168 places in 111 ms of which 2 ms to minimize.
[2024-05-29 18:36:06] [INFO ] Deduced a trap composed of 165 places in 121 ms of which 2 ms to minimize.
[2024-05-29 18:36:07] [INFO ] Deduced a trap composed of 165 places in 127 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 450/1117 variables, and 43 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/450 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (OVERLAPS) 1/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 38/43 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-29 18:36:23] [INFO ] Deduced a trap composed of 167 places in 130 ms of which 3 ms to minimize.
[2024-05-29 18:36:24] [INFO ] Deduced a trap composed of 166 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 5 (OVERLAPS) 667/1117 variables, 450/495 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1117 variables, 666/1161 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-29 18:36:45] [INFO ] Deduced a trap composed of 168 places in 132 ms of which 2 ms to minimize.
SMT process timed out in 60336ms, After SMT, problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 60341ms
Starting structural reductions in LTL mode, iteration 1 : 450/474 places, 667/691 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60884 ms. Remains : 450/474 places, 667/691 transitions.
[2024-05-29 18:36:45] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:36:45] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:36:45] [INFO ] Input system was already deterministic with 667 transitions.
[2024-05-29 18:36:45] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:36:45] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:36:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality8317249717528610727.gal : 3 ms
[2024-05-29 18:36:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality15975791617196326757.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/CTLCardinality8317249717528610727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15975791617196326757.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,8.57929e+08,11.2686,243280,2,20672,5,709598,6,0,2469,1.10087e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:37:15] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:37:15] [INFO ] Applying decomposition
[2024-05-29 18:37:15] [INFO ] Flatten gal took : 14 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/graph14505121092186534304.txt' '-o' '/tmp/graph14505121092186534304.bin' '-w' '/tmp/graph14505121092186534304.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14505121092186534304.bin' '-l' '-1' '-v' '-w' '/tmp/graph14505121092186534304.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:37:15] [INFO ] Decomposing Gal with order
[2024-05-29 18:37:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:37:15] [INFO ] Removed a total of 792 redundant transitions.
[2024-05-29 18:37:15] [INFO ] Flatten gal took : 28 ms
[2024-05-29 18:37:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2024-05-29 18:37:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality13630059092133312403.gal : 3 ms
[2024-05-29 18:37:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality2182855295545374673.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/CTLCardinality13630059092133312403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2182855295545374673.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,8.57929e+08,7.48341,281496,2126,14,513586,975,901,1.38127e+06,49,3710,0


Converting to forward existential form...Done !
original formula: ((A(AF(EX(!(((i22.u146.p437==1)||(i26.u167.p499==1))))) U !(E(AG(((i10.i1.i0.u65.p199==0)||(i21.u136.p404==1))) U ((i10.i1.i0.u64.p198==1...408
=> equivalent forward existential formula: [(FwdU(((Init * !((!((E(!(!(E(!(E(TRUE U !(((i10.i1.i0.u65.p199==0)||(i21.u136.p404==1))))) U ((i10.i1.i0.u64.p1...963
Reverse transition relation is NOT exact ! Due to transitions t60, t107, t141, t160, t239, t241, t258, t306, t340, t342, t358, t403, t438, t461, t463, t465...533
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 691/691 transitions.
Graph (trivial) has 483 edges and 474 vertex of which 72 / 474 are part of one of the 12 SCC in 3 ms
Free SCC test removed 60 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 289 transitions
Trivial Post-agglo rules discarded 289 transitions
Performed 289 trivial Post agglomeration. Transition count delta: 289
Iterating post reduction 0 with 289 rules applied. Total rules applied 290 place count 413 transition count 333
Reduce places removed 289 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 297 rules applied. Total rules applied 587 place count 124 transition count 325
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 592 place count 120 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 593 place count 119 transition count 324
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 593 place count 119 transition count 309
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 623 place count 104 transition count 309
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 636 place count 91 transition count 294
Iterating global reduction 4 with 13 rules applied. Total rules applied 649 place count 91 transition count 294
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 650 place count 91 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 651 place count 90 transition count 293
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 651 place count 90 transition count 291
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 655 place count 88 transition count 291
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 659 place count 84 transition count 278
Iterating global reduction 6 with 4 rules applied. Total rules applied 663 place count 84 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 664 place count 84 transition count 277
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 666 place count 82 transition count 275
Iterating global reduction 7 with 2 rules applied. Total rules applied 668 place count 82 transition count 275
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 690 place count 71 transition count 264
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 703 place count 58 transition count 127
Iterating global reduction 7 with 13 rules applied. Total rules applied 716 place count 58 transition count 127
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 724 place count 58 transition count 119
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 726 place count 56 transition count 115
Iterating global reduction 8 with 2 rules applied. Total rules applied 728 place count 56 transition count 115
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 730 place count 54 transition count 113
Iterating global reduction 8 with 2 rules applied. Total rules applied 732 place count 54 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 736 place count 54 transition count 109
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 744 place count 50 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 745 place count 49 transition count 104
Applied a total of 745 rules in 32 ms. Remains 49 /474 variables (removed 425) and now considering 104/691 (removed 587) transitions.
[2024-05-29 18:37:45] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
// Phase 1: matrix 99 rows 49 cols
[2024-05-29 18:37:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:37:45] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 18:37:45] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
[2024-05-29 18:37:45] [INFO ] Invariant cache hit.
[2024-05-29 18:37:45] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:37:46] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-29 18:37:46] [INFO ] Redundant transitions in 1 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-29 18:37:46] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
[2024-05-29 18:37:46] [INFO ] Invariant cache hit.
[2024-05-29 18:37:46] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 4/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:37:46] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:37:46] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:37:46] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:37:46] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:37:46] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:37:46] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:37:46] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:37:46] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:37:46] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:37:46] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:37:46] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:37:46] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:37:47] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:37:47] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:37:47] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 98/147 variables, 49/66 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:37:47] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 1/148 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/148 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (OVERLAPS) 0/148 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 82 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3124 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 4/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 98/147 variables, 49/67 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 14/81 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 95/176 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/148 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/148 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 177 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2769 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 16/16 constraints]
After SMT, in 5932ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 5933ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/474 places, 104/691 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6095 ms. Remains : 49/474 places, 104/691 transitions.
[2024-05-29 18:37:51] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:37:51] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:37:51] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-29 18:37:51] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:37:51] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:37:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality1665080019833254750.gal : 1 ms
[2024-05-29 18:37:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality2031483121161324740.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/CTLCardinality1665080019833254750.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2031483121161324740.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,24160,0.109813,8080,2,1888,5,15158,6,0,292,16229,0


Converting to forward existential form...Done !
original formula: AG(EF((p535==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p535==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t7, t12, t13, t36, t43, t44, t45, t53, t65, t66, t67, t86, t93, t94, t95,...275
(forward)formula 0,0,0.425594,20780,1,0,203,76998,223,93,2835,54668,212
FORMULA StigmergyElection-PT-04b-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 691/691 transitions.
Graph (trivial) has 472 edges and 474 vertex of which 70 / 474 are part of one of the 12 SCC in 1 ms
Free SCC test removed 58 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 280 place count 415 transition count 346
Reduce places removed 279 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 287 rules applied. Total rules applied 567 place count 136 transition count 338
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 573 place count 132 transition count 336
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 575 place count 130 transition count 336
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 575 place count 130 transition count 320
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 607 place count 114 transition count 320
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 619 place count 102 transition count 306
Iterating global reduction 4 with 12 rules applied. Total rules applied 631 place count 102 transition count 306
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 632 place count 102 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 633 place count 101 transition count 305
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 633 place count 101 transition count 303
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 637 place count 99 transition count 303
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 641 place count 95 transition count 290
Iterating global reduction 6 with 4 rules applied. Total rules applied 645 place count 95 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 646 place count 95 transition count 289
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 648 place count 93 transition count 287
Iterating global reduction 7 with 2 rules applied. Total rules applied 650 place count 93 transition count 287
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 672 place count 82 transition count 276
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 682 place count 72 transition count 150
Iterating global reduction 7 with 10 rules applied. Total rules applied 692 place count 72 transition count 150
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 699 place count 72 transition count 143
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 700 place count 71 transition count 141
Iterating global reduction 8 with 1 rules applied. Total rules applied 701 place count 71 transition count 141
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 702 place count 70 transition count 140
Iterating global reduction 8 with 1 rules applied. Total rules applied 703 place count 70 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 707 place count 70 transition count 136
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 715 place count 66 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 716 place count 65 transition count 131
Applied a total of 716 rules in 35 ms. Remains 65 /474 variables (removed 409) and now considering 131/691 (removed 560) transitions.
[2024-05-29 18:37:52] [INFO ] Flow matrix only has 125 transitions (discarded 6 similar events)
// Phase 1: matrix 125 rows 65 cols
[2024-05-29 18:37:52] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 18:37:52] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 18:37:52] [INFO ] Flow matrix only has 125 transitions (discarded 6 similar events)
[2024-05-29 18:37:52] [INFO ] Invariant cache hit.
[2024-05-29 18:37:52] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:37:52] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-29 18:37:52] [INFO ] Redundant transitions in 1 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-29 18:37:52] [INFO ] Flow matrix only has 125 transitions (discarded 6 similar events)
[2024-05-29 18:37:52] [INFO ] Invariant cache hit.
[2024-05-29 18:37:52] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 4/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 18:37:53] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:37:53] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:37:53] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:37:53] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:37:53] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:37:53] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:37:53] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:37:53] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:37:53] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:37:53] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:37:53] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:37:53] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 18:37:53] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:37:53] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:37:53] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:37:53] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:37:54] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:37:54] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:37:54] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 18:37:54] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:37:54] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 124/189 variables, 65/88 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 1/190 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (OVERLAPS) 0/190 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 103 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4390 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 4/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 124/189 variables, 65/88 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 122/224 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 1/190 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 18:38:00] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/190 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (OVERLAPS) 0/190 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 226 constraints, problems are : Problem set: 0 solved, 122 unsolved in 6134 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 22/22 constraints]
After SMT, in 10570ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 10571ms
Starting structural reductions in SI_CTL mode, iteration 1 : 65/474 places, 131/691 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10720 ms. Remains : 65/474 places, 131/691 transitions.
[2024-05-29 18:38:03] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:38:03] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:38:03] [INFO ] Input system was already deterministic with 131 transitions.
[2024-05-29 18:38:03] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:38:03] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:38:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality11408940408652061430.gal : 1 ms
[2024-05-29 18:38:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality11981969383434002040.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/CTLCardinality11408940408652061430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11981969383434002040.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,61226,0.123576,8856,2,2492,5,16496,6,0,382,16161,0


Converting to forward existential form...Done !
original formula: AG(A((!(AF(((p143==0)||(p195==1)))) * ((p187==0)||(p76==1))) U AG(((p241==0)&&((p79==0)||(p163==1))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(FwdU(Init,TRUE),!(!(E(TRUE U !(((p241==0)&&((p79==0)||(p163==1)))))))) * !((!(!(EG(!(((p143==0)||(...340
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t7, t8, t21, t22, t57, t58, t60, t70, t71, t83, t84, t85, t104, t111, t120, t...290
(forward)formula 0,0,2.9479,91068,1,0,281,397262,283,130,3650,335694,311
FORMULA StigmergyElection-PT-04b-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 691/691 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 453 transition count 670
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 453 transition count 670
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 445 transition count 662
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 445 transition count 662
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 443 transition count 660
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 442 transition count 659
Applied a total of 64 rules in 37 ms. Remains 442 /474 variables (removed 32) and now considering 659/691 (removed 32) transitions.
// Phase 1: matrix 659 rows 442 cols
[2024-05-29 18:38:06] [INFO ] Computed 5 invariants in 10 ms
[2024-05-29 18:38:06] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-29 18:38:06] [INFO ] Invariant cache hit.
[2024-05-29 18:38:06] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 658 sub problems to find dead transitions.
[2024-05-29 18:38:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:38:16] [INFO ] Deduced a trap composed of 162 places in 149 ms of which 3 ms to minimize.
[2024-05-29 18:38:16] [INFO ] Deduced a trap composed of 163 places in 115 ms of which 2 ms to minimize.
[2024-05-29 18:38:16] [INFO ] Deduced a trap composed of 162 places in 117 ms of which 2 ms to minimize.
[2024-05-29 18:38:16] [INFO ] Deduced a trap composed of 165 places in 143 ms of which 2 ms to minimize.
[2024-05-29 18:38:17] [INFO ] Deduced a trap composed of 165 places in 134 ms of which 2 ms to minimize.
[2024-05-29 18:38:17] [INFO ] Deduced a trap composed of 163 places in 135 ms of which 2 ms to minimize.
[2024-05-29 18:38:18] [INFO ] Deduced a trap composed of 219 places in 131 ms of which 2 ms to minimize.
[2024-05-29 18:38:18] [INFO ] Deduced a trap composed of 162 places in 121 ms of which 2 ms to minimize.
[2024-05-29 18:38:18] [INFO ] Deduced a trap composed of 164 places in 112 ms of which 2 ms to minimize.
[2024-05-29 18:38:18] [INFO ] Deduced a trap composed of 164 places in 109 ms of which 2 ms to minimize.
[2024-05-29 18:38:18] [INFO ] Deduced a trap composed of 163 places in 103 ms of which 2 ms to minimize.
[2024-05-29 18:38:18] [INFO ] Deduced a trap composed of 165 places in 133 ms of which 3 ms to minimize.
[2024-05-29 18:38:19] [INFO ] Deduced a trap composed of 164 places in 127 ms of which 2 ms to minimize.
[2024-05-29 18:38:19] [INFO ] Deduced a trap composed of 165 places in 122 ms of which 2 ms to minimize.
[2024-05-29 18:38:20] [INFO ] Deduced a trap composed of 165 places in 123 ms of which 2 ms to minimize.
[2024-05-29 18:38:20] [INFO ] Deduced a trap composed of 166 places in 122 ms of which 2 ms to minimize.
[2024-05-29 18:38:20] [INFO ] Deduced a trap composed of 165 places in 114 ms of which 2 ms to minimize.
[2024-05-29 18:38:20] [INFO ] Deduced a trap composed of 163 places in 115 ms of which 2 ms to minimize.
[2024-05-29 18:38:21] [INFO ] Deduced a trap composed of 164 places in 133 ms of which 2 ms to minimize.
[2024-05-29 18:38:21] [INFO ] Deduced a trap composed of 163 places in 119 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:38:21] [INFO ] Deduced a trap composed of 164 places in 135 ms of which 2 ms to minimize.
[2024-05-29 18:38:22] [INFO ] Deduced a trap composed of 164 places in 129 ms of which 2 ms to minimize.
[2024-05-29 18:38:22] [INFO ] Deduced a trap composed of 165 places in 135 ms of which 2 ms to minimize.
[2024-05-29 18:38:22] [INFO ] Deduced a trap composed of 163 places in 107 ms of which 2 ms to minimize.
[2024-05-29 18:38:22] [INFO ] Deduced a trap composed of 165 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:38:23] [INFO ] Deduced a trap composed of 164 places in 132 ms of which 2 ms to minimize.
[2024-05-29 18:38:24] [INFO ] Deduced a trap composed of 166 places in 135 ms of which 2 ms to minimize.
[2024-05-29 18:38:24] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 2 ms to minimize.
[2024-05-29 18:38:24] [INFO ] Deduced a trap composed of 164 places in 103 ms of which 1 ms to minimize.
[2024-05-29 18:38:25] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 3 ms to minimize.
[2024-05-29 18:38:26] [INFO ] Deduced a trap composed of 166 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:38:28] [INFO ] Deduced a trap composed of 192 places in 140 ms of which 3 ms to minimize.
[2024-05-29 18:38:28] [INFO ] Deduced a trap composed of 163 places in 136 ms of which 2 ms to minimize.
[2024-05-29 18:38:28] [INFO ] Deduced a trap composed of 166 places in 115 ms of which 2 ms to minimize.
[2024-05-29 18:38:28] [INFO ] Deduced a trap composed of 164 places in 123 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/1101 variables, and 40 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:38:45] [INFO ] Deduced a trap composed of 164 places in 120 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:38:53] [INFO ] Deduced a trap composed of 164 places in 125 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:38:55] [INFO ] Deduced a trap composed of 164 places in 116 ms of which 2 ms to minimize.
[2024-05-29 18:38:56] [INFO ] Deduced a trap composed of 164 places in 115 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/1101 variables, and 44 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 0/658 constraints, Known Traps: 39/39 constraints]
After SMT, in 60267ms problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 60277ms
Starting structural reductions in LTL mode, iteration 1 : 442/474 places, 659/691 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60714 ms. Remains : 442/474 places, 659/691 transitions.
[2024-05-29 18:39:06] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:39:06] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:39:06] [INFO ] Input system was already deterministic with 659 transitions.
[2024-05-29 18:39:06] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:39:06] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:39:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality13484985101636817952.gal : 5 ms
[2024-05-29 18:39:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality10836457229466185325.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/CTLCardinality13484985101636817952.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10836457229466185325.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,7.96896e+08,9.48966,208764,2,14684,5,623552,6,0,2429,915094,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:39:37] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:39:37] [INFO ] Applying decomposition
[2024-05-29 18:39:37] [INFO ] Flatten gal took : 14 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/graph4628464426110134848.txt' '-o' '/tmp/graph4628464426110134848.bin' '-w' '/tmp/graph4628464426110134848.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4628464426110134848.bin' '-l' '-1' '-v' '-w' '/tmp/graph4628464426110134848.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:39:37] [INFO ] Decomposing Gal with order
[2024-05-29 18:39:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:39:37] [INFO ] Removed a total of 795 redundant transitions.
[2024-05-29 18:39:37] [INFO ] Flatten gal took : 26 ms
[2024-05-29 18:39:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-05-29 18:39:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality8590022515261855881.gal : 3 ms
[2024-05-29 18:39:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality9873269486688923749.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/CTLCardinality8590022515261855881.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9873269486688923749.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,7.96896e+08,5.39885,172352,1634,13,304453,853,870,887759,42,2825,0


Converting to forward existential form...Done !
original formula: EX(EX(AG(EX(((i25.u144.p446==0)||(i10.u56.p177==1))))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U !(EX(((i25.u144.p446==0)||(i10.u56.p177==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t59, t104, t138, t157, t236, t238, t255, t299, t300, t334, t336, t352, t397, t431, t433, t454...464
(forward)formula 0,0,13.2679,368240,1,0,431196,853,6855,2.93601e+06,189,2825,1525545
FORMULA StigmergyElection-PT-04b-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-05-29 18:39:50] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:39:50] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:39:50] [INFO ] Applying decomposition
[2024-05-29 18:39:50] [INFO ] Flatten gal took : 14 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/graph4597530681490472534.txt' '-o' '/tmp/graph4597530681490472534.bin' '-w' '/tmp/graph4597530681490472534.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4597530681490472534.bin' '-l' '-1' '-v' '-w' '/tmp/graph4597530681490472534.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:39:50] [INFO ] Decomposing Gal with order
[2024-05-29 18:39:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:39:50] [INFO ] Removed a total of 801 redundant transitions.
[2024-05-29 18:39:50] [INFO ] Flatten gal took : 27 ms
[2024-05-29 18:39:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-05-29 18:39:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality3979837905494621275.gal : 4 ms
[2024-05-29 18:39:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality2320808485619273850.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/CTLCardinality3979837905494621275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2320808485619273850.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 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.84668e+08,10.4038,312572,2458,19,475041,1127,934,2.01145e+06,46,3710,0


Converting to forward existential form...Done !
original formula: E(A((EG(AG((i25.u182.p508==1))) + (!(AG((i7.u47.p137==0))) * EG((i27.u197.p548==1)))) U EX(!(EF(((i15.u104.p287==0)||(i10.u70.p195==1))))...320
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!((E(!(EX(!(E(TRUE U ((i15.u104.p287==0)||(i10.u70.p195==1)))))) U (!((EG(!(E(TRUE U !((i25.u18...802
Reverse transition relation is NOT exact ! Due to transitions t8, t18, t35, t65, t114, t148, t151, t167, t249, t251, t320, t359, t360, t362, t422, t458, t4...528
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
(forward)formula 0,0,319.877,2688660,1,0,2.81244e+06,1127,3559,2.64175e+07,122,3710,3804227
FORMULA StigmergyElection-PT-04b-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(AG((A(!(A((i1.u4.p122==1) U ((i18.u128.p351==0)||(i9.u65.p184==1)))) U ((i14.u97.p259==1)&&(i14.u98.p269==0))) + (EF(EX(((i25.u184.p51...228
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!((E(!(((i14.u97.p259==1)&&(i14.u98.p269==0))) U (!(!(!((E(!(((i18.u128.p351==...508
(forward)formula 1,1,335.469,2854188,1,0,3.46414e+06,1127,3689,2.64175e+07,127,3710,4908729
FORMULA StigmergyElection-PT-04b-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(EG(AX(EX(((i22.i1.i1.u169.p474==0)&&(i14.u100.p273==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(!(EX(((i22.i1.i1.u169.p474==0)&&(i14.u100.p273==1)))))))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 2,0,927.186,4824116,1,0,3.67718e+06,1127,2446,5.59096e+07,92,3710,432317
FORMULA StigmergyElection-PT-04b-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(EG((EX((AX(((i11.u88.p243==0)||(i18.u128.p351==1))) + (i25.u186.p519==0))) + EX(TRUE))))
=> equivalent forward existential formula: [(EY(Init) * !(EG((EX((!(EX(!(((i11.u88.p243==0)||(i18.u128.p351==1))))) + (i25.u186.p519==0))) + EX(TRUE)))))] ...162
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
(forward)formula 3,1,978.709,4824116,1,0,3.67718e+06,1127,3694,5.59096e+07,122,3710,2936560
FORMULA StigmergyElection-PT-04b-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((A(AF(EX(!(((i23.u156.p437==1)||(i24.u179.p499==1))))) U !(E(AG(((i10.u72.p199==0)||(i21.u144.p404==1))) U ((i10.u70.p198==1) * EX(((i11...409
=> equivalent forward existential formula: [(FwdU(((Init * !((!((E(!(!(E(!(E(TRUE U !(((i10.u72.p199==0)||(i21.u144.p404==1))))) U ((i10.u70.p198==1) * EX(...942
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
(forward)formula 4,1,1175.85,5399692,1,0,4.83048e+06,1127,4118,5.59096e+07,155,3773,4041213
FORMULA StigmergyElection-PT-04b-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

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

BK_STOP 1717009168817

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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